Alexandros Hollender
Cited by
Cited by
Maximum Nash welfare and other stories about EFX
G Amanatidis, G Birmpas, A Filos-Ratsikas, A Hollender, AA Voudouris
International Joint Conference on Artificial Intelligence (IJCAI), 24-30, 2020
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
J Fearnley, PW Goldberg, A Hollender, R Savani
arXiv preprint arXiv:2011.01929, 2020
The Hairy Ball problem is PPAD-complete
PW Goldberg, A Hollender
International Colloquium on Automata, Languages and Programming (ICALP), 65 …, 2019
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
PW Goldberg, A Hollender, W Suksompong
Journal of Artificial Intelligence Research (JAIR) 69, 109-141, 2020
MergeShuffle: A very fast, parallel random permutation algorithm
A Bacher, O Bodini, A Hollender, J Lumbroso
International Conference on Random and Exhaustive Generation of …, 2015
Attacking suggest boxes in web applications over HTTPS using side-channel stochastic algorithms
A Schaub, E Schneider, A Hollender, V Calasans, L Jolie, R Touillon, ...
International Conference on Risks and Security of Internet and Systems, 116-130, 2014
Consensus-Halving: Does it Ever Get Easier?
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
ACM Conference on Economics and Computation (EC), 381-399, 2020
A topological characterization of modulo-p arguments and implications for necklace splitting
A Filos-Ratsikas, A Hollender, K Sotiraki, M Zampetakis
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2615-2634, 2021
The Classes PPA-k: Existence from Arguments Modulo k
A Hollender
International Conference on Web and Internet Economics (WINE), 214-227, 2019
The Complexity of Multi-source Variants of the End-of-Line Problem, and the Concise Mutilated Chessboard.
A Hollender, P Goldberg
Electron. Colloquium Comput. Complex. 25, 120, 2018
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
A Deligkas, A Filos-Ratsikas, A Hollender
Proceedings of the 22nd ACM Conference on Economics and Computation, 347-368, 2021
On the Complexity of Equilibrium Computation in First-Price Auctions
A Filos-Ratsikas, Y Giannakopoulos, A Hollender, P Lazos, D Poças
arXiv preprint arXiv:2103.03238, 2021
Consensus halving for sets of items
PW Goldberg, A Hollender, A Igarashi, P Manurangsi, W Suksompong
International Conference on Web and Internet Economics (WINE), 384-397, 2020
Optimally Deceiving a Learning Leader in Stackelberg Games
G Birmpas, J Gan, A Hollender, FJ Marmolejo-Cossío, N Rajgopal, ...
Conference on Neural Information Processing Systems (NeurIPS), 2020
The system can't perform the operation now. Try again later.
Articles 1–14