Martin Gairing
Martin Gairing
Senior Lecturer, Computer Science, University of Liverpool
Verified email at liverpool.ac.uk
Title
Cited by
Cited by
Year
Computing Nash equilibria for scheduling on restricted parallel links
M Gairing, T Lücking, M Mavronicolas, B Monien
Theory of Computing Systems 47 (2), 405-432, 2010
1582010
Nashification and the coordination ratio for a selfish routing game
R Feldmann, M Gairing, T Lücking, B Monien, M Rode
International Colloquium on Automata, Languages, and Programming, 514-526, 2003
1342003
Exact price of anarchy for polynomial congestion games
S Aland, D Dumrauf, M Gairing, B Monien, F Schoppmann
Annual Symposium on Theoretical Aspects of Computer Science, 218-229, 2006
1102006
Selfish routing with incomplete information
M Gairing, B Monien, K Tiemann
Theory of Computing Systems 42 (1), 91-130, 2008
942008
Exact price of anarchy for polynomial congestion games
S Aland, D Dumrauf, M Gairing, B Monien, F Schoppmann
SIAM Journal on Computing 40 (5), 1211-1233, 2011
892011
Routing (un-) splittable flow in games with player-specific linear latency functions
M Gairing, B Monien, K Tiemann
International Colloquium on Automata, Languages, and Programming, 501-512, 2006
772006
Extreme nash equilibria
M Gairing, T Lücking, M Mavronicolas, B Monien, P Spirakis
Italian Conference on Theoretical Computer Science, 1-20, 2003
72*2003
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
M Gairing, B Monien, A Woclaw
Theoretical Computer Science 380 (1-2), 87-99, 2007
712007
Nash equilibria in discrete routing games with convex latency functions
M Gairing, T Lücking, M Mavronicolas, B Monien, M Rode
International Colloquium on Automata, Languages, and Programming, 645-657, 2004
682004
Distance-two information in self-stabilizing algorithms
M Gairing, W Goddard, ST Hedetniemi, P Kristiansen, AA McRae
Parallel Processing Letters 14 (03n04), 387-398, 2004
672004
Selfish routing in non-cooperative networks: A survey
R Feldmann, M Gairing, T Lücking, B Monien, M Rode
International Symposium on Mathematical Foundations of Computer Science, 21-45, 2003
672003
Computing stable outcomes in hedonic games
M Gairing, R Savani
International Symposium on Algorithmic Game Theory, 174-185, 2010
662010
Covering games: Approximation through non-cooperation
M Gairing
International Workshop on Internet and Network Economics, 184-195, 2009
552009
Weighted congestion games: the price of anarchy, universal worst-case examples, and tightness
K Bhawalkar, M Gairing, T Roughgarden
ACM Transactions on Economics and Computation (TEAC) 2 (4), 1-23, 2014
532014
Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness
K Bhawalkar, M Gairing, T Roughgarden
European Symposium on Algorithms, 17-28, 2010
512010
Quasirandom load balancing
T Friedrich, M Gairing, T Sauerwald
SIAM Journal on Computing 41 (4), 747-771, 2012
482012
Learning equilibria of games via payoff queries
J Fearnley, M Gairing, PW Goldberg, R Savani
The Journal of Machine Learning Research 16 (1), 1305-1344, 2015
472015
Total latency in singleton congestion games
M Gairing, F Schoppmann
International Workshop on Web and Internet Economics, 381-387, 2007
372007
The price of anarchy for polynomial social cost
M Gairing, T Lücking, M Mavronicolas, B Monien
International Symposium on Mathematical Foundations of Computer Science, 574-585, 2004
362004
The price of anarchy for restricted parallel links
M Gairing, T Lücking, M Mavronicolas, B Monien
Parallel Processing Letters 16 (01), 117-131, 2006
342006
The system can't perform the operation now. Try again later.
Articles 1–20