Max Klimm

Martin Knaack

CoRR, 2024

Impartial Selection Under Combinatorial Constraints.

[BibT_eX]

[DOI]

Arturo Merino

CoRR, 2024

Optimizing Throughput and Makespan of Queuing Systems by Information Design.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Information Design for Congestion Games with Unknown Demand.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

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

[BibT_eX]

[DOI]

Optim. Methods Softw., January, 2023

On the robustness of potential-based flow networks.

[BibT_eX]

[DOI]

Math. Program., January, 2023

Impartial Rank Aggregation.

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Maximilian J. Stahlberg

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Improved Bounds for Single-Nomination Impartial Selection.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

The Polyhedral Geometry of Truthful Auctions.

[BibT_eX]

[DOI]

Michael Joswig

Sylvain Spitz

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

Incremental Maximization via Continuization.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Improved Approximation Algorithms for the Expanding Search Problem.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Equilibria in Multiclass and Multidimensional Atomic Congestion Games.

[BibT_eX]

[DOI]

Andreas Schütz

Math. Oper. Res., November, 2022

Generalized Permutahedra and Optimal Auctions.

[BibT_eX]

[DOI]

Michael Joswig

Sylvain Spitz

SIAM J. Appl. Algebra Geom., March, 2022

Correction to: Broadcasting a file in a communication network.

[BibT_eX]

[DOI]

Kai-Simon Goetzmann

J. Sched., 2022

Packing under convex quadratic constraints.

[BibT_eX]

[DOI]

Math. Program., 2022

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

[BibT_eX]

[DOI]

Math. Oper. Res., 2022

Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs.

[BibT_eX]

[DOI]

Per Joachims

CoRR, 2022

Optimal Impartial Correspondences.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Competitive Strategies for Symmetric Rendezvous on the Line.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Public Signals in Network Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Maximizing a Submodular Function with Bounded Curvature Under an Unknown Knapsack Constraint.

[BibT_eX]

[DOI]

Martin Knaack

Proceedings of the Approximation, 2022

Multi-Leader Congestion Games with an Adversary.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

The Space Complexity of Undirected Graph Exploration.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

Pure Nash Equilibria in Resource Graph Games.

[BibT_eX]

[DOI]

Jannik Matuschke

J. Artif. Intell. Res., 2021

Travelling on Graphs with Small Highway Dimension.

[BibT_eX]

[DOI]

Jochen Könemann

Algorithmica, 2021

Fractionally Subadditive Maximization Under an Incremental Knapsack Constraint.

[BibT_eX]

[DOI]

David Weckbecker

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

2020

Broadcasting a file in a communication network.

[BibT_eX]

[DOI]

Kai-Simon Goetzmann

J. Sched., 2020

Hiring Secretaries over Time: The Benefit of Concurrent Employment.

[BibT_eX]

[DOI]

Math. Oper. Res., 2020

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

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Distance-Preserving Graph Contractions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Greedy metric minimum online matchings with random arrivals.

[BibT_eX]

[DOI]

Martin Gairing

Oper. Res. Lett., 2019

Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents.

[BibT_eX]

[DOI]

Jan Hackfeld

J. ACM, 2019

Computing all Wardrop Equilibria parametrized by the Flow Demand.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

The Online Best Reply Algorithm for Resource Allocation Problems.

[BibT_eX]

[DOI]

Andreas Tönnis

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

2018

Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids.

[BibT_eX]

[DOI]

Britta Peis

SIAM J. Optim., 2018

Bottleneck routing with elastic demands.

[BibT_eX]

[DOI]

Manuel Schneider

Oper. Res. Lett., 2018

Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.

[BibT_eX]

[DOI]

CoRR, 2018

Online Best Reply Algorithms for Resource Allocation Problems.

[BibT_eX]

[DOI]

Riccardo Colini-Baldeschi

Andreas Tönnis

CoRR, 2018

Demand-Independent Optimal Tolls.

[BibT_eX]

[DOI]

Marco Scarsini

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Impartial Selection and the Power of Up to Two Choices.

[BibT_eX]

[DOI]

Antje Bjelde

ACM Trans. Economics and Comput., 2017

Complexity and Approximation of the Continuous Network Design Problem.

[BibT_eX]

[DOI]

Martin Gairing

Riccardo Colini-Baldeschi

SIAM J. Optim., 2017

Packing a Knapsack of Unknown Capacity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Demand-Independent Tolls.

[BibT_eX]

[DOI]

Marco Scarsini

CoRR, 2017

Distance-preserving graph contractions.

[BibT_eX]

[DOI]

CoRR, 2017

Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale.

[BibT_eX]

[DOI]

Antje Bjelde

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016

Congestion Games with Variable Demands.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

Revenue Gaps for Discriminatory and Anonymous Sequential Posted Pricing.

[BibT_eX]

[DOI]

Paul Dütting

CoRR, 2016

Undirected Graph Exploration with ⊝(log log n) Pebbles.

[BibT_eX]

[DOI]

Jan Hackfeld

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Efficiency of Equilibria in Uniform Matroid Congestion Games.

[BibT_eX]

[DOI]

Jasper de Jong

Marc Uetz

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015

Improving the Hk-bound on the price of stability in undirected Shapley network design games.

[BibT_eX]

[DOI]

Matús Mihalák

Theor. Comput. Sci., 2015

Optimal Impartial Selection.

[BibT_eX]

[DOI]

SIAM J. Comput., 2015

Computing network tolls with support constraints.

[BibT_eX]

[DOI]

Networks, 2015

Scheduling Bidirectional Traffic on a Path.

[BibT_eX]

[DOI]

Elisabeth Lübbecke

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Sharing Non-anonymous Costs of Multiple Resources Optimally.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Linear, Exponential, but Nothing Else.

[BibT_eX]

[DOI]

Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014

Congestion Games with Higher Demand Dimensions.

[BibT_eX]

[DOI]

Andreas Schütz

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Resource Competition on Integral Polymatroids.

[BibT_eX]

[DOI]

Britta Peis

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Multimarket Oligopolies with Restricted Market Access.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Approximate Pure Nash Equilibria in Weighted Congestion Games.

[BibT_eX]

[DOI]

Christoph Hansknecht

Alexander Skopalik

Proceedings of the Approximation, 2014

2013

Computing pure Nash and strong equilibria in bottleneck congestion games.

[BibT_eX]

[DOI]

Math. Program., 2013

Strong equilibria in games with the lexicographical improvement property.

[BibT_eX]

[DOI]

Rolf H. Möhring

Int. J. Game Theory, 2013

Congestion Games with Player-Specific Costs Revisited.

[BibT_eX]

[DOI]

Martin Gairing

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Competition for Resources.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2013, 2013

Improving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games.

[BibT_eX]

[DOI]

Matús Mihalák

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

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

[BibT_eX]

[DOI]

Math. Oper. Res., 2012

Conflict-free vehicle routing.

[BibT_eX]

[DOI]

EURO J. Transp. Logist., 2012

Improving the $H_k$-Bound on the Price of Stability in Undirected Shapley Network Design Games

[BibT_eX]

[DOI]

Matús Mihalák

CoRR, 2012

2011

Characterizing the Existence of Potential Functions in Weighted Congestion Games.

[BibT_eX]

[DOI]

Rolf H. Möhring

Theory Comput. Syst., 2011

Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Optimal File Distribution in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2009

Strong Nash Equilibria in Games with the Lexicographical Improvement Property.

[BibT_eX]

[DOI]