Max Klimm
Max Klimm
Operations Research, Humboldt University Berlin
Adresse e-mail validée de hu-berlin.de - Page d'accueil
Titre
Citée par
Citée par
Année
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
692011
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
672012
Strong Nash equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Workshop on Internet and Network Economics, 463-470, 2009
482009
Optimal impartial selection
F Fischer, M Klimm
SIAM Journal on Computing 44 (5), 1263-1285, 2015
342015
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
332010
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
32*2012
Strong equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Journal of Game Theory 42 (2), 461-482, 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
262010
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
242013
Congestion games with player-specific costs revisited
M Gairing, M Klimm
International Symposium on Algorithmic Game Theory, 98-109, 2013
212013
Packing a knapsack of unknown capacity
Y Disser, M Klimm, N Megow, S Stiller
SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017
192017
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
172016
Computing network tolls with support constraints
T Harks, I Kleinert, M Klimm, RH Möhring
Networks 65 (3), 262-285, 2015
172015
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
172015
Approximate Pure Nash Equilibria in Weighted Congestion Games
C Hansknecht, M Klimm, A Skopalik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
172014
Scheduling bidirectional traffic on a path
Y Disser, M Klimm, E Lübbecke
International Colloquium on Automata, Languages, and Programming, 406-418, 2015
16*2015
Resource competition on integral polymatroids
T Harks, M Klimm, B Peis
International Conference on Web and Internet Economics, 189-202, 2014
152014
Congestion Games with Variable Demands
T Harks, M Klimm
Mathematics of Operations Research 41 (1), 255-277, 2016
14*2016
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
132017
Sharing non-anonymous costs of multiple resources optimally
M Klimm, D Schmand
International Conference on Algorithms and Complexity, 274-287, 2015
132015
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20