Follow
Martin Gairing
Martin Gairing
Department of 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
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
1472004
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
1402003
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
1282014
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
1222011
Exact price of anarchy for polynomial congestion games
S Aland, D Dumrauf, M Gairing, B Monien, F Schoppmann
STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006
1142006
Selfish routing with incomplete information
M Gairing, B Monien, K Tiemann
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
1112005
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
922007
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
842004
Routing (un-) splittable flow in games with player-specific linear latency functions
M Gairing, B Monien, K Tiemann
Automata, Languages and Programming: 33rd International Colloquium, ICALP …, 2006
832006
Computing stable outcomes in hedonic games
M Gairing, R Savani
International Symposium on Algorithmic Game Theory, 174-185, 2010
802010
Learning equilibria of games via payoff queries
J Fearnley, M Gairing, P Goldberg, R Savani
Proceedings of the fourteenth ACM conference on Electronic commerce, 397-414, 2013
792013
Covering games: Approximation through non-cooperation
M Gairing
International Workshop on Internet and Network Economics, 184-195, 2009
772009
Extreme nash equilibria
M Gairing, T Lücking, M Mavronicolas, B Monien, P Spirakis
Italian Conference on Theoretical Computer Science, 1-20, 2003
77*2003
Selfish routing in non-cooperative networks: A survey
R Feldmann, M Gairing, T Lücking, B Monien, M Rode
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
772003
Nash equilibria in discrete routing games with convex latency functions
M Gairing, T Lücking, M Mavronicolas, B Monien, M Rode
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
722004
Quasirandom load balancing
T Friedrich, M Gairing, T Sauerwald
SIAM Journal on Computing 41 (4), 747-771, 2012
582012
Total latency in singleton congestion games
M Gairing, F Schoppmann
International Workshop on Web and Internet Economics, 381-387, 2007
482007
Price of stability in polynomial congestion games
G Christodoulou, M Gairing
ACM Transactions on Economics and Computation (TEAC) 4 (2), 1-17, 2015
422015
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
362006
Nash equilibria in discrete routing games with convex latency functions
M Gairing, T Lücking, M Mavronicolas, B Monien, M Rode
Journal of Computer and System Sciences 74 (7), 1199-1225, 2008
332008
The system can't perform the operation now. Try again later.
Articles 1–20