default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Gairing
Person information
- affiliation: University of Liverpool
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Dario Paccagnan
, Martin Gairing:
In Congestion Games, Taxes Achieve Optimal Approximation. Oper. Res. 72(3): 966-982 (2024)- 2023
- [j26]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. Math. Oper. Res. 48(1): 583-602 (2023) - [i17]Miriam Fischer, Martin Gairing, Dario Paccagnan:
Fair Interventions in Weighted Congestion Games. CoRR abs/2311.16760 (2023) - 2022
- [i16]Martin Gairing, Carolina Osorio, Britta Peis, David P. Watling, Katharina Eickhoff:
Dynamic Traffic Models in Transportation Science (Dagstuhl Seminar 22192). Dagstuhl Reports 12(5): 92-111 (2022) - 2021
- [j25]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. Log. Methods Comput. Sci. 17(2) (2021) - [c37]Dario Paccagnan, Martin Gairing:
In Congestion Games, Taxes Achieve Optimal Approximation. EC 2021: 743-744 - [i15]Dario Paccagnan, Martin Gairing:
In Congestion Games, Taxes Achieve Optimal Approximation. CoRR abs/2105.07480 (2021) - 2020
- [j24]Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment. Math. Oper. Res. 45(1): 323-352 (2020) - [j23]Martin Gairing, Kostas Kollias, Grammateia Kotsialou:
Existence and Efficiency of Equilibria for Cost-Sharing in Generalized Weighted Congestion Games. ACM Trans. Economics and Comput. 8(2): 11:1-11:28 (2020) - [c36]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. ICALP 2020: 32:1-32:18 - [c35]Flávia Alves, Martin Gairing, Frans A. Oliehoek, Thanh-Toan Do:
Sensor Data for Human Activity Recognition: Feature Representation and Benchmarking. IJCNN 2020: 1-8 - [i14]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Diogo Poças, Clara Waldmann:
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games. CoRR abs/2002.07466 (2020) - [i13]Flávia Alves, Martin Gairing, Frans A. Oliehoek, Thanh-Toan Do:
Sensor Data for Human Activity Recognition: Feature Representation and Benchmarking. CoRR abs/2005.07308 (2020)
2010 – 2019
- 2019
- [j22]Martin Gairing, Rahul Savani:
Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games. Math. Oper. Res. 44(3): 1101-1121 (2019) - [j21]Martin Gairing, Rahul Savani:
Preface to the Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 63(1): 2-3 (2019) - [j20]Martin Gairing, Max Klimm:
Greedy metric minimum online matchings with random arrivals. Oper. Res. Lett. 47(2): 88-91 (2019) - [j19]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. SIAM J. Comput. 48(5): 1544-1582 (2019) - 2018
- [c34]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. ICALP 2018: 124:1-124:14 - [c33]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. ICALP 2018: 150:1-150:16 - [i12]George Christodoulou, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis:
The Price of Stability of Weighted Congestion Games. CoRR abs/1802.09952 (2018) - 2017
- [j18]Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. SIAM J. Optim. 27(3): 1554-1582 (2017) - [c32]Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou:
Cost-Sharing in Generalised Selfish Routing. CIAC 2017: 272-284 - [c31]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback. SAGT 2017: 240-251 - [c30]Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. WINE 2017: 191-204 - [i11]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul (Pavlos) Spirakis:
A 3-player protocol preventing persistence in strategic contention with limited feedback. CoRR abs/1707.01439 (2017) - [i10]John Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani:
Reachability Switching Games. CoRR abs/1709.08991 (2017) - [i9]Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. CoRR abs/1710.01634 (2017) - 2016
- [j17]George Christodoulou, Martin Gairing:
Price of Stability in Polynomial Congestion Games. ACM Trans. Economics and Comput. 4(2): 10:1-10:17 (2016) - [c29]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Strategic Contention Resolution with Limited Feedback. ESA 2016: 30:1-30:16 - [e1]Martin Gairing, Rahul Savani:
Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings. Lecture Notes in Computer Science 9928, Springer 2016, ISBN 978-3-662-53353-6 [contents] - [i8]Yann Disser, John Fearnley, Martin Gairing, Oliver Göbel, Max Klimm, Daniel Schmand, Alexander Skopalik, Andreas Tönnis:
Hiring Secretaries over Time: The Benefit of Concurrent Employment. CoRR abs/1604.08125 (2016) - [i7]George Christodoulou, Martin Gairing, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
Strategic Contention Resolution with Limited Feedback. CoRR abs/1606.06580 (2016) - 2015
- [j16]John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani:
Learning equilibria of games via payoff queries. J. Mach. Learn. Res. 16: 1305-1344 (2015) - [c28]Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou:
Tight Bounds for Cost-Sharing in Weighted Congestion Games. ICALP (2) 2015: 626-637 - [i6]Martin Gairing, Rahul Savani:
Computing stable outcomes in symmetric additively-separable hedonic games. CoRR abs/1509.05322 (2015) - 2014
- [j15]Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden:
Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness. ACM Trans. Economics and Comput. 2(4): 14:1-14:23 (2014) - [c27]Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. APPROX-RANDOM 2014: 226-241 - [c26]Matthias Feldotto, Martin Gairing, Alexander Skopalik:
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. WINE 2014: 30-43 - [c25]Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Approximate Pure Nash Equilibria in Social Context Congestion Games. WINE 2014: 480-485 - 2013
- [c24]George Christodoulou, Martin Gairing:
Price of Stability in Polynomial Congestion Games. ICALP (2) 2013: 496-507 - [c23]Martin Gairing, Max Klimm:
Congestion Games with Player-Specific Costs Revisited. SAGT 2013: 98-109 - [c22]John Fearnley, Martin Gairing, Paul Goldberg, Rahul Savani:
Learning equilibria of games via payoff queries. EC 2013: 397-414 - [i5]John Fearnley, Martin Gairing, Paul W. Goldberg, Rahul Savani:
Learning Equilibria of Games via Payoff Queries. CoRR abs/1302.3116 (2013) - [i4]Martin Gairing, Tobias Harks, Max Klimm:
Complexity and Approximation of the Continuous Network Design Problem. CoRR abs/1307.4258 (2013) - 2012
- [j14]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. SIAM J. Comput. 41(4): 747-771 (2012) - 2011
- [j13]Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. SIAM J. Comput. 40(5): 1211-1233 (2011) - [j12]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Routing (un-) splittable flow in games with player-specific affine latency functions. ACM Trans. Algorithms 7(3): 31:1-31:31 (2011) - [c21]Martin Gairing, Rahul Savani:
Computing stable outcomes in hedonic games with voting-based deviations. AAMAS 2011: 559-566 - 2010
- [j11]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47(2): 405-432 (2010) - [c20]Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden:
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. ESA (2) 2010: 17-28 - [c19]Martin Gairing, Rahul Savani:
Computing Stable Outcomes in Hedonic Games. SAGT 2010: 174-185 - [c18]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. SODA 2010: 1620-1629 - [i3]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. CoRR abs/1006.3302 (2010)
2000 – 2009
- 2009
- [c17]Martin Gairing:
Covering Games: Approximation through Non-cooperation. WINE 2009: 184-195 - 2008
- [j10]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74(7): 1199-1225 (2008) - [j9]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Selfish Routing with Incomplete Information. Theory Comput. Syst. 42(1): 91-130 (2008) - [c16]Martin Gairing:
Malicious Bayesian Congestion Games. WAOA 2008: 119-132 - [i2]Martin Gairing:
Malicious Bayesian Congestion Games. CoRR abs/0805.2421 (2008) - 2007
- [j8]Martin Gairing, Burkhard Monien, Andreas Woclaw:
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2): 87-99 (2007) - [c15]Martin Gairing, Florian Schoppmann:
Total Latency in Singleton Congestion Games. WINE 2007: 381-387 - 2006
- [b1]Martin Gairing:
Selfish routing in networks. University of Paderborn, Germany, 2006, pp. 1-142 - [j7]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. 16(1): 117-132 (2006) - [j6]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006) - [c14]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions. ICALP (1) 2006: 501-512 - [c13]Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229 - [c12]Dominic Dumrauf, Martin Gairing:
Price of Anarchy for Polynomial Wardrop Games. WINE 2006: 319-330 - 2005
- [j5]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343(1-2): 133-157 (2005) - [c11]Martin Gairing, Thomas Lücking, Burkhard Monien, Karsten Tiemann:
Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. ICALP 2005: 51-65 - [c10]Martin Gairing, Burkhard Monien, Andreas Woclaw:
A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines. ICALP 2005: 828-839 - [c9]Martin Gairing, Burkhard Monien, Karsten Tiemann:
Selfish routing with incomplete information. SPAA 2005: 203-212 - [c8]Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209 - [i1]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005 - 2004
- [j4]Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen:
A Self-stabilizing Algorithm for Maximal 2-packing. Nord. J. Comput. 11(1): 1-11 (2004) - [j3]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs:
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. 14(1): 75-82 (2004) - [j2]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14(3-4): 387-398 (2004) - [c7]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657 - [c6]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585 - [c5]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622 - 2003
- [j1]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-Cooperative Networks: A Survey. Bull. EATCS 81: 137-164 (2003) - [c4]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Nashification and the Coordination Ratio for a Selfish Routing Game. ICALP 2003: 514-526 - [c3]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Extreme Nash Equilibria. ICTCS 2003: 1-20 - [c2]Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode:
Selfish Routing in Non-cooperative Networks: A Survey. MFCS 2003: 21-45 - [c1]Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
