Martin Gairing

According to our database1, Martin Gairing authored at least 45 papers between 2003 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

2018
Reachability Switching Games.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

The Price of Stability of Weighted Congestion Games.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

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
Strategic Contention Resolution with Limited Feedback.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

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

Complexity and Approximation of the Continuous Network Design Problem.
Proceedings of the Approximation, 2014

2013
Learning equilibria of games via payoff queries.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

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

Price of Stability in Polynomial Congestion Games.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
Routing (un-) splittable flow in games with player-specific affine latency functions.
ACM Trans. Algorithms, 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
Quasirandom Load Balancing.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

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

Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness.
Proceedings of the Algorithms, 2010

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

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

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 Restricted Parallel Links.
Parallel Processing Letters, 2006

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

Exact Price of Anarchy for Polynomial Congestion Games.
Proceedings of the STACS 2006, 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

Selfish routing with incomplete information.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 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

The Price of Anarchy for Polynomial Social Cost.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005

2004
Distance-two information in self-stabilizing algorithms.
Parallel Processing Letters, 2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Processing Letters, 2004

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

Computing Nash equilibria for scheduling on restricted parallel links.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

The Price of Anarchy for Polynomial Social Cost.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Nash Equilibria in Discrete Routing Games with Convex Latency Functions.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

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

Selfish Routing in Non-cooperative Networks: A Survey.
Proceedings of the Mathematical Foundations of Computer Science 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...