Martin Gairing

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 31

Top Venues

CoRR

Math. Oper. Res.

ICALP

ACM Trans. Economics and Comput.

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

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

Martin Gairing.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Gairing