Martin Gairing

Cited by

	All	Since 2019
Citations	2280	663
h-index	27	16
i10-index	41	24

140

105

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202410 71 92 131 93 113 108 97 100 123 91 109 131 102 121 86 122 97 93 130 133 88

Public access

View all

19 articles

1 article

available

not available

Based on funding mandates

Co-authors

Burkhard MonienProfessor für InformatikVerified email at upb.de
Marios MavronicolasProfessor of Computer Science, University of CyprusVerified email at cs.ucy.ac.cy
Rahul SavaniProfessor of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Stephen T. HedetniemiProfessor Emeritus, School of Computing, Clemson UniversityVerified email at clemson.edu
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasVerified email at liverpool.ac.uk
Giorgos ChristodoulouAristotle University of ThessalonikiVerified email at csd.auth.gr
Max KlimmTU BerlinVerified email at tu-berlin.de
Grammateia KotsialouLondon School of Economics and Political ScienceVerified email at lse.ac.uk
John FearnleyUniversity of LiverpoolVerified email at liverpool.ac.uk
Alexander SkopalikUniversity of TwenteVerified email at utwente.nl
Wayne GoddardClemson UniversityVerified email at clemson.edu
Tim RoughgardenColumbia UniversityVerified email at cs.columbia.edu
Kshipra BhawalkarGoogle ResearchVerified email at google.com
Kostas KolliasGoogle ResearchVerified email at google.com
Paul GoldbergProfessor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
Thomas SauerwaldUniversity Lecturer in Computer Science, University of CambridgeVerified email at cl.cam.ac.uk
Dr. Matthias FeldottoPaderborn UniversityVerified email at uni-paderborn.de
Robert ElsässerUniversity of SalzburgVerified email at cosy.sbg.ac.at
Tobias HarksProfessor of Mathematical Optimization, University of PassauVerified email at uni-passau.de

Martin Gairing

Department of Computer Science, University of Liverpool

Verified email at liverpool.ac.uk

Algorithmic Game Theory Algorithms Optimization


Title Sort by citations Sort by year Sort by 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	150	2004
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	140	2003
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	131	2014
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	126	2011
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	117	2006
Selfish routing with incomplete information M Gairing, B Monien, K Tiemann Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005	117	2005
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	93	2007
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	86	2006
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	84	2004
Computing stable outcomes in hedonic games M Gairing, R Savani International Symposium on Algorithmic Game Theory, 174-185, 2010	81	2010
Covering games: Approximation through non-cooperation M Gairing International Workshop on Internet and Network Economics, 184-195, 2009	79	2009
Extreme nash equilibria M Gairing, T Lücking, M Mavronicolas, B Monien, P Spirakis Italian Conference on Theoretical Computer Science, 1-20, 2003	79*	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	79	2003
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	74	2004
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	73	2013
Quasirandom load balancing T Friedrich, M Gairing, T Sauerwald SIAM Journal on Computing 41 (4), 747-771, 2012	60	2012
Total latency in singleton congestion games M Gairing, F Schoppmann International Workshop on Web and Internet Economics, 381-387, 2007	50	2007
Price of stability in polynomial congestion games G Christodoulou, M Gairing ACM Transactions on Economics and Computation (TEAC) 4 (2), 1-17, 2015	45	2015
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	37	2006
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	36	2008

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors