Martin Gairing

John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani: Learning Equilibria of Games via Payoff Queries. CoRR abs/1302.3116 (2013)

Tobias Friedrich, Martin Gairing, Thomas Sauerwald: Quasirandom Load Balancing. SIAM J. Comput. 41(4): 747-771 (2012)

Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann: Exact Price of Anarchy for Polynomial Congestion Games. SIAM J. Comput. 40(5): 1211-1233 (2011)

Martin Gairing, Burkhard Monien, Karsten Tiemann: Routing (un-) splittable flow in games with player-specific affine latency functions. ACM Transactions on Algorithms 7(3): 31 (2011)

Martin Gairing, Rahul Savani: Computing stable outcomes in hedonic games with voting-based deviations. AAMAS 2011: 559-566

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47(2): 405-432 (2010)

Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden: Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. ESA (2) 2010: 17-28

Martin Gairing, Rahul Savani: Computing Stable Outcomes in Hedonic Games. SAGT 2010: 174-185

Tobias Friedrich, Martin Gairing, Thomas Sauerwald: Quasirandom Load Balancing. SODA 2010: 1620-1629

Tobias Friedrich, Martin Gairing, Thomas Sauerwald: Quasirandom Load Balancing. CoRR abs/1006.3302 (2010)

Martin Gairing: Covering Games: Approximation through Non-cooperation. WINE 2009: 184-195

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): 1199-1225 (2008)

Martin Gairing, Burkhard Monien, Karsten Tiemann: Selfish Routing with Incomplete Information. Theory Comput. Syst. 42(1): 91-130 (2008)

Martin Gairing: Malicious Bayesian Congestion Games. WAOA 2008: 119-132

Martin Gairing: Malicious Bayesian Congestion Games. CoRR abs/0805.2421 (2008)

Martin Gairing, Burkhard Monien, Andreas Woclaw: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2): 87-99 (2007)

Martin Gairing, Florian Schoppmann: Total Latency in Singleton Congestion Games. WINE 2007: 381-387

Martin Gairing: Selfish routing in networks. University of Paderborn 2006, pp. 1-142

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Restricted Parallel Links. Parallel Processing Letters 16(1): 117-132 (2006)

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006)

Martin Gairing, Burkhard Monien, Karsten Tiemann: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) 2006: 501-512

Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann: Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229

Dominic Dumrauf, Martin Gairing: Price of Anarchy for Polynomial Wardrop Games. WINE 2006: 319-330

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): 133-157 (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, Burkhard Monien, Karsten Tiemann: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65

Martin Gairing, Burkhard Monien, Andreas Woclaw: A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP 2005: 828-839

Martin Gairing, Burkhard Monien, Karsten Tiemann: Selfish routing with incomplete information. SPAA 2005: 203-212

Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209

Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen: A Self-stabilizing Algorithm for Maximal 2-packing. Nord. J. Comput. 11(1): 1-11 (2004)

Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs: Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Processing Letters 14(1): 75-82 (2004)

Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters 14(3-4): 387-398 (2004)

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode: Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien: Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-Cooperative Networks: A Survey. Bulletin of the EATCS 81: 137-164 (2003)

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis: Extreme Nash Equilibria. ICTCS 2003: 1-20

Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45

Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60