Martin Gairing
机构: Department of Computer Science, University of Liverpool
每年引用次数
引用次数
引用: 2,262
H-指数: 27
I10-指数 : 41
出版物: 76
SELFISH ROUTING IN NON-COOPERATIVE NETWORKS: A SURVEY
RAINER FELDMANN , MARTIN GAIRING , THOMAS LÜCKING , BURKHARD MONIEN
Current Trends in Theoretical Computer Science 373 -401
2004
SELF-STABILIZING MAXIMAL k-DEPENDENT SETS IN LINEAR TIME
MARTIN GAIRING , WAYNE GODDARD , STEPHEN T. HEDETNIEMI , DAVID P. JACOBS
Parallel Processing Letters 14 ( 01) 75 -82
3
2004
THE PRICE OF ANARCHY FOR RESTRICTED PARALLEL LINKS
MARTIN GAIRING , THOMAS LÜCKING , MARIOS MAVRONICOLAS , BURKHARD MONIEN
Parallel Processing Letters 16 ( 01) 117 -131
36
2006
Distance-two information in self-stabilizing algorithms
MARTIN GAIRING , WAYNE GODDARD , STEPHEN T. HEDETNIEMI , PETTER KRISTIANSEN
Parallel Processing Letters 14 387 -398
51
2004
A self-stabilizing algorithm for maximal 2-packing
Martin Gairing , Stephen T. Hedetniemi , Petter Kristiansen , Robert M. Geist
Nordic Journal of Computing 11 ( 1) 1 -11
14
2004
Computing stable outcomes in hedonic games
Martin Gairing , Rahul Savani
algorithmic game theory 174 -185
42
2010
Computing stable outcomes in hedonic games with voting-based deviations
Martin Gairing , Rahul Savani
adaptive agents and multi-agents systems 559 -566
20
2011
Price of anarchy for polynomial wardrop games
Martin Gairing , Dominic Dumrauf
Lecture Notes in Computer Science 319 -330
2006
Quasirandom Load Balancing
Martin Gairing , Thomas Sauerwald , Tobias Friedrich
SIAM Journal on Computing 41 ( 4) 747 -771
29
2012
Malicious Bayesian Congestion Games
Martin Gairing
arXiv: Computer Science and Game Theory
2
2008
Learning Equilibria of Games via Payoff Queries
Martin Gairing , Rahul Savani , Paul Goldberg , John Fearnley
arXiv: Computer Science and Game Theory
6
2013
In Congestion Games, Taxes Achieve Optimal Approximation.
Martin Gairing , Dario Paccagnan
arXiv: Computer Science and Game Theory
2021
Reachability Switching Games.
Martin Gairing , Rahul Savani , Matthias Mnich , John Fearnley
Logical Methods in Computer Science 17
2021
Nash Equilibria in Discrete Routing Games with Convex Latency Functions
Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien
Automata, Languages and Programming 645 -657
47
2004
The Price of Anarchy for Polynomial Social Cost
Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien
Lecture Notes in Computer Science 574 -585
22
2004
Tight Bounds for Cost-Sharing in Weighted Congestion Games
Martin Gairing , Konstantinos Kollias , Grammateia Kotsialou
Automata, Languages, and Programming 626 -637
10
2015
Selfish routing with incomplete information
Martin Gairing , Burkhard Monien , Karsten Tiemann
acm symposium on parallel algorithms and architectures 203 -212
30
2005
The Price of Stability of Weighted Congestion Games.
George Christodoulou , Martin Gairing , Yiannis Giannakopoulos , Paul G. Spirakis
SIAM Journal on Computing 48 ( 5) 1544 -1582
11
2019
Greedy metric minimum online matchings with random arrivals
Martin Gairing , Max Klimm
Operations Research Letters 47 ( 2) 88 -91
3
2019
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
Martin Gairing , Burkhard Monien , Karsten Tiemann
Automata, Languages and Programming 501 -512
54
2006
Burkhard Monien Marios Mavronicolas Rahul Savani Stephen T. Hedetniemi Paul Spirakis Giorgos Christodoulou Max Klimm Grammateia Kotsialou John Fearnley Alexander Skopalik Wayne Goddard Tim Roughgarden Kshipra Bhawalkar Kostas Kollias Paul Goldberg Tobias Friedrich Thomas Sauerwald Dr. Matthias Feldotto Tobias Harks Robert Elsässer