 | Up a level |
Spirakis, PG 
ORCID: 0000-0001-5396-3749, Christodoulou, G, Gairing, M, Nikoletseas, S and Raptopoulos, C
(2017)
A 3-player protocol preventing persistence in strategic contention with limited feedback.
In: 10th International Symposium on Algorithmic Game Theory (SAGT 2017), 2017-9-12 - 2017-9-14, L'Acquilla Iatly.
Gairing, M, Harks, T and Klimm, M
(2017)
Complexity and Approximation of the Continuous Network Design Problem.
SIAM Journal on Optimization, 27 (03).
pp. 1554-1582.
Feldotto, M, Gairing, M, Kotsialou, G and Skopalik, A
(2017)
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.
In: Conference on Web and Internet Economics, 2017-12-17 - 2017-12-20, Bangalore, India.
Gairing, M, Kollias, K and Kotsialou, G
(2017)
Cost-sharing in generalised selfish routing.
.
Disser, Yann, Fearnley, John, Gairing, M, Goebel, Oliver, Klimm, Max, Schmand, Daniel, Skopalik, Alexander and Toennis, Andreas
(2020)
Hiring Secretaries over Time: The Benefit of Concurrent Employment.
Mathematics of Operations Research, 45 (1).
pp. 323-352.
Christodoulou, George, Gairing, M, Giannakopoulos, Yiannis and Spirakis, PG ORCID: 0000-0001-5396-3749
(2019)
The Price of Stability of Weighted Congestion Games.
SIAM Journal on Computing, 48 (5).
pp. 1544-1582.
Fearnley, J, Gairing, M, Mnich, M and Savani, AR
(2021)
Reachability switching games.
Logical Methods in Computer Science, 17 (2).
10:1-10:29-.
Christodoulou, G, Gairing, M, Nikoletseas, S, Raptopoulos, C and Spirakis, PG ORCID: 0000-0001-5396-3749
(2016)
Strategic Contention Resolution with Limited Feedback.
In: 24th Annual European Symposium on Algorithms (ESA 2016), 2016-8-22 - 2016-8-24, Aarhus , Denmark.