Martin Gairing

Cited by

	All	Since 2018
Citations	2081	596
h-index	26	14
i10-index	39	21

160

120

2003200420052006200720082009201020112012201320142015201620172018201920202021202220237 71 86 125 86 113 108 104 96 114 86 107 128 101 120 92 123 100 100 150 30

Public access

View all

16 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
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasVerified email at liverpool.ac.uk
Stephen T. HedetniemiProfessor Emeritus, School of Computing, Clemson UniversityVerified email at clemson.edu
Giorgos ChristodoulouAristotle University of ThessalonikiVerified email at csd.auth.gr
John FearnleyUniversity of LiverpoolVerified email at liverpool.ac.uk
Max KlimmTU BerlinVerified email at tu-berlin.de
Grammateia KotsialouLondon School of Economics and Political ScienceVerified email at lse.ac.uk
Tim RoughgardenColumbia UniversityVerified email at cs.columbia.edu
Kshipra BhawalkarStaff Research Scientist, Google ResearchVerified email at google.com
Wayne GoddardClemson UniversityVerified email at clemson.edu
Alexander SkopalikUniversity of TwenteVerified email at utwente.nl
Kostas KolliasGoogle ResearchVerified email at google.com
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 Optimization, University of AugsburgVerified email at math.uni-augsburg.de
Robert GeistClemson UniversityVerified email at g.clemson.edu

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	140	2004
Nashification and the coordination ratio for a selfish routing game R Feldmann, M Gairing, T Lücking, B Monien, M Rode ICALP 30, 514-526, 2003	136	2003
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	111	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	110	2006
Selfish routing with incomplete information M Gairing, B Monien, K Tiemann Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005	106	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	90	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	81	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	81	2004
Computing stable outcomes in hedonic games M Gairing, R Savani Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens …, 2010	75	2010
Extreme nash equilibria M Gairing, T Lücking, M Mavronicolas, B Monien, PG Spirakis ICTCS, 1-20, 2003	75*	2003
Selfish routing in non-cooperative networks: A survey R Feldmann, M Gairing, T Lücking, B Monien, M Rode MFCS 3, 21-45, 2003	74	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	71	2004
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	70	2014
Covering games: Approximation through non-cooperation M Gairing Internet and Network Economics: 5th International Workshop, WINE 2009, Rome …, 2009	69	2009
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	66	2013
Quasirandom load balancing T Friedrich, M Gairing, T Sauerwald SIAM Journal on Computing 41 (4), 747-771, 2012	58	2012
Weighted congestion games: Price of anarchy, universal worst-case examples, and tightness K Bhawalkar, M Gairing, T Roughgarden Algorithms–ESA 2010: 18th Annual European Symposium, Liverpool, UK …, 2010	51	2010
Total latency in singleton congestion games M Gairing, F Schoppmann Internet and Network Economics: Third International Workshop, WINE 2007, San …, 2007	43	2007
Price of stability in polynomial congestion games G Christodoulou, M Gairing ACM Transactions on Economics and Computation (TEAC) 4 (2), 1-17, 2015	38	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	36	2006

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