Prof. Dr. Max Klimm
Head of the research group
Fakultät II - Mathematik und Naturwissenschaften
Institut für Mathematik, Sekr. MA 5-2
Technische Universität Berlin
Straße des 17. Juni 136
10623 Berlin
Office: MA 502
Telephone: +49 30 314 29400
Email: (lastname)@math.tu-berlin.de
Activities
- Associate editor of Operations Research Forum, OR Spektrum
- Member of the Program Commitee of
EC 2020, EC 2018, EC 2015
IJCAI 2020, IJCAI 2019, IJCAI 2018
ICALP 2019
SAGT 2021, SAGT 2020 (Co-Chair), SAGT 2016, SAGT 2015
WINE 2021, WINE 2020, WINE 2015
Teaching
Show all courses
Projects
Publications
to appear
- On the Robustness of Potential-Based Flow Networks (Klimm M, Pfetsch ME, Raber R and Skutella M)
Mathematical Programming, to appear.
- Equilibria in Multi-Class and Multi-Dimensional Atomic Congestion Games (Klimm M and Schütz A)
Mathematics of Operations Research, to appear.
- Competitive Algorithms for Symmetric Rendezvous on the Line (Klimm M, Sagnol G, Skutella M and Tran KV)
SODA 2022 – Proc. 33rd ACM-SIAM Symposium on Discrete Algorithms.
- Multi-Leader Congestion Games with an Adversary (Harks T, Henle M, Klimm M, Matuschke J and Schedel A)
AAAI 2022 – Proc. 36th Conference on Artificial Intelligence.
2021
- Parametric Computation of Minimum Cost Flows with Piecewise Quadratic Costs (Klimm M and Warode P)
Mathematics of Operations Research, 2021.
- Packing Under Convex Quadratic Constraints (Klimm M, Pfetsch ME, Raber R and Skutella M)
Mathematical Programming, 2021.
- Pure Nash Equilibria in Resource Graph Games (Harks T, Klimm M and Matuschke J)
Journal of Artificial Intelligence Research, 72:185–213, 2021.
- Travelling on Graphs with Small Highway Dimension (Disser Y, Feldmann AE, Klimm M and Könemann J)
Algorithmica, 83(5):1352–1370, 2021.
- Fractionally Subadditive Maximization under an Incremental Knapsack Constraint (Disser Y, Klimm M and Weckbecker D)
WAOA 2021 – Proc. 19th Workshop on Approximation and Online Algorithms.
2020
- Hiring Secretaries over Time: The Benefit of Concurrent Employment (Disser Y, Fearnley J, Gairing M, Göbel O, Klimm M, Schmand D, Skopalik A and Tönnis A)
Mathematics of Operations Research, 45(1):323–352, 2020.
- Broadcasting a File in a Communication Network (Goetzmann KS, Harks T and Klimm M)
Journal of Scheduling, 23(2):211–232, 2020.
- Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians (Klimm M and Warode P)
SODA 2020 – Proc. 31st ACM-SIAM Symposium on Discrete Algorithms, pp. 2728–2747.
- Packing Under Convex Quadratic Constraints (Klimm M, Pfetsch ME, Raber R and Skutella M)
IPCO 2020 – Proc. 21st Conference on Integer Programming and Combinatorial Optimization, pp. 266–279.
Extended version appeared in Math. Program. 2021
- SAGT 2020 – Proc. 13th International Symposium on Algorithmic Game Theory (Harks T, Klimm M, eds.), Springer, 2020.
- Nobel, Milgrom und Wilson (Klimm M)
Chapter in Mitteilungen der Deutschen Mathematiker-Vereinigung, 2020.
2019
- Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents (Disser Y, Hackfeld J and Klimm M)
Journal of the ACM, 66(6):40:1–40:41, 2019.
- Distance-Preserving Graph Contractions (Bernstein A, Däubel K, Disser Y, Klimm M, Mütze T and Smolny F)
SIAM Journal on Discrete Mathematics, 33(3):1607–1636, 2019.
- Greedy Metric Minimum Online Matchings with Random Arrivals (Gairing M and Klimm M)
Operations Research Letters, 47(2):88–91, 2019.
- Computing all Wardrop Equilibria parametrized by the Flow Demand (Klimm M and Warode P)
SODA 2019 – Proc. 30th ACM-SIAM Symposium on Discrete Algorithms, pp. 917–934.
Extended version "Parametric Computation of Minimum Cost Flows with Piecewise Quadratic Costs" appeared in Math. Oper Res. 2021
- Travelling on Graphs with Small Highway Dimension (Disser Y, Feldmann AE, Klimm M and Könemann J)
WG 2019 – Proc. 45th Workshop on Graph-Theoretic Concepts in Computer Science, pp. 175–189.
Extended version appeared in Algorithmica 2021
- The Online Best Reply Algorithm for Resource Allocation Problems (Klimm M, Schmand D and Tönnis A)
SAGT 2019 – Proc. 12th International Symposium on Algorithmic Game Theory, pp. 200–215.
2018
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Harks T, Klimm M and Peis B)
SIAM Journal on Optimization, 28(3):2222–2245, 2018.
- Bottleneck Routing with Elastic Demands (Harks T, Klimm M and Schneider M)
Operations Research Letters, 46(1):93–98, 2018.
- Demand-Independent Optimal Tolls (Colini-Baldeschi R, Klimm M and Scarsini M)
ICALP 2018 – Proc. 45th International Colloquium on Automata, Languages and Programming, pp. 151:1–151:14.
- Distance-Preserving Graph Contractions (Bernstein A, Däubel K, Disser Y, Klimm M, Mütze T and Smolny F)
ITCS 2018 – Proc. 9th Innovations in Computer Science Conference, pp. 51:1–51:14.
Extended version appeared in SIAM. J. Discr. Math. 2019
2017
- Complexity and Approximation of the Continuous Network Design Problem (Gairing M, Harks T and Klimm M)
SIAM Journal on Optimization, 27(3):1554–1582, 2017.
- Packing a Knapsack of Unknown Capacity (Disser Y, Klimm M, Megow N and Stiller S)
SIAM Journal on Discrete Mathematics, 31(3):1477–1497, 2017.
- Impartial Selection and the Power of Up to Two Choices (Bjelde A, Fischer FA and Klimm M)
ACM Transactions on Economics and Computation, 5(4):21:1–21:20, 2017.
- Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale (Bjelde A, Klimm M and Schmand D)
SPAA 2017 – Proc. 29th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 227–229.
2016
- Congestion Games with Variable Demands (Harks T and Klimm M)
Mathematics of Operations Research, 41(1):255–277, 2016.
- Undirected Graph Exploration with \ensuremath\Theta(log log n) Pebbles (Disser Y, Hackfeld J and Klimm M)
SODA 2016 – Proc. 27th ACM-SIAM Symposium on Discrete Algorithms, pp. 25–39.
Extended version "Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents" appeared in J. ACM 2019
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Jong Jde, Klimm M and Uetz M)
SAGT 2016 – Proc. 9th International Symposium on Algorithmic Game Theory, pp. 105–116.
2015
- Optimal Impartial Selection (Fischer FA and Klimm M)
SIAM Journal on Computing, 44(5):1263–1285, 2015.
- Equilibria in a Class of Aggregative Location Games (Klimm M and Harks T)
Journal of Mathematical Economics, 61(1):211–220, 2015.
- Computing Network Tolls with Support Constraints (Harks T, Kleinert I, Klimm M and Möhring RH)
Networks, 65(3):262–285, 2015.
- Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games (Disser Y, Feldmann AE, Klimm M and Mihalák M)
Theoretical Computer Science, 562:557–564, 2015.
- Scheduling Bidirectional Traffic on a Path (Disser Y, Klimm M and Lübbecke E)
ICALP 2015 – Proc. 42nd International Colloquium on Automata, Languages and Programming, pp. 406–418.
- Impartial Selection and the Power of up to Two Choices (Bjelde A, Fischer FA and Klimm M)
WINE 2015 – Proc. 11th Conference on Web and Internet Economics, pp. 146–158.
Extended version appeared in ACM Trans. Econ. Comput. 2017
- Sharing Non-anonymous Costs of Multiple Resources Optimally (Klimm M and Schmand D)
CIAC 2015 – Proc. 9th International Conference on Algorithms and Complexity, pp. 274–287.
- Bottleneck Routing with Elastic Demands (Harks T, Klimm M and Schneider M)
WINE 2015 – Proc. 11th Conference on Web and Internet Economics, pp. 384–397.
Extended version appeared in Oper. Res. Lett. 2018
- Linear, Exponential, but Nothing Else (Klimm M)
Chapter in Gems of Combinatorial Optimization and Graph Algorithms (Schulz AS, Skutella M, Stiller S, Wagner D, eds.), Springer, 2015.
2014
- Optimal Impartial Selection (Fischer FA and Klimm M)
EC 2014 – Proc. 15th ACM Conference on Economics and Computation, pp. 803–820.
Extended version appeared in SIAM J. Comput. 2015
- Packing a Knapsack of Unknown Capacity (Disser Y, Klimm M, Megow N and Stiller S)
STACS 2014 – Proc. 31st International Symposium on Theoretical Aspects of Computer Science, pp. 276–287.
Extended version appeared in SIAM J. Disc. Math. 2017
- Approximate Pure Nash Equilibria in Weighted Congestion Games (Hansknecht C, Klimm M and Skopalik A)
APPROX 2014 – Proc. 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 242–257.
- Complexity and Approximation of the Continuous Network Design Problem (Gairing M, Harks T and Klimm M)
APPROX 2014 – Proc. 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 226–241.
Extended version appeared in SIAM J. Optim. 2017
- Congestion Games with Higher Demand Dimensions (Klimm M and Schütz A)
WINE 2014 – Proc. 10th Conference on Web and Internet Economics, pp. 453–459.
Extended version "Equilibria in Multi-Class and Multi-Dimensional Atomic Congestion Games" to appear in Math. Oper. Res.
- Multimarket Oligopolies with Restricted Market Access (Harks T and Klimm M)
SAGT 2014 – Proc. 7th International Symposium on Algorithmic Game Theory, pp. 182–193.
- Resource Competition on Integral Polymatroids (Harks T, Klimm M and Peis B)
WINE 2014 – Proc. 10th Conference on Web and Internet Economics, pp. 189–202.
Extended version "Senstitivity Analysis of Convex Separable Optimization Over Integral Polymatroids" appeared in SIAM J. Optim. 2018
2013
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (Harks T, Hoefer M, Klimm M and Skopalik A)
Mathematical Programming, 141(1-2):193–215, 2013.
- Strong Equilibria in Games with the Lexicographical Improvement Property (Harks T, Klimm M and Möhring RH)
International Journal of Game Theory, 42(2):461–482, 2013.
- Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games (Disser Y, Feldmann AE, Klimm M and Mihalák M)
CIAC 2013 – Proc. 8th International Conference on Algorithms and Complexity, pp. 158–169.
Extended version appeared in Theor. Comput Sci. 2015
- Congestion Games with Player-Specific Costs Revisited (Gairing M and Klimm M)
SAGT 2013 – Proc. 6th International Symposium on Algorithmic Game Theory, pp. 98–109.
2012
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games (Harks T and Klimm M)
Mathematics of Operations Research, 37(3):419–436, 2012.
- Conflict-Free Vehicle Routing (Gawrilow E, Klimm M, Möhring RH and Stenzel B)
EURO Journal on Transportation and Logistics, 1(1-2):87–111, 2012.
2011
- Characterizing the Existence of Potential Functions in Weighted Congestion Games (Harks T, Klimm M and Möhring RH)
Theory of Computing Systems, 49(1):46–70, 2011.
- Congestion Games with Variable Demands (Harks T and Klimm M)
TARK 2011 – Proc. 13th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 111–120.
Extended version appeared in Math. Oper. Res. 2016
- Optimal File Distribution in Peer-to-Peer Networks (Goetzmann KS, Harks T, Klimm M and Miller K)
ISAAC 2011 – Proc. 22nd International Symposium on Algorithms and Computation, pp. 210–219.
Extended version "Broadcasting a File in a Communication Network" appeared in J. Sched. 2020
- Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces (Harks T and Klimm M)
WINE 2011 – Proc. 7th Conference on Web and Internet Economics, pp. 194–205.
2010
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games (Harks T and Klimm M)
ICALP 2010 – Proc. 37th International Colloquium on Automata, Languages and Programming, pp. 79–89.
Extended version appeared in Math. Oper. Res. 2012
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games (Harks T, Hoefer M, Klimm M and Skopalik A)
ESA 2010 – Proc. 18th European Symposium on Algorithms, pp. 29–38.
Extended version appeared in Math. Program. 2013
2009
- Strong Nash Equilibria in Games with the Lexicographical Improvement Property (Harks T, Klimm M and Möhring RH)
WINE 2009 – Proc. 5th Conference on Web and Internet Economics, pp. 463–470.
Extended version "Strong equilibria in games with the lexicographical improvement property" appeared in Int. J. Game Theory 2013
- Characterizing the Existence of Potential Functions in Weighted Congestion Games (Harks T, Klimm M and Möhring RH)
SAGT 2009 – Proc. 2nd International Symposium on Algorithmic Game Theory, pp. 97–108.
Extended version appeared in Theory Comput. Syst. 2011