 | Up a level |
Amanatidis, Georgios 
ORCID: 0000-0002-4341-5439, Birmpas, Georgios ORCID: 0000-0003-4733-7885, Fusco, Federico ORCID: 0000-0001-6250-945X, Lazos, Philip ORCID: 0000-0001-9684-7609, Leonardi, Stefano ORCID: 0000-0002-9809-7191 and Reiffenhäuser, Rebecca ORCID: 0000-0002-0959-2589
(2023)
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
Mathematics of Operations Research.
Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis
(2022)
Constant Inapproximability for PPA.
In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.
Christodoulou, George, Leonardi, Stefano and Sgouritsa, Alkmini
(2019)
Designing Cost-Sharing Methods for Bayesian Games.
THEORY OF COMPUTING SYSTEMS, 63 (1).
pp. 4-25.
Christodoulou, George, Leonardi, Stefano and Sgouritsa, Alkmini
(2019)
Designing Cost-Sharing Methods for Bayesian Games.
Theory Comput. Syst., 63.
4 - 25.
Akrida, Eleni C ORCID: 0000-0002-1126-1623, Mertzios, George B, Nikoletseas, Sotiris, Raptopoulos, Christoforos, Spirakis, Paul G ORCID: 0000-0001-5396-3749 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2019)
How fast can we reach a target vertex in stochastic temporal graphs?
Leibniz International Proceedings in Informatics, LIPIcs, 132.
131:1-131:1.
Harms, Nathaniel, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
(2022)
Randomized Communication and Implicit Graph Representations.
In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing.
Grandoni, Fabrizio, Krysta, Piotr, Leonardi, Stefano and Ventre, Carmine
(2014)
UTILITARIAN MECHANISM DESIGN FOR MULTIOBJECTIVE OPTIMIZATION.
SIAM JOURNAL ON COMPUTING, 43 (4).
pp. 1263-1290.