Folgen
Max Klimm
Max Klimm
Bestätigte E-Mail-Adresse bei tu-berlin.de
Titel
Zitiert von
Zitiert von
Jahr
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
1112012
Characterizing the Existence of Potential Functions in Weighted Congestion Games
T Harks, M Klimm, RH Möhring
Theory of Computing Systems 49 (1), 46-70, 2011
862011
Optimal impartial selection
F Fischer, M Klimm
Proceedings of the fifteenth ACM conference on Economics and computation …, 2014
582014
Strong Nash equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009
532009
Conflict-free vehicle routing: Load balancing and deadlock prevention
E Gawrilow, M Klimm, RH Möhring, B Stenzel
EURO Journal on transportation and logistics 1 (1-2), 87-111, 2012
50*2012
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
International Colloquium on Automata, Languages, and Programming, 79-89, 2010
382010
Computing network tolls with support constraints
T Harks, I Kleinert, M Klimm, RH Möhring
Networks 65 (3), 262-285, 2015
342015
Strong equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Journal of Game Theory 42, 461-482, 2013
342013
Computing pure Nash and strong equilibria in bottleneck congestion games
T Harks, M Hoefer, M Klimm, A Skopalik
Mathematical Programming 141 (1-2), 193-215, 2013
292013
Computing pure Nash and strong equilibria in bottleneck congestion games
T Harks, M Hoefer, M Klimm, A Skopalik
Algorithms–ESA 2010, 29-38, 2010
282010
Impartial selection and the power of up to two choices
A Bjelde, F Fischer, M Klimm
ACM Transactions on Economics and Computation (TEAC) 5 (4), 1-20, 2017
272017
Approximate Pure Nash Equilibria in Weighted Congestion Games
C Hansknecht, M Klimm, A Skopalik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
262014
Packing a knapsack of unknown capacity
Y Disser, M Klimm, N Megow, S Stiller
SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017
252017
Undirected Graph Exploration with ⊝(log log n) Pebbles
Y Disser, J Hackfeld, M Klimm
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
252016
Tight bounds for undirected graph exploration with pebbles and multiple agents
Y Disser, J Hackfeld, M Klimm
Journal of the ACM (JACM) 66 (6), 1-41, 2019
242019
Congestion games with player-specific costs revisited
M Gairing, M Klimm
International Symposium on Algorithmic Game Theory, 98-109, 2013
232013
Revenue gaps for discriminatory and anonymous sequential posted pricing
P Dütting, FA Fischer, M Klimm
CoRR, abs/1607.07105, 2016
212016
Improving the Hk-bound on the price of stability in undirected shapley network design games
Y Disser, AE Feldmann, M Klimm, M Mihalák
Theoretical Computer Science 562, 557-564, 2015
212015
Sharing non-anonymous costs of multiple resources optimally
M Klimm, D Schmand
Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris …, 2015
192015
Complexity and approximation of the continuous network design problem
M Gairing, T Harks, M Klimm
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
19*2013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20