MK
Max Klimm
cs.GTcs.DScs.DMmath.OCecon.THmath.COcs.CCmath.MGarchaeologycs.AI
On Valency
published · living versionsW_e8eu6mvx·v1 · currentpublished
The Complexity of Continuous Contract Design over Polymatroids
with Paul Lippke, Philipp Warode
1 version
Preprints & journals
51 papers in the corpus · 2009–2026Approximation Algorithms for Discounted Graph Search with Norm Objectives2607.11301v1 · Svenja M. Griesbach, Felix Hommelsheim, Max Klimm2026 · 0 citationsarXiv
Submodular Welfare Maximization with Budget Constraints in the Random-Order Model2606.22520v1 · Max Klimm, Martin Knaack2026 · 0 citationsarXiv
Approximating the Network Design Problem for Potential-Based Flows2604.26882v1 · Max Klimm, Marc E. Pfetsch, Martin Skutella et al.2026 · 0 citationsarXiv
Faster Symmetric Rendezvous on Four or More Locations2604.02058v2 · Javier Cembrano, Felix Fischer, Max Klimm2026 · 0 citationsarXiv
When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems2602.16311v1 · Max Klimm, Jannik Matuschke2026 · 0 citationsarXiv
Impartial Selection with Predictions2510.19002v1 · Javier Cembrano, Felix Fischer, Max Klimm2025 · 0 citationsarXiv
Optimal impartial correspondences.42226849 · Cembrano, Javier, Fischer, Felix, Klimm, Max2026 · 0 citationsSocial choice and welfare. 2026;66(4):1059-1081
Incremental-Decremental Maximization2508.14516v1 · Yann Disser, Max Klimm, Annette Lutz et al.2025 · 0 citationsarXiv
Carbon Pricing in Traffic Networks2508.09280v2 · Svenja M. Griesbach, Tobias Harks, Max Klimm et al.2025 · 1 citationarXiv
Generalized Assignment and Knapsack Problems in the Random-Order Model2504.01486v1 · Max Klimm, Martin Knaack2025 · 4 citationsarXiv
Valid Cuts for the Design of Potential-based Flow Networks2503.22327v1 · Pascal Borner, Max Klimm, Annette Lutz et al.2025 · 0 citationsarXiv
Packing a Knapsack with Items Owned by Strategic Agents2410.06080v1 · Javier Cembrano, Max Klimm, Martin Knaack2024 · 0 citationsarXiv
Impartial Selection Under Combinatorial Constraints2409.20477v1 · Javier Cembrano, Max Klimm, Arturo Merino2024 · 0 citationsarXiv
Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem2407.04447v1 · Yann Disser, Svenja M. Griesbach, Max Klimm et al.2024 · 0 citationsarXiv
Impartial Rank Aggregation2310.13141v2 · Javier Cembrano, Felix Fischer, Max Klimm2023 · 2 citationsarXiv
Information Design for Congestion Games with Unknown Demand2310.08314v1 · Svenja M. Griesbach, Martin Hoefer, Max Klimm et al.2023 · 6 citationsarXiv
Optimizing Throughput and Makespan of Queuing Systems by Information Design2310.07656v1 · Svenja M. Griesbach, Max Klimm, Philipp Warode et al.2023 · 0 citationsarXiv
Improved Bounds for Single-Nomination Impartial Selection2305.09998v1 · Javier Cembrano, Felix Fischer, Max Klimm2023 · 0 citationsarXiv
Incremental Maximization via Continuization2305.01310v1 · Yann Disser, Max Klimm, Kevin Schewior et al.2023 · 1 citationarXiv
Complexity of equilibria in binary public goods games on undirected graphs2301.11849v3 · Max Klimm, Maximilian J. Stahlberg2023 · 2 citationsarXiv
Spatiotemporal reconstruction of ancient road networks through sequential cost-benefit analysis.36845350 · Stahlberg, Maximilian J, Sagnol, Guillaume, Ducke, Benjamin et al.2023 · 4 citationsPNAS nexus. 2023;2(2):pgac313
Optimal Impartial Correspondences2301.04544v1 · Javier Cembrano, Felix Fischer, Max Klimm2023 · 3 citationsarXiv
Improved Approximation Algorithms for the Expanding Search Problem2301.03638v3 · Svenja M. Griesbach, Felix Hommelsheim, Max Klimm et al.2023 · 0 citationsarXiv
The Polyhedral Geometry of Truthful Auctions2211.01907v1 · Michael Joswig, Max Klimm, Sylvain Spitz2022 · 1 citationarXiv
Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint2209.09668v3 · Max Klimm, Martin Knaack2022 · 0 citationsarXiv
Public Signals in Network Congestion Games2205.09823v2 · Svenja M. Griesbach, Martin Hoefer, Max Klimm et al.2022 · 12 citationsarXiv
Impartial Selection with Additive Guarantees via Iterated Deletion2205.08979v2 · Javier Cembrano, Felix Fischer, David Hannon et al.2022 · 5 citationsarXiv
Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs2203.13146v1 · Per Joachims, Max Klimm, Philipp Warode2022 · 0 citationsarXiv
Multi-Leader Congestion Games with an Adversary2112.07435v1 · Tobias Harks, Mona Henle, Max Klimm et al.2021 · 5 citationsarXiv
Generalized permutahedra and optimal auctions2108.00979v1 · Michael Joswig, Max Klimm, Sylvain Spitz2021 · 5 citationsarXiv
Fractionally Subadditive Maximization under an Incremental Knapsack Constraint2106.14454v2 · Yann Disser, Max Klimm, Annette Lutz et al.2021 · 0 citationsarXiv
Pure Nash Equilibria in Resource Graph Games2007.09017v1 · Tobias Harks, Max Klimm, Jannik Matuschke2020 · 1 citationarXiv
Packing under Convex Quadratic Constraints1912.00468v2 · Max Klimm, Marc E. Pfetsch, Rico Raber et al.2019 · 4 citationsarXiv
Travelling on Graphs with Small Highway Dimension1902.07040v3 · Yann Disser, Andreas Emil Feldmann, Max Klimm et al.2019 · 3 citationsarXiv
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians1811.08354v3 · Max Klimm, Philipp Warode2018 · 2 citationsarXiv
Computing all Wardrop Equilibria parametrized by the Flow Demand1805.12383v2 · Max Klimm, Philipp Warode2018 · 7 citationsarXiv
Tight bounds for undirected graph exploration with pebbles and multiple agents1805.03476v1 · Yann Disser, Jan Hackfeld, Max Klimm2018 · 20 citationsarXiv
The Online Best Reply Algorithm for Resource Allocation Problems1805.02526v2 · Max Klimm, Daniel Schmand, Andreas Tonnis2018 · 9 citationsarXiv
Demand-Independent Optimal Tolls1708.02737v2 · Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini2017 · 4 citationsarXiv
Distance-preserving graph contractions1705.04544v4 · Aaron Bernstein, Karl Daubel, Yann Disser et al.2017 · 6 citationsarXiv
Sensitivity Analysis for Convex Separable Optimization over Integral Polymatroids1611.05372v2 · Tobias Harks, Max Klimm, Britta Peis2016 · 14 citationsarXiv
Revenue Gaps for Static and Dynamic Posted Pricing of Homogeneous Goods1607.07105v3 · Paul Dutting, Felix Fischer, Max Klimm2016 · 8 citationsarXiv
Hiring Secretaries over Time: The Benefit of Concurrent Employment1604.08125v2 · Yann Disser, John Fearnley, Martin Gairing et al.2016 · 2 citationsarXiv
Sharing Non-Anonymous Costs of Multiple Resources Optimally1412.4456v2 · Max Klimm, Daniel Schmand2014 · 16 citationsarXiv
Resource Competition on Integral Polymatroids1407.7650v1 · Tobias Harks, Max Klimm, Britta Peis2014 · 13 citationsarXiv
Optimal Impartial Selection1310.8631v1 · Felix Fischer, Max Klimm2013 · 0 citationsarXiv
Complexity and Approximation of the Continuous Network Design Problem1307.4258v2 · Martin Gairing, Tobias Harks, Max Klimm2013 · 20 citationsarXiv
Packing a Knapsack of Unknown Capacity1307.2806v1 · Yann Disser, Max Klimm, Nicole Megow et al.2013 · 14 citationsarXiv
Improving the H_k-Bound on the Price of Stability in Undirected Shapley Network Design Games1211.2090v2 · Yann Disser, Andreas Emil Feldmann, Max Klimm et al.2012 · 14 citationsarXiv
Congestion Games with Variable Demands1012.1938v2 · Tobias Harks, Max Klimm2010 · 8 citationsarXiv
Career total: 143 works. 51 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.