Clik here to view.
Consensus Halving for Sets of Items.
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong: Consensus Halving for Sets of Items. CoRR abs/2007.06754 (2020)
View ArticleClik here to view.
Optimally Deceiving a Learning Leader in Stackelberg Games.
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris: Optimally Deceiving a Learning Leader in Stackelberg Games. CoRR...
View ArticleClik here to view.
A Topological Characterization of Modulo-p Arguments and Implications for...
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis: A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. CoRR abs/2003.11974 (2020)
View ArticleClik here to view.
Consensus-Halving: Does it Ever Get Easier?
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis: Consensus-Halving: Does it Ever Get Easier? CoRR abs/2002.11437 (2020)
View ArticleClik here to view.
Maximum Nash Welfare and Other Stories About EFX.
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris: Maximum Nash Welfare and Other Stories About EFX. CoRR abs/2001.09838 (2020)
View ArticleClik here to view.
Consensus Halving for Sets of Items.
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong: Consensus Halving for Sets of Items. WINE 2020: 384-397
View ArticleClik here to view.
Consensus-Halving: Does It Ever Get Easier?
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis: Consensus-Halving: Does It Ever Get Easier? EC 2020: 381-399
View ArticleClik here to view.
Optimally Deceiving a Learning Leader in Stackelberg Games.
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris: Optimally Deceiving a Learning Leader in Stackelberg Games. NeurIPS 2020
View ArticleClik here to view.
Maximum Nash Welfare and Other Stories About EFX.
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris: Maximum Nash Welfare and Other Stories About EFX. IJCAI 2020: 24-30
View ArticleClik here to view.
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong: Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. AAAI 2020: 1990-1997
View ArticleClik here to view.
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong: Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. J. Artif. Intell. Res. 69: 109-141 (2020)
View ArticleClik here to view.
FIXP-membership via Convex Optimization: Games, Cakes, and Markets.
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender: FIXP-membership via Convex Optimization: Games, Cakes, and Markets. CoRR abs/2111.06878 (2021)
View ArticleClik here to view.
On the Complexity of Equilibrium Computation in First-Price Auctions.
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças: On the Complexity of Equilibrium Computation in First-Price Auctions. CoRR abs/2103.03238 (2021)
View ArticleClik here to view.
The complexity of gradient descent: CLS = PPAD ∩ PLS.
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani: The complexity of gradient descent: CLS = PPAD ∩ PLS. STOC 2021: 46-59
View ArticleClik here to view.
A Topological Characterization of Modulo-p Arguments and Implications for...
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis: A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting. SODA 2021: 2615-2634
View ArticleClik here to view.
On the Complexity of Equilibrium Computation in First-Price Auctions.
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças: On the Complexity of Equilibrium Computation in First-Price Auctions. EC 2021: 454-476
View ArticleClik here to view.
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of...
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender: Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents. EC 2021: 347-368
View ArticleClik here to view.
FIXP-membership via Convex Optimization: Games, Cakes, and Markets.
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender: FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS 2021: 827-838
View ArticleClik here to view.
The classes PPA-k: Existence from arguments modulo k.
Alexandros Hollender: The classes PPA-k: Existence from arguments modulo k. Theor. Comput. Sci. 885: 15-29 (2021)
View ArticleClik here to view.
Maximum Nash welfare and other stories about EFX.
Georgios Amanatidis, Georgios Birmpas, Aris Filos-Ratsikas, Alexandros Hollender, Alexandros A. Voudouris: Maximum Nash welfare and other stories about EFX. Theor. Comput. Sci. 863: 69-85 (2021)
View ArticleClik here to view.
The Hairy Ball problem is PPAD-complete.
Paul W. Goldberg, Alexandros Hollender: The Hairy Ball problem is PPAD-complete. J. Comput. Syst. Sci. 122: 34-62 (2021)
View ArticleClik here to view.
Optimally Deceiving a Learning Leader in Stackelberg Games.
Georgios Birmpas, Jiarui Gan, Alexandros Hollender, Francisco J. Marmolejo Cossío, Ninad Rajgopal, Alexandros A. Voudouris: Optimally Deceiving a Learning Leader in Stackelberg Games. J. Artif. Intell....
View ArticleClik here to view.
Structural results for total search complexity classes with applications to...
Alexandros Hollender: Structural results for total search complexity classes with applications to game theory and optimisation. University of Oxford, UK, 2021
View ArticleClik here to view.
Separations in Proof Complexity and TFNP.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao: Separations in Proof Complexity and TFNP. Electron. Colloquium Comput. Complex. TR22 (2022)
View ArticleClik here to view.
Further Collapses in TFNP.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao: Further Collapses in TFNP. Electron. Colloquium Comput. Complex. TR22 (2022)
View ArticleClik here to view.
Tight Inapproximability for Graphical Games.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos: Tight Inapproximability for Graphical Games. CoRR abs/2209.15151 (2022)
View ArticleClik here to view.
Pure-Circuit: Strong Inapproximability for PPAD.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos: Pure-Circuit: Strong Inapproximability for PPAD. CoRR abs/2209.15149 (2022)
View ArticleClik here to view.
Separations in Proof Complexity and TFNP.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao: Separations in Proof Complexity and TFNP. CoRR abs/2205.02168 (2022)
View ArticleClik here to view.
Further Collapses in TFNP.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao: Further Collapses in TFNP. CoRR abs/2202.07761 (2022)
View ArticleClik here to view.
Constant Inapproximability for PPA.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos: Constant Inapproximability for PPA. CoRR abs/2201.10011 (2022)
View ArticleClik here to view.
Constant inapproximability for PPA.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos: Constant inapproximability for PPA. STOC 2022: 1010-1023
View ArticleClik here to view.
Separations in Proof Complexity and TFNP.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao: Separations in Proof Complexity and TFNP. FOCS 2022: 1150-1161
View ArticleClik here to view.
Pure-Circuit: Strong Inapproximability for PPAD.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos: Pure-Circuit: Strong Inapproximability for PPAD. FOCS 2022: 159-170
View ArticleClik here to view.
Further Collapses in TFNP.
Mika Göös, Alexandros Hollender, Siddhartha Jain, Gilbert Maystre, William Pires, Robert Robere, Ran Tao: Further Collapses in TFNP. CCC 2022: 33:1-33:15
View ArticleClik here to view.
Consensus Halving for Sets of Items.
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong: Consensus Halving for Sets of Items. Math. Oper. Res. 47(4): 3357-3379 (2022)
View ArticleClik here to view.
Two's company, three's a crowd: Consensus-halving for a constant number of...
Argyrios Deligkas, Aris Filos-Ratsikas, Alexandros Hollender: Two's company, three's a crowd: Consensus-halving for a constant number of agents. Artif. Intell. 313: 103784 (2022)
View ArticleClik here to view.
PPAD-membership for Problems with Exact Rational Solutions: A General...
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender: PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. CoRR...
View ArticleClik here to view.
The Complexity of Computing KKT Solutions of Quadratic Programs.
John Fearnley, Paul W. Goldberg, Alexandros Hollender, Rahul Savani: The Complexity of Computing KKT Solutions of Quadratic Programs. CoRR abs/2311.13738 (2023)
View ArticleClik here to view.
Envy-Free Cake-Cutting for Four Agents.
Alexandros Hollender, Aviad Rubinstein: Envy-Free Cake-Cutting for Four Agents. CoRR abs/2311.02075 (2023)
View ArticleClik here to view.
The Computational Complexity of Finding Stationary Points in Non-Convex...
Alexandros Hollender, Manolis Zampetakis: The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. CoRR abs/2310.09157 (2023)
View ArticleClik here to view.
The Frontier of Intractability for EFX with Two Agents.
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender: The Frontier of Intractability for EFX with Two Agents. CoRR abs/2301.10354 (2023)
View ArticleClik here to view.
The Frontier of Intractability for EFX with Two Agents.
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender: The Frontier of Intractability for EFX with Two Agents. SAGT 2023: 290-307
View ArticleClik here to view.
Envy-Free Cake-Cutting for Four Agents.
Alexandros Hollender, Aviad Rubinstein: Envy-Free Cake-Cutting for Four Agents. FOCS 2023: 113-122
View ArticleClik here to view.
The Computational Complexity of Finding Stationary Points in Non-Convex...
Alexandros Hollender, Emmanouil Zampetakis: The Computational Complexity of Finding Stationary Points in Non-Convex Optimization. COLT 2023: 5571-5572
View ArticleClik here to view.
Tight Inapproximability for Graphical Games.
Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos: Tight Inapproximability for Graphical Games. AAAI 2023: 5600-5607
View ArticleClik here to view.
Consensus-Halving: Does It Ever Get Easier?
Aris Filos-Ratsikas, Alexandros Hollender, Katerina Sotiraki, Manolis Zampetakis: Consensus-Halving: Does It Ever Get Easier? SIAM J. Comput. 52(2): 412-451 (2023)
View ArticleClik here to view.
On the Complexity of Equilibrium Computation in First-Price Auctions.
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Philip Lazos, Diogo Poças: On the Complexity of Equilibrium Computation in First-Price Auctions. SIAM J. Comput. 52(1): 80-131 (2023)
View ArticleClik here to view.
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS.
John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani: The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. J. ACM 70(1): 7:1-7:74 (2023)
View ArticleTight Inapproximability of Nash Equilibria in Public Goods Games.
Jérémi Do Dinh, Alexandros Hollender: Tight Inapproximability of Nash Equilibria in Public Goods Games. CoRR abs/2402.14198 (2024)
View ArticleOn the Computation of Equilibria in Discrete First-Price Auctions.
Aris Filos-Ratsikas, Yiannis Giannakopoulos, Alexandros Hollender, Charalampos Kokkalis: On the Computation of Equilibria in Discrete First-Price Auctions. CoRR abs/2402.12068 (2024)
View Article
