| On the Existence of Pure Nash Equilibria in Weighted Congestion Games T Harks, M Klimm Mathematics of Operations Research 37 (3), 419-436, 2012 | 114 | 2012 |
| 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 | 90 | 2011 |
| Optimal impartial selection F Fischer, M Klimm Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 63 | 2014 |
| 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 | 55 | 2009 |
| 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 | 51* | 2012 |
| Computing network tolls with support constraints T Harks, I Kleinert, M Klimm, RH Möhring Networks 65 (3), 262-285, 2015 | 38 | 2015 |
| 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 | 37 | 2010 |
| 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 | 35 | 2013 |
| 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 | 29 | 2017 |
| Packing a knapsack of unknown capacity Y Disser, M Klimm, N Megow, S Stiller SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017 | 28 | 2017 |
| 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 | 28 | 2013 |
| 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 | 27 | 2019 |
| Computing pure Nash and strong equilibria in bottleneck congestion games T Harks, M Hoefer, M Klimm, A Skopalik Algorithms–ESA 2010, 29-38, 2010 | 27 | 2010 |
| 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 | 26 | 2016 |
| Approximate Pure Nash Equilibria in Weighted Congestion Games C Hansknecht, M Klimm, A Skopalik Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 25 | 2014 |
| Revenue gaps for discriminatory and anonymous sequential posted pricing P Dütting, FA Fischer, M Klimm CoRR, 2016 | 23 | 2016 |
| Congestion games with player-specific costs revisited M Gairing, M Klimm International Symposium on Algorithmic Game Theory, 98-109, 2013 | 23 | 2013 |
| Complexity and approximation of the continuous network design problem M Gairing, T Harks, M Klimm Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013 | 22* | 2013 |
| Improving the H k-Bound on the Price of Stability in Undirected Shapley Network Design Games Y Disser, AE Feldmann, M Klimm, M Mihalák Algorithms and Complexity, 158-169, 2013 | 22 | 2013 |
| Efficiency of equilibria in uniform matroid congestion games J De Jong, M Klimm, M Uetz International Symposium on Algorithmic Game Theory, 105-116, 2016 | 21 | 2016 |
