Alexandros Hollender

88 papers A* 23A 3B 1C 1Journal 55Unranked 4
YearRankTypeTitle / Venue / Authors
2026 A conf
Computing Equilibrium Points of Electrostatic Potentials.
ITCS
Abheek Ghosh, Paul W. Goldberg, Alexandros Hollender
2026 A conf
Discrepancy Beyond Additive Functions with Applications to Fair Division (Extended Abstract).
ITCS
Alexandros Hollender, Pasin Manurangsi, Raghu Meka, Warut Suksompong
2026 J jnl
Efficient Equilibrium Computation in Symmetric First-Price Auctions.
CoRR
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis
2025 J jnl
Computing Equilibrium Points of Electrostatic Potentials.
CoRR
Abheek Ghosh, Paul W. Goldberg, Alexandros Hollender
2025 J jnl
Computing approximate roots of monotone functions.
J. Complex.
Alexandros Hollender, Chester Lawrence, Erel Segal-Halevi
2025 J jnl
Constant Inapproximability for PPA.
SIAM J. Comput.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2025 J jnl
Discrepancy Beyond Additive Functions with Applications to Fair Division.
CoRR
Alexandros Hollender, Pasin Manurangsi, Raghu Meka, Warut Suksompong
2025 J jnl
Envy-Free Cake-Cutting for Four Agents.
J. ACM
Alexandros Hollender, Aviad Rubinstein
2025 A* conf
Equilibrium Computation in First-Price Auctions with Correlated Priors.
EC
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis
2025 J jnl
Equilibrium Computation in First-Price Auctions with Correlated Priors.
CoRR
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis
2025 A* conf
High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich.
FOCS
Ruiquan Gao, Alexandros Hollender, Aviad Rubinstein
2025 J jnl
The Complexity of Computing KKT Solutions of Quadratic Programs.
J. ACM
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2025 A* conf
The Complexity of Two-Team Polymatrix Games with Independent Adversaries.
ICLR
Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
2025 J jnl
The computational complexity of finding stationary points in non-convex optimization.
Math. Program.
Alexandros Hollender, Manolis Zampetakis
2025 J jnl
The frontier of intractability for EFX with two agents.
Theor. Comput. Sci.
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
2024 A* conf
Constant Inapproximability for Fisher Markets.
EC
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2024 J jnl
Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).
SIAM J. Comput.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2024 A* conf
On the Computation of Equilibria in Discrete First-Price Auctions.
EC
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis
2024 J jnl
On the Computation of Equilibria in Discrete First-Price Auctions.
CoRR
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis
2024 A* conf
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization.
STOC
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
2024 J jnl
Pure-Circuit: Tight Inapproximability for PPAD.
J. ACM
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2024 J jnl
Separations in Proof Complexity and TFNP.
J. ACM
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2024 A* conf
The Complexity of Computing KKT Solutions of Quadratic Programs.
STOC
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2024 — conf
The Complexity of Symmetric Bimatrix Games with Common Payoffs.
WINE
Abheek Ghosh, Alexandros Hollender
2024 J jnl
The Complexity of Symmetric Bimatrix Games with Common Payoffs.
CoRR
Abheek Ghosh, Alexandros Hollender
2024 J jnl
The Complexity of Two-Team Polymatrix Games with Independent Adversaries.
CoRR
Alexandros Hollender, Gilbert Maystre, Sai Ganesh Nagarajan
2024 J jnl
Tight Inapproximability of Nash Equilibria in Public Goods Games.
CoRR
Jérémi Do Dinh, Alexandros Hollender
2024 J jnl
Tight inapproximability of Nash equilibria in public goods games.
Inf. Process. Lett.
Jérémi Do Dinh, Alexandros Hollender
2023 J jnl
Consensus-Halving: Does It Ever Get Easier?
SIAM J. Comput.
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
2023 A* conf
Envy-Free Cake-Cutting for Four Agents.
FOCS
Alexandros Hollender, Aviad Rubinstein
2023 J jnl
Envy-Free Cake-Cutting for Four Agents.
CoRR
Alexandros Hollender, Aviad Rubinstein
2023 J jnl
On the Complexity of Equilibrium Computation in First-Price Auctions.
SIAM J. Comput.
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças
2023 J jnl
PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization.
CoRR
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
2023 J jnl
The Complexity of Computing KKT Solutions of Quadratic Programs.
CoRR
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2023 J jnl
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS.
J. ACM
John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani
2023 A* conf
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization.
COLT
Alexandros Hollender, Emmanouil Zampetakis
2023 J jnl
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization.
CoRR
Alexandros Hollender, Manolis Zampetakis
2023 B conf
The Frontier of Intractability for EFX with Two Agents.
SAGT
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
2023 J jnl
The Frontier of Intractability for EFX with Two Agents.
CoRR
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
2023 A* conf
Tight Inapproximability for Graphical Games.
AAAI
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022 J jnl
Consensus Halving for Sets of Items.
Math. Oper. Res.
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
2022 J jnl
Constant Inapproximability for PPA.
CoRR
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022 A* conf
Constant inapproximability for PPA.
STOC
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022 A conf
Further Collapses in TFNP.
CCC
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Further Collapses in TFNP.
CoRR
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Further Collapses in TFNP.
Electron. Colloquium Comput. Complex.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 A* conf
Pure-Circuit: Strong Inapproximability for PPAD.
FOCS
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022 J jnl
Pure-Circuit: Strong Inapproximability for PPAD.
CoRR
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022 A* conf
Separations in Proof Complexity and TFNP.
FOCS
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Separations in Proof Complexity and TFNP.
CoRR
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Separations in Proof Complexity and TFNP.
Electron. Colloquium Comput. Complex.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao
2022 J jnl
Tight Inapproximability for Graphical Games.
CoRR
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos
2022 J jnl
Two's company, three's a crowd: Consensus-halving for a constant number of agents.
Artif. Intell.
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
2021 A* conf
A Topological Characterization of Modulo-
SODA
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
2021 A* conf
FIXP-membership via Convex Optimization: Games, Cakes, and Markets.
FOCS
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
2021 J jnl
FIXP-membership via Convex Optimization: Games, Cakes, and Markets.
CoRR
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
2021 J jnl
Maximum Nash welfare and other stories about EFX.
Theor. Comput. Sci.
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
2021 A* conf
On the Complexity of Equilibrium Computation in First-Price Auctions.
EC
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças
2021 J jnl
On the Complexity of Equilibrium Computation in First-Price Auctions.
CoRR
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças
2021 J jnl
Optimally Deceiving a Learning Leader in Stackelberg Games.
J. Artif. Intell. Res.
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris
2021 — —
Structural results for total search complexity classes with applications to game theory and optimisation.
Alexandros Hollender
2021 J jnl
The Hairy Ball problem is PPAD-complete.
J. Comput. Syst. Sci.
Paul W. Goldberg, Alexandros Hollender
2021 J jnl
The classes PPA-
Theor. Comput. Sci.
Alexandros Hollender
2021 A* conf
The complexity of gradient descent: CLS = PPAD ∩ PLS.
STOC
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2021 A* conf
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents.
EC
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
2020 J jnl
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting.
CoRR
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
2020 — conf
Consensus Halving for Sets of Items.
WINE
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
2020 J jnl
Consensus Halving for Sets of Items.
CoRR
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong
2020 A* conf
Consensus-Halving: Does It Ever Get Easier?
EC
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
2020 J jnl
Consensus-Halving: Does it Ever Get Easier?
CoRR
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis
2020 A* conf
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
AAAI
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
2020 J jnl
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
J. Artif. Intell. Res.
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
2020 A* conf
Maximum Nash Welfare and Other Stories About EFX.
IJCAI
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
2020 J jnl
Maximum Nash Welfare and Other Stories About EFX.
CoRR
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris
2020 A* conf
Optimally Deceiving a Learning Leader in Stackelberg Games.
NeurIPS
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris
2020 J jnl
Optimally Deceiving a Learning Leader in Stackelberg Games.
CoRR
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris
2020 J jnl
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS.
CoRR
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani
2020 J jnl
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents.
CoRR
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender
2019 J jnl
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
CoRR
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
2019 — conf
The Classes PPA-k: Existence from Arguments Modulo k.
WINE
Alexandros Hollender
2019 J jnl
The Classes PPA-k: Existence from Arguments Modulo k.
CoRR
Alexandros Hollender
2019 A* conf
The Hairy Ball Problem is PPAD-Complete.
ICALP
Paul W. Goldberg, Alexandros Hollender
2019 J jnl
The Hairy Ball Problem is PPAD-Complete.
CoRR
Paul W. Goldberg, Alexandros Hollender
2018 — conf
MergeShuffle: a very fast, parallel random permutation algorithm.
GASCom
Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso
2018 J jnl
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard.
Electron. Colloquium Comput. Complex.
Alexandros Hollender, Paul W. Goldberg
2015 J jnl
MergeShuffle: A Very Fast, Parallel Random Permutation Algorithm.
CoRR
Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso
2014 C conf
Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms.
CRiSIS
Alexander Schaub, Emmanuel Schneider, Alexandros Hollender, Vinicius Calasans, Laurent Jolie, Robin Touillon, Annelie Heuser, Sylvain Guilley, Olivier Rioul
2014 J jnl
Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms.
IACR Cryptol. ePrint Arch.
Alexander Schaub, Emmanuel Schneider, Alexandros Hollender, Vinicius Calasans, Laurent Jolie, Robin Touillon, Annelie Heuser, Sylvain Guilley, Olivier Rioul