Alexandros Hollender

According to our database, Alexandros Hollender authored at least 30 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Tight Inapproximability of Nash Equilibria in Public Goods Games.

Jérémi Do Dinh, Alexandros Hollender

CoRR, 2024

On the Computation of Equilibria in Discrete First-Price Auctions.

Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis

CoRR, 2024

2023

Consensus-Halving: Does It Ever Get Easier?

Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis

SIAM J. Comput., April, 2023

On the Complexity of Equilibrium Computation in First-Price Auctions.

Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças

SIAM J. Comput., February, 2023

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS.

John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani

J. ACM, February, 2023

PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization.

Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender

CoRR, 2023

The Complexity of Computing KKT Solutions of Quadratic Programs.

John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani

CoRR, 2023

The Frontier of Intractability for EFX with Two Agents.

Paul W. Goldberg, Kasper Høgh, Alexandros Hollender

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Envy-Free Cake-Cutting for Four Agents.

Alexandros Hollender, Aviad Rubinstein

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization.

Alexandros Hollender, Emmanouil Zampetakis

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Tight Inapproximability for Graphical Games.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Consensus Halving for Sets of Items.

Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong

Math. Oper. Res., November, 2022

Separations in Proof Complexity and TFNP.

Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao

Electron. Colloquium Comput. Complex., 2022

Further Collapses in TFNP.

Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao

Electron. Colloquium Comput. Complex., 2022

Two's company, three's a crowd: Consensus-halving for a constant number of agents.

Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender

Artif. Intell., 2022

Constant inapproximability for PPA.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Pure-Circuit: Strong Inapproximability for PPAD.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Structural results for total search complexity classes with applications to game theory and optimisation.

Alexandros Hollender

PhD thesis, 2021

The classes PPA-<i>k</i>: Existence from arguments modulo <i>k</i>.

Alexandros Hollender

Theor. Comput. Sci., 2021

Maximum Nash welfare and other stories about EFX.

Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris

Theor. Comput. Sci., 2021

The Hairy Ball problem is PPAD-complete.

Paul W. Goldberg, Alexandros Hollender

J. Comput. Syst. Sci., 2021

Optimally Deceiving a Learning Leader in Stackelberg Games.

Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris

J. Artif. Intell. Res., 2021

A Topological Characterization of Modulo-<i>p</i> Arguments and Implications for Necklace Splitting.

Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

FIXP-membership via Convex Optimization: Games, Cakes, and Markets.

Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.

Paul W. Goldberg, Alexandros Hollender, Warut Suksompong

J. Artif. Intell. Res., 2020

A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting.

Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis

CoRR, 2020

2019

The Classes PPA-k: Existence from Arguments Modulo k.

Alexandros Hollender

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

2018

The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard.

Alexandros Hollender, Paul W. Goldberg

Electron. Colloquium Comput. Complex., 2018

MergeShuffle: a very fast, parallel random permutation algorithm.

Axel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2014

Attacking Suggest Boxes in Web Applications Over HTTPS Using Side-Channel Stochastic Algorithms.

Alexander Schaub, Emmanuel Schneider, Alexandros Hollender, Vinicius Calasans, Laurent Jolie, Robin Touillon, Annelie Heuser, Sylvain Guilley, Olivier Rioul

IACR Cryptol. ePrint Arch., 2014