
On the Complexity of Equilibrium Computation in FirstPrice Auctions
We consider the problem of computing a (pure) BayesNash equilibrium in ...
read it

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
We study search problems that can be solved by performing Gradient Desce...
read it

Two's Company, Three's a Crowd: ConsensusHalving for a Constant Number of Agents
We consider the εConsensusHalving problem, in which a set of heterogen...
read it

Consensus Halving for Sets of Items
Consensus halving refers to the problem of dividing a resource into two ...
read it

Optimally Deceiving a Learning Leader in Stackelberg Games
Recent results in the ML community have revealed that learning algorithm...
read it

A Topological Characterization of Modulop Arguments and Implications for Necklace Splitting
The classes PPAp have attracted attention lately, because they are the ...
read it

ConsensusHalving: Does it Ever Get Easier?
In the εConsensusHalving problem, a fundamental problem in fair divisi...
read it

ConsenusHalving: Does it Ever Get Easier?
In the εConsensusHalving problem, a fundamental problem in fair divisi...
read it

Maximum Nash Welfare and Other Stories About EFX
We consider the classic problem of fairly allocating indivisible goods a...
read it

The Classes PPAk: Existence from Arguments Modulo k
The complexity classes PPAk, k ≥ 2, have recently emerged as the main c...
read it

Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
We study the fair allocation of a cake, which serves as a metaphor for a...
read it

The Hairy Ball Problem is PPADComplete
The Hairy Ball Theorem states that every continuous tangent vector field...
read it
Alexandros Hollender
is this you? claim profile