Search Results - "Klimm, Max"

Reduction of Potential-Based Flow Networks.

Authors: Klimm, Max Pfetsch, Marc E. Raber, Rico et al.

Source: Mathematics of Operations Research (INFORMS). Nov2023, Vol. 48 Issue 4, p2287-2303. 17p.

Improved Bounds for Single-Nomination Impartial Selection.

Authors: Cembrano, Javier Fischer, Felix Klimm, Max

Source: Mathematics of Operations Research (INFORMS); May2026, Vol. 51 Issue 2, p1486-1513, 28p

The polyhedral geometry of truthful auctions: The polyhedral geometry of truthful...: M. Joswig et al.

Authors: Joswig, Michael Klimm, Max Spitz, Sylvain

Source: Mathematical Programming; Mar2025, Vol. 210 Issue 1, p539-566, 28p

Equilibria in Multiclass and Multidimensional Atomic Congestion Games.

Authors: Klimm, Max Schütz, Andreas

Source: Mathematics of Operations Research (INFORMS). Nov2022, Vol. 47 Issue 4, p2743-2764. 22p.

Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs.

Authors: Klimm, Max Warode, Philipp

Source: Mathematics of Operations Research (INFORMS). Feb2022, Vol. 47 Issue 1, p812-846. 35p.

Improved Approximation Algorithms for the Expanding Search Problem.

Authors: Griesbach, Svenja M. Hommelsheim, Felix Klimm, Max et al.

Source: SIAM Journal on Discrete Mathematics; 2026, Vol. 40 Issue 1, p349-373, 25p

Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.

Authors: Klimm, Max Warode, Philipp

Source: SIAM Journal on Computing. 2025, Vol. 54 Issue 5, p1241-1293. 53p.

Subjects: Computational complexity, Equilibrium, Cost functions, Traffic flow, Laplacian operator, Laplacian matrices

Complexity of equilibria in binary public goods games on undirected graphs.

Authors: Klimm, Max Stahlberg, Maximilian J.

Source: EC: Economics & Computation; 2023, p938-955, 18p

Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium.

Authors: Grübel, Julia Huber, Olivier Hümbs, Lukas et al.

Source: Optimization Methods & Software; Feb2023, Vol. 38 Issue 1, p153-183, 31p

Multi-Leader Congestion Games with an Adversary.

Authors: HARKS, TOBIAS HENLE, MONA KLIMM, MAX et al.

Source: Journal of Artificial Intelligence Research; 2025, Vol. 83, p1-34, 34p

On the robustness of potential-based flow networks.

Authors: Klimm, Max Pfetsch, Marc E. Raber, Rico et al.

Source: Mathematical Programming; Jan2023, Vol. 197 Issue 1, p337-374, 38p

Packing under convex quadratic constraints.

Authors: Klimm, Max Pfetsch, Marc E. Raber, Rico et al.

Source: Mathematical Programming; Mar2022, Vol. 192 Issue 1/2, p361-386, 26p

Pure Nash Equilibria in Resource Graph Games.

Authors: Harks, Tobias Klimm, Max Matuschke, Jannik

Source: Journal of Artificial Intelligence Research. 2021, Vol. 72, p185-213. 29p.

Congestion Games with Variable Demands.

Authors: Harks, Tobias Klimm, Max

Source: Mathematics of Operations Research (INFORMS). Feb2016, Vol. 41 Issue 1, p255-277. 23p.

Nobel, Milgrom und Wilson.

Alternate Title: Nobel, Milgrom and Wilson.

Authors: Klimm, Max

Source: Mitteilungen der DMV. Dec2020, Vol. 28 Issue 4, p193-200. 8p.

On the Existence of Pure Nash Equilibria in Weighted Congestion Games.

Authors: Harks, Tobias Klimm, Max

Source: Mathematics of Operations Research (INFORMS). Aug2012, Vol. 37 Issue 3, p419-436. 18p. 6 Diagrams, 1 Chart, 1 Graph.

Broadcasting a file in a communication network.

Authors: Goetzmann, Kai-Simon Harks, Tobias Klimm, Max

Source: Journal of Scheduling; Apr2020, Vol. 23 Issue 2, p211-232, 22p

FRACTIONALLY SUBADDITIVE MAXIMIZATION UNDER AN INCREMENTAL KNAPSACK CONSTRAINT WITH APPLICATIONS TO INCREMENTAL FLOWS.

Authors: DISSER, YANN KLIMM, MAX LUTZ, ANNETTE et al.

Source: SIAM Journal on Discrete Mathematics. 2024, Vol. 38 Issue 1, p764-789. 26p.

Subjects: Backpacks, Algorithms

Optimal impartial correspondences.

Authors: Cembrano, Javier Fischer, Felix Klimm, Max

Source: Social Choice & Welfare. Jun2026, Vol. 66 Issue 4, p1059-1081. 23p.

Impartial Selection with Additive Guarantees via Iterated Deletion.

Authors: Cembrano, Javier Fischer, Felix Hannon, David et al.

Source: EC: Economics & Computation; 2022, p1104-1105, 2p