Alexandros Hollender

Available identifiers

Publication	Date of Publication	Type
MergeShuffle: a very fast, parallel random permutation algorithm	2024-10-31	Paper
Further collapses in TFNP	2024-07-05	Paper
The complexity of gradient descent: CLS = PPAD \(\cap\) pls	2024-07-04	Paper
Tight inapproximability of Nash equilibria in public goods games	2024-06-07	Paper
The frontier of intractability for EFX with two agents	2024-05-29	Paper
Further collapses in \(\mathsf{TFNP}\)	2024-05-24	Paper
https://portal.mardi4nfdi.de/entity/Q6147413	2024-01-15	Paper
Constant inapproximability for PPA	2023-12-08	Paper
The complexity of gradient descent: CLS = PPAD ∩ PLS	2023-11-14	Paper
Consensus-Halving: Does It Ever Get Easier?	2023-04-28	Paper
On the Complexity of Equilibrium Computation in First-Price Auctions	2023-04-04	Paper
Consensus halving for sets of items	2023-03-21	Paper
Consensus Halving for Sets of Items	2023-01-09	Paper
Two's company, three's a crowd: consensus-halving for a constant number of agents	2022-11-08	Paper
The Hairy Ball Problem is PPAD-Complete.	2022-07-21	Paper
Optimally Deceiving a Learning Leader in Stackelberg Games	2022-02-07	Paper
The Hairy Ball problem is PPAD-complete	2021-09-17	Paper
The classes PPA-\(k\): existence from arguments modulo \(k\)	2021-09-06	Paper
Maximum Nash welfare and other stories about EFX	2021-03-18	Paper
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms	2020-11-03	Paper
The classes PPA-\(k\): existence from arguments modulo \(k\)	2020-06-30	Paper

This page was built for person: Alexandros Hollender