Browse by People

Fearnley, John, Goldberg, Paul W, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831 (2021) The Complexity of Gradient Descent: CLS = PPAD boolean AND PLS. In: STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing.

Fearnley, John, Goldberg, Paul, Hollender, Alexandros and Savani, Rahul ORCID: 0000-0003-1262-7831 (2023) The Complexity of Gradient Descent: CLS = PPAD boolean AND PLS. .

Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114, Hollender, Alexandros, Sotiraki, Katerina and Zampetakis, Manolis (2020) Consensus-Halving: Does It Ever Get Easier? In: EC '20: The 21st ACM Conference on Economics and Computation, 2020-7-13 - 2020-7-16, Virtual.

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.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. [Preprint]

Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114, Hansen, Kristoffer Arnsfelt, Hogh, Kasper and Hollender, Alexandros (2022) FIXP-membership via Convex Optimization: Games, Cakes, and Markets. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2022-2-7 - 2022-2-10, Denver, Colorado, USA.

Amanatidis, Georgios, Birmpas, Georgios, Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114, Hollender, Alexandros and Voudouris, Alexandros A (2020) Maximum Nash Welfare and Other Stories About EFX. In: International Joint Conference on Artificial Intelligence, Yokohama, Japan.

Amanatidis, Georgios, Birmpas, Georgios, Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114, Hollender, Alexandros and Voudouris, Alexandros A (2021) Maximum Nash welfare and other stories about EFX. Theoretical Computer Science, 863. pp. 69-85.

Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114, Giannakopoulos, Yiannis, Hollender, Alexandros, Lazos, Philip and Poças, Diogo (2021) On the Complexity of Equilibrium Computation in First-Price Auctions. In: EC '21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary.

Deligkas, Argyrios, Fearnley, John, Hollender, Alexandros and Melissourgos, Themistoklis (2022) Tight Inapproximability for Graphical Games. In: AAAI 2023.

Deligkas, Argyrios, Filos-Ratsikas, Aris ORCID: 0000-0001-7868-8114 and Hollender, Alexandros (2021) Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. In: EC '21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary.