Martin Gairing

85 papers A* 11A 3B 9C 1Journal 44Unranked 16
YearRankTypeTitle / Venue / Authors
2026 J jnl
Cities at Play: Improving Equilibria in Urban Neighbourhood Games.
CoRR
Martin Gairing, Adrian Vetta, Zhanzhan Zhao
2024 — conf
Fair Interventions in Weighted Congestion Games.
WINE
Miriam Fischer, Martin Gairing, Dario Paccagnan
2024 J jnl
In Congestion Games, Taxes Achieve Optimal Approximation.
Oper. Res.
Dario Paccagnan, Martin Gairing
2023 J jnl
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.
Math. Oper. Res.
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann
2023 J jnl
Fair Interventions in Weighted Congestion Games.
CoRR
Miriam Fischer, Martin Gairing, Dario Paccagnan
2022 J jnl
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192).
Dagstuhl Reports
Martin Gairing, Carolina Osorio, Britta Peis, David P. Watling, Katharina Eickhoff
2021 A* conf
In Congestion Games, Taxes Achieve Optimal Approximation.
EC
Dario Paccagnan, Martin Gairing
2021 J jnl
In Congestion Games, Taxes Achieve Optimal Approximation.
CoRR
Dario Paccagnan, Martin Gairing
2021 J jnl
Reachability Switching Games.
Log. Methods Comput. Sci.
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2020 A* conf
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.
ICALP
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann
2020 J jnl
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.
CoRR
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann
2020 J jnl
Existence and Efficiency of Equilibria for Cost-Sharing in Generalized Weighted Congestion Games.
ACM Trans. Economics and Comput.
Martin Gairing, Kostas Kollias, Grammateia Kotsialou
2020 J jnl
Hiring Secretaries over Time: The Benefit of Concurrent Employment.
Math. Oper. Res.
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2020 B conf
Sensor Data for Human Activity Recognition: Feature Representation and Benchmarking.
IJCNN
Flávia Alves, Martin Gairing, Frans A. Oliehoek, Thanh-Toan Do
2020 J jnl
Sensor Data for Human Activity Recognition: Feature Representation and Benchmarking.
CoRR
Flávia Alves, Martin Gairing, Frans A. Oliehoek, Thanh-Toan Do
2019 J jnl
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games.
Math. Oper. Res.
Martin Gairing, Rahul Savani
2019 J jnl
Greedy metric minimum online matchings with random arrivals.
Oper. Res. Lett.
Martin Gairing, Max Klimm
2019 J jnl
Preface to the Special Issue on Algorithmic Game Theory.
Theory Comput. Syst.
Martin Gairing, Rahul Savani
2019 J jnl
The Price of Stability of Weighted Congestion Games.
SIAM J. Comput.
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis
2018 A* conf
Reachability Switching Games.
ICALP
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2018 A* conf
The Price of Stability of Weighted Congestion Games.
ICALP
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis
2018 J jnl
The Price of Stability of Weighted Congestion Games.
CoRR
George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis
2017 B conf
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.
SAGT
George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2017 J jnl
A 3-player protocol preventing persistence in strategic contention with limited feedback.
CoRR
George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis
2017 J jnl
Complexity and Approximation of the Continuous Network Design Problem.
SIAM J. Optim.
Martin Gairing, Tobias Harks, Max Klimm
2017 — conf
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.
WINE
Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik
2017 J jnl
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.
CoRR
Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik
2017 C conf
Cost-Sharing in Generalised Selfish Routing.
CIAC
Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou
2017 J jnl
Reachability Switching Games.
CoRR
John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani
2016 B ed.
Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings
SAGT
Martin Gairing, Rahul Savani
2016 J jnl
Hiring Secretaries over Time: The Benefit of Concurrent Employment.
CoRR
Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis
2016 J jnl
Price of Stability in Polynomial Congestion Games.
ACM Trans. Economics and Comput.
George Christodoulou, Martin Gairing
2016 A conf
Strategic Contention Resolution with Limited Feedback.
ESA
George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2016 J jnl
Strategic Contention Resolution with Limited Feedback.
CoRR
George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis
2015 J jnl
Computing stable outcomes in symmetric additively-separable hedonic games.
CoRR
Martin Gairing, Rahul Savani
2015 J jnl
Learning equilibria of games via payoff queries.
J. Mach. Learn. Res.
John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani
2015 — conf
Tight Bounds for Cost-Sharing in Weighted Congestion Games.
ICALP (2)
Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou
2014 — conf
Approximate Pure Nash Equilibria in Social Context Congestion Games.
WINE
Martin Gairing, Grammateia Kotsialou, Alexander Skopalik
2014 — conf
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.
WINE
Matthias Feldotto, Martin Gairing, Alexander Skopalik
2014 — conf
Complexity and Approximation of the Continuous Network Design Problem.
APPROX-RANDOM
Martin Gairing, Tobias Harks, Max Klimm
2014 J jnl
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness.
ACM Trans. Economics and Comput.
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
2013 J jnl
Complexity and Approximation of the Continuous Network Design Problem.
CoRR
Martin Gairing, Tobias Harks, Max Klimm
2013 B conf
Congestion Games with Player-Specific Costs Revisited.
SAGT
Martin Gairing, Max Klimm
2013 J jnl
Learning Equilibria of Games via Payoff Queries
CoRR
John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani
2013 A* conf
Learning equilibria of games via payoff queries.
EC
John Fearnley, Martin Gairing, Paul Goldberg, Rahul Savani
2013 — conf
Price of Stability in Polynomial Congestion Games.
ICALP (2)
George Christodoulou, Martin Gairing
2012 J jnl
Quasirandom Load Balancing.
SIAM J. Comput.
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2011 A conf
Computing stable outcomes in hedonic games with voting-based deviations.
AAMAS
Martin Gairing, Rahul Savani
2011 J jnl
Exact Price of Anarchy for Polynomial Congestion Games.
SIAM J. Comput.
Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
2011 J jnl
Routing (un-) splittable flow in games with player-specific affine latency functions.
ACM Trans. Algorithms
Martin Gairing, Burkhard Monien, Karsten Tiemann
2010 J jnl
Computing Nash Equilibria for Scheduling on Restricted Parallel Links.
Theory Comput. Syst.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2010 B conf
Computing Stable Outcomes in Hedonic Games.
SAGT
Martin Gairing, Rahul Savani
2010 J jnl
Quasirandom Load Balancing
CoRR
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2010 A* conf
Quasirandom Load Balancing.
SODA
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
2010 — conf
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness.
ESA (2)
Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden
2009 — conf
Covering Games: Approximation through Non-cooperation.
WINE
Martin Gairing
2008 J jnl
Malicious Bayesian Congestion Games
CoRR
Martin Gairing
2008 B conf
Malicious Bayesian Congestion Games.
WAOA
Martin Gairing
2008 J jnl
Nash equilibria in discrete routing games with convex latency functions.
J. Comput. Syst. Sci.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2008 J jnl
Selfish Routing with Incomplete Information.
Theory Comput. Syst.
Martin Gairing, Burkhard Monien, Karsten Tiemann
2007 J jnl
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines.
Theor. Comput. Sci.
Martin Gairing, Burkhard Monien, Andreas Woclaw
2007 — conf
Total Latency in Singleton Congestion Games.
WINE
Martin Gairing, Florian Schoppmann
2006 A conf
Exact Price of Anarchy for Polynomial Congestion Games.
STACS
Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
2006 — conf
Price of Anarchy for Polynomial Wardrop Games.
WINE
Dominic Dumrauf, Martin Gairing
2006 — conf
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.
ICALP (1)
Martin Gairing, Burkhard Monien, Karsten Tiemann
2006 — —
Selfish routing in networks.
Martin Gairing
2006 J jnl
The Price of Anarchy for Restricted Parallel Links.
Parallel Process. Lett.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2006 J jnl
The price of anarchy for polynomial social cost.
Theor. Comput. Sci.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005 A* conf
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines.
ICALP
Martin Gairing, Burkhard Monien, Andreas Woclaw
2005 — conf
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
WINE
Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2005 A* conf
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.
ICALP
Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann
2005 B conf
Selfish routing with incomplete information.
SPAA
Martin Gairing, Burkhard Monien, Karsten Tiemann
2005 J jnl
Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci.
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2005 — conf
The Price of Anarchy for Polynomial Social Cost.
Computing and Markets
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004 J jnl
A Self-stabilizing Algorithm for Maximal 2-packing.
Nord. J. Comput.
Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen
2004 A* conf
Computing Nash equilibria for scheduling on restricted parallel links.
STOC
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2004 J jnl
Distance-two information in self-stabilizing algorithms.
Parallel Process. Lett.
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
2004 A* conf
Nash Equilibria in Discrete Routing Games with Convex Latency Functions.
ICALP
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
2004 J jnl
Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Process. Lett.
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
2004 B conf
The Price of Anarchy for Polynomial Social Cost.
MFCS
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
2003 — conf
Extreme Nash Equilibria.
ICTCS
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
2003 A* conf
Nashification and the Coordination Ratio for a Selfish Routing Game.
ICALP
Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003 — conf
Self-Stabilizing Algorithms for {k}-Domination.
Self-Stabilizing Systems
Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
2003 J jnl
Selfish Routing in Non-Cooperative Networks: A Survey.
Bull. EATCS
Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode
2003 B conf
Selfish Routing in Non-cooperative Networks: A Survey.
MFCS
Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode