Alexandros Hollender

University of Oxford — United Kingdom

Decision Sciences · Social Sciences

10h-index314citations73works0.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Auction Theory and Applications(32), Game Theory and Voting Systems(25), Game Theory and Applications(22), Complexity and Algorithms in Graphs(17), Economic theories and models(15)

Publications73 total

Discrepancy Beyond Additive Functions with Applications to Fair Division (Extended Abstract)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich
2025
Computing Equilibrium Points of Electrostatic Potentials
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2025Open Access
Envy-Free Cake-Cutting for Four Agents
Journal of the ACM·2025Open Access
Equilibrium Computation in First-Price Auctions with Correlated Priors
2025Open Access
The frontier of intractability for EFX with two agents
Theoretical Computer Science·2025Open Access
The Complexity of Computing KKT Solutions of Quadratic Programs
Journal of the ACM·2025Open Access
Equilibrium Computation in First-Price Auctions with Correlated Priors
arXiv (Cornell University)·2025Open Access
Constant Inapproximability for PPA
SIAM Journal on Computing·2025· 1 citedOpen Access
Computing approximate roots of monotone functions
Journal of Complexity·2025Open Access
The Complexity of Symmetric Bimatrix Games with Common Payoffs
arXiv (Cornell University)·2024Open Access
The computational complexity of finding stationary points in non-convex optimization
Mathematical Programming·2024Open Access
The Complexity of Two-Team Polymatrix Games with Independent Adversaries
arXiv (Cornell University)·2024Open Access
Pure-Circuit: Tight Inapproximability for PPAD
Journal of the ACM·2024· 1 citedOpen Access
Constant Inapproximability for Fisher Markets
2024· 1 citedOpen Access
On the Computation of Equilibria in Discrete First-Price Auctions
2024· 1 citedOpen Access
The Complexity of Computing KKT Solutions of Quadratic Programs
2024· 1 citedOpen Access
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization
2024· 3 citedOpen Access
Separations in Proof Complexity and TFNP
Journal of the ACM·2024· 2 citedOpen Access
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\)
SIAM Journal on Computing·2024· 2 cited
page 1 of 4Next →

Frequent Co-authors

Aris Filos-Ratsikas(17), John Fearnley(10), Argyrios Deligkas(10), Paul W. Goldberg(9), Themistoklis Melissourgos(7), Manolis Zampetakis(6), Mika Göös(6), William Pires(6), Robert Robere(6), Katerina Sotiraki(5), Siddhartha Jain(5), Kasper Høgh(5), Alexandros A. Voudouris(4), Yiannis Giannakopoulos(4), Gilbert Maystre(4), Georgios Birmpas(3), Rahul Savani(3), Gilbert Maystre(3), Kristoffer Arnsfelt Hansen(3), Georgios Amanatidis(2)