Direkt zum InhaltDirekt zur SucheDirekt zur Navigation
▼ Zielgruppen ▼

Humboldt-Universität zu Berlin - Wirtschaftswissenschaftliche Fakultät

Prof. Dr. Max Klimm

I am a tenure-track Assistant professor in Operations Research at the School of Business and Economics at Humboldt-Universität zu Berlin.

Before joing HU Berlin, I was leader of the junior research group "Optimization under Uncertainty" at TU Berlin. I received my Ph.D. in mathematics from TU Berlin under the supervision of Tobias Harks and Rolf H. Möhring.

Click here to see my full CV.

Research interests

  • algorithmic game theory

  • efficient algorithms

  • operations research
  • mechanism design

Activities

Projects

Publications

2020

  • Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians (M. Klimm and P. Warode)
    Proc. 31st ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020.

2019

  • Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Y. Disser, J. Hackfeld, and M. Klimm)
    Journal of the ACM, to appear.
    [preliminary version in SODA 2016]
  • Hiring Secretaries over Time: The Benefit of Concurrent Employment (Y. Disser, J. Fearnley, M. Gairing, O. Göbel, M. Klimm, D. Schmand, A. Skopalik, and A. Tönnis)
    Mathematics of Operations Research, 2019.
    [arXiv]
  • Distance-Preserving Graph Contractions (A. Bernstein, K. Däubel, Y. Disser, M. Klimm, T. Mütze, and F. Smolny)
    SIAM Journal on Discrete Mathematics 33(3), 2019.
    [pdf] [preliminary version in ITCS 2018]
  • Greedy Metric Minimum Online Matchings with Random Arrivals (M. Gairing and M. Klimm)
    Operations Research Letters 47(2), pp. 88-91, 2019.
  • Computing all Wardrop Equilibria parametrized by the Flow Demand (M. Klimm and P. Warode)
    Proc. 30th ACM-SIAM Sympium on Discrete Algorithms (SODA), 2019
    [arXiv]
  • Travelling on Graphs with Small Highway Dimension (Y. Disser, A. E. Feldmann, M. Klimm, and J. Koenemann)
    Proc. 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 175-189, 2019.
  • The Online Best Reply Algorithm for Resource Allocation Problems (M. Klimm, D. Schmand, A. Tönnis)
    Proc. 12th International Symposium on Algorithmic Game Theory (SAGT), pp. 200-215, 2019.

2018

  • Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids (T. Harks, M. Klimm, and B. Peis)
    SIAM Journal on Optimization 28(3), pp. 2222-2245, 2018.
    [pdf] [preliminary version in WINE 2014]
  • Bottleneck Routing with Elastic Demands (T. Harks, M. Klimm, and M. Schneider)
    Operations Research Letters 46(1), pp. 93-98, 2018.
  • Distance-Preserving Graph Contractions (A. Bernstein, K. Däubel, Y. Disser, T. Mütze, and F. Smolny)
    Proc. 9th Innovations in Theoretical Computer Science (ITCS), Art. Nr. 51, 2018.
    [arXiv] [extended version in SIDMA 2019]

2017

  • Complexity and Approximation of the Continuous Network Design Problem (M. Gairing, T. Harks, and M. Klimm)
    SIAM Journal on Optimization 27(3), pp. 1554-1582, 2017.
    [pdf] [preliminary version in APPROX 2014]
  • Packing a Knapsack of Unknown Capacity (Y. Disser, M. Klimm, N. Megow, and S. Stiller)
    SIAM Journal on Discrete Mathematics 31(3), pp. 1477-1497, 2017.
    [pdf] [preliminary version in STACS 2015]
  • Impartial Selection and the Power of up to Two Choices (A. Bjelde, F. Fischer, and M. Klimm)
    ACM Transactions on Economics and Computation 5(4), Art. Nr. 21, 2017.
    [pdf] [preliminary version in WINE 2015]
  • Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale (A. Bjelde, M. Klimm, and D. Schmand)
    Proc. 29th ACM Sympium on Parallelism in Algorithms and Architectures (SPAA), pp. 227-229, 2017

2016

  • Congestion Games with Variable Demands (T. Harks and M. Klimm)
    Mathematics of Operations Research 41(1), pp. 255-277, 2016.
    [preliminary version in TARK 2011]
  • Undirected Graph Exploration with ⊝(log log n) Pebbles (Y. Disser, J. Hackfeld, and M. Klimm)
    Proc. 27th ACM-SIAM Sympium on Discrete Algorithms (SODA), pp. 25-39, 2016.
    [extended version in JACM 2019]
  • Efficiency of Equilibria in Uniform Matroid Congestion Games (J. de Jong, M. Klimm, and M. Uetz)
    Proc. 9th Internat. Symp. on Algorithmic Game Theory (SAGT), pp. 105-116, 2016.

2015

  • Optimal Impartial Selection (F. Fischer and M. Klimm)
    SIAM Journal on Computing 44(5), pp. 1263-1285, 2015.
    [pdf] [preliminary version in EC 2014]
  • Computing Network Tolls with Support Constraints (T. Harks, I. Kleinert, M. Klimm, and R. H. Möhring)
    Networks 65(3), pp. 262-285, 2015.
  • Equilibria in a Class of Aggregative Location Games (T. Harks and M. Klimm)
    Journal of Mathematical Economics 61, pp. 211-220, 2015.
  • Improving the Hk-bound on the price of stability in undirected Shapley network design games (Y. Disser, A. E. Feldmann, M. Klimm, and M. Mihalak)
    Theoretical Computer Science 562, pp. 557-564, 2015.
    [preliminary version in CIAC 2013]
  • Scheduling Bidirectional Traffic on a Path (Y. Disser, M. Klimm, and E. Lübbecke)
    Proc. 42nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 406-418, 2015.
  • Impartial Selection and the Power of up to Two Choices (A. Bjelde, F. Fischer, and M. Klimm)
    Proc. 11th International Conference on Web and Internet Economics (WINE), pp. 146-158, 2015
    [extended version in TEAC 2017]
  • Bottleneck Routing with Elastic Demands (T. Harks, M. Klimm, and M. Schneider) 
    Proc. 11th International Conference on Web and Internet Economics (WINE), pp. 384-397, 2015
    [extended version in OR Letters 2018]
  • Sharing Non-anonymous Costs of Multiple Resources Optimally (M. Klimm and D. Schmand)
    Proc. 9th International Conference on Algorithms and Complexity (CIAC), pp. 274-287, 2015
  • Linear, Exponential, but Nothing Else (M. Klimm)
    in Gems of Combinatorial Optimization and Graph Algorithms, pp. 113-123, 2015.

2014

  • Packing a Knapsack of Unknown Capacity (Y. Disser, M. Klimm, N. Megow, and S. Stiller)
    Proc. 31st International Symposium on Theoretical Aspects of Computer Science (STACS), 276-287, 2014.
    [extended version in SIDMA 2017]
  • Optimal Impartial Selection (F. Fischer and M. Klimm)
    Proc. 15th ACM Conference on Economics and Computation (EC), pp. 803-820, 2014.
    [extended version in SICOMP 2015]
  • Complexity and Approximation of the Continuous Network Design Problem (M. Gairing, T. Harks, and M. Klimm)
    Proc. 18th International Workshop on Approximation Algorithms (APPROX), pp. 226-241, 2014.
    [extended version in SIOPT 2017]
  • Resource Competition on Integral Polymatroids (T. Harks, M. Klimm, and B. Peis)
    Proc. 10th International Conference on Web and Internet Economics (WINE), pp. 189-202, 2014.
    [extended version in SIOPT 2018]
  • Approximate Pure Nash Equilibria in Weighted Congestion Games (C. Hansknecht, M. Klimm, and A. Skopalik)
    Proc. 18th International Workshop on Approximation Algorithms (APPROX), pp. 242-257, 2014.
  • Congestion Games with Higher Demand Dimensions (M. Klimm and A. Schütz)
    Proc. 10th International Conference on Web and Internet Economics (WINE), pp. 453-459, 2014.
  • Multimarket Oligopolies with Restricted Market Access (T. Harks and M. Klimm)
    Proc. 7th International Symposium on Algorithmic Game Theory (SAGT), pp. 182-193, 2014.

2013

  • Strong Equilibria in Games with the Lexicographical Improvement Property (T. Harks, M. Klimm, and R. H. Möhring)
    International Journal on Game Theory 42(2), pp. 461-482, 2013.
    [preliminary version in WINE 2009]
  • Computing pure Nash and strong equilibria in bottleneck congestion games (T. Harks, M. Hoefer, M. Klimm, and A. Skopalik)
    Mathematical Programming 141(1-2), pp. 193-215, 2013.
    [preliminary version in ESA 2010]
  • Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games (Y. Disser, A. E. Feldmann, M. Klimm, and M. Mihalak)
    Proc. 8th Internat. Conf. on Algorithms and Complexity (CIAC) pp. 158-169, 2013.
    [extended version in TCS 2015]
  • Congestion Games with Player-Specific Costs Revisited (M. Gairing and M. Klimm)
    Proc. 6th International Symposium on Algorithmic Game Theory (SAGT), pp. 98-109, 2013.
  • Competition for Resources (M. Klimm)
    Selected Papers of the Internat. Conf. on Operations Research, pp. 249-254, 2013.

2012

  • On the Existence of Pure Nash Equilibria in Weighted Congestion Games (T. Harks and M. Klimm)
    Mathematics of Operations Research 37(3), pp. 419-436, 2012.
    [pdf] [preliminary version in ICALP 2010]
  • Conflict-free vehicle routing: Load balancing and deadlock prevention (E. Gawrilow, M. Klimm, R. H. Möhring, and B. Stenzel)
    EURO Journal on transportation and logistics 1(1-2), pp. 87-111, 2012.

2011

  • Characterizing the Existence of Potential Functions in Weighted Congestion Games (T. Harks, M. Klimm, and R. H. Möhring)
    Theory of Computing Systems 49(1), pp. 46-70, 2011.
    [preliminary version in SAGT 2009]
  • Congestion games with Variable Demands (T. Harks and M. Klimm)
    Proc. 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), pp. 111-120, 2011.
    [extended version in MOR 2016]
  • Optimal File Distribution in Peer-to-Peer Networks (K.-S. Goetzmann, T. Harks, M. Klimm, and K. Miller)
    Proc. 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 210-219, 2011.
  • Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces (T. Harks and M. Klimm)
    Proc. 7th International Workshop on Internet and Network Economics (WINE), pp. 194-205, 2011.

2010

  • On the Existence of Pure Nash Equilibria in Weighted Congestion Games (T. Harks and M. Klimm)
    Proc. 37th International Colloquium on Automata, Languages and Programming (ICALP), pp. 79-89, 2010
    [extended version in MOR 2012]
  • Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (T. Harks, M. Hoefer, M. Klimm, and A. Skopalik)
    Proc. 18th Annual European Symposium on Algorithms (ESA), pp. 29-38, 2010
    [extended version in MAPR 2013]

2009

  • Strong Nash Equilibria in Games with the Lexicographical Improvement Property (T. Harks and R. H. Möhring)
    Proc. 5th International Workshop on Internet and Network Economics (WINE), pp. 463-470, 2009.
    [extended version in IJGT 2013]
  • Characterizing the Existence of Potential Functions in Weighted Congestion Games (T. Harks, M. Klimm, and R. H. Möhring)
    Proc. 2nd International Symposium on Algorithmic Game Theory (SAGT), pp. 97-108, 2009.
    [extended version TOCS 2011]