Martin Gairing

According to our database, Martin Gairing authored at least 51 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

In Congestion Games, Taxes Achieve Optimal Approximation.

Dario Paccagnan, Martin Gairing

Oper. Res., 2024

2023

Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.

George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann

Math. Oper. Res., February, 2023

Fair Interventions in Weighted Congestion Games.

Miriam Fischer, Martin Gairing, Dario Paccagnan

CoRR, 2023

2022

Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192).

Martin Gairing, Carolina Osorio, Britta Peis, David P. Watling, Katharina Eickhoff

Dagstuhl Reports, 2022

2021

Reachability Switching Games.

John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani

Log. Methods Comput. Sci., 2021

2020

Existence and Efficiency of Equilibria for Cost-Sharing in Generalized Weighted Congestion Games.

Martin Gairing, Kostas Kollias, Grammateia Kotsialou

ACM Trans. Economics and Comput., 2020

Hiring Secretaries over Time: The Benefit of Concurrent Employment.

Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis

Math. Oper. Res., 2020

Sensor Data for Human Activity Recognition: Feature Representation and Benchmarking.

Flávia Alves, Martin Gairing, Frans A. Oliehoek, Thanh-Toan Do

Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2019

The Price of Stability of Weighted Congestion Games.

George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis

SIAM J. Comput., 2019

Greedy metric minimum online matchings with random arrivals.

Martin Gairing, Max Klimm

Oper. Res. Lett., 2019

Preface to the Special Issue on Algorithmic Game Theory.

Martin Gairing, Rahul Savani

Theory Comput. Syst., 2019

Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games.

Martin Gairing, Rahul Savani

Math. Oper. Res., 2019

2017

Complexity and Approximation of the Continuous Network Design Problem.

Martin Gairing, Tobias Harks, Max Klimm

SIAM J. Optim., 2017

Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.

Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.

George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Cost-Sharing in Generalised Selfish Routing.

Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Price of Stability in Polynomial Congestion Games.

George Christodoulou, Martin Gairing

ACM Trans. Economics and Comput., 2016

Strategic Contention Resolution with Limited Feedback.

George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Learning equilibria of games via payoff queries.

John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani

J. Mach. Learn. Res., 2015

Tight Bounds for Cost-Sharing in Weighted Congestion Games.

Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou

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

2014

Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness.

Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden

ACM Trans. Economics and Comput., 2014

Approximate Pure Nash Equilibria in Social Context Congestion Games.

Martin Gairing, Grammateia Kotsialou, Alexander Skopalik

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

Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.

Matthias Feldotto, Martin Gairing, Alexander Skopalik

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

2013

Congestion Games with Player-Specific Costs Revisited.

Martin Gairing, Max Klimm

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

2012

Quasirandom Load Balancing.

Tobias Friedrich, Martin Gairing, Thomas Sauerwald

SIAM J. Comput., 2012

2011

Routing (un-) splittable flow in games with player-specific affine latency functions.

Martin Gairing, Burkhard Monien, Karsten Tiemann

ACM Trans. Algorithms, 2011

Exact Price of Anarchy for Polynomial Congestion Games.

Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann

SIAM J. Comput., 2011

Computing stable outcomes in hedonic games with voting-based deviations.

Martin Gairing, Rahul Savani

Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010

Computing Nash Equilibria for Scheduling on Restricted Parallel Links.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Theory Comput. Syst., 2010

Computing Stable Outcomes in Hedonic Games.

Martin Gairing, Rahul Savani

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009

Covering Games: Approximation through Non-cooperation.

Martin Gairing

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008

Selfish Routing with Incomplete Information.

Martin Gairing, Burkhard Monien, Karsten Tiemann

Theory Comput. Syst., 2008

Nash equilibria in discrete routing games with convex latency functions.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode

J. Comput. Syst. Sci., 2008

Malicious Bayesian Congestion Games.

Martin Gairing

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007

A faster combinatorial approximation algorithm for scheduling unrelated parallel machines.

Martin Gairing, Burkhard Monien, Andreas Woclaw

Theor. Comput. Sci., 2007

Total Latency in Singleton Congestion Games.

Martin Gairing, Florian Schoppmann

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006

Selfish routing in networks.

Martin Gairing

PhD thesis, 2006

The price of anarchy for polynomial social cost.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Theor. Comput. Sci., 2006

The Price of Anarchy for Restricted Parallel Links.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Parallel Process. Lett., 2006

Price of Anarchy for Polynomial Wardrop Games.

Dominic Dumrauf, Martin Gairing

Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.

Martin Gairing, Burkhard Monien, Karsten Tiemann

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Structure and complexity of extreme Nash equilibria.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis

Theor. Comput. Sci., 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.

Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.

Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Distance-two information in self-stabilizing algorithms.

Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae

Parallel Process. Lett., 2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.

Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs

Parallel Process. Lett., 2004

A Self-stabilizing Algorithm for Maximal 2-packing.

Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen

Nord. J. Comput., 2004

2003

Selfish Routing in Non-Cooperative Networks: A Survey.

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Bull. EATCS, 2003

Self-Stabilizing Algorithms for {k}-Domination.

Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae

Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

Extreme Nash Equilibria.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Nashification and the Coordination Ratio for a Selfish Routing Game.

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003