Martin Gairing

Orcid: 0000-0002-0569-7113

Affiliations:
  • University of Liverpool


According to our database1, Martin Gairing authored at least 51 papers between 2003 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games.
Math. Oper. Res., February, 2023

Fair Interventions in Weighted Congestion Games.
CoRR, 2023

2022
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192).
Dagstuhl Reports, 2022

2021
Reachability Switching Games.
Log. Methods Comput. Sci., 2021

In Congestion Games, Taxes Achieve Optimal Approximation.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020
Existence and Efficiency of Equilibria for Cost-Sharing in Generalized Weighted Congestion Games.
ACM Trans. Economics and Comput., 2020

Hiring Secretaries over Time: The Benefit of Concurrent Employment.
Math. Oper. Res., 2020

Sensor Data for Human Activity Recognition: Feature Representation and Benchmarking.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

2019
The Price of Stability of Weighted Congestion Games.
SIAM J. Comput., 2019

Greedy metric minimum online matchings with random arrivals.
Oper. Res. Lett., 2019

Preface to the Special Issue on Algorithmic Game Theory.
Theory Comput. Syst., 2019

Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games.
Math. Oper. Res., 2019

2017
Complexity and Approximation of the Continuous Network Design Problem.
SIAM J. Optim., 2017

Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

Cost-Sharing in Generalised Selfish Routing.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Price of Stability in Polynomial Congestion Games.
ACM Trans. Economics and Comput., 2016

Strategic Contention Resolution with Limited Feedback.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Learning equilibria of games via payoff queries.
J. Mach. Learn. Res., 2015

Tight Bounds for Cost-Sharing in Weighted Congestion Games.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness.
ACM Trans. Economics and Comput., 2014

Approximate Pure Nash Equilibria in Social Context Congestion Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013
Congestion Games with Player-Specific Costs Revisited.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

2012
Quasirandom Load Balancing.
SIAM J. Comput., 2012

2011
Routing (un-) splittable flow in games with player-specific affine latency functions.
ACM Trans. Algorithms, 2011

Exact Price of Anarchy for Polynomial Congestion Games.
SIAM J. Comput., 2011

Computing stable outcomes in hedonic games with voting-based deviations.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
Computing Nash Equilibria for Scheduling on Restricted Parallel Links.
Theory Comput. Syst., 2010

Computing Stable Outcomes in Hedonic Games.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

2009
Covering Games: Approximation through Non-cooperation.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008
Selfish Routing with Incomplete Information.
Theory Comput. Syst., 2008

Nash equilibria in discrete routing games with convex latency functions.
J. Comput. Syst. Sci., 2008

Malicious Bayesian Congestion Games.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines.
Theor. Comput. Sci., 2007

Total Latency in Singleton Congestion Games.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
Selfish routing in networks.
PhD thesis, 2006

The price of anarchy for polynomial social cost.
Theor. Comput. Sci., 2006

The Price of Anarchy for Restricted Parallel Links.
Parallel Process. Lett., 2006

Price of Anarchy for Polynomial Wardrop Games.
Proceedings of the Internet and Network Economics, Second International Workshop, 2006

Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci., 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Distance-two information in self-stabilizing algorithms.
Parallel Process. Lett., 2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Process. Lett., 2004

A Self-stabilizing Algorithm for Maximal 2-packing.
Nord. J. Comput., 2004

2003
Selfish Routing in Non-Cooperative Networks: A Survey.
Bull. EATCS, 2003

Self-Stabilizing Algorithms for {k}-Domination.
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

Extreme Nash Equilibria.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Nashification and the Coordination Ratio for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003


  Loading...