We study single-player extensive-form games with imperfect recall, such ...
We study the convergence of best-response dynamics in lottery contests. ...
We consider the problem of sharing a set of indivisible goods among agen...
Lipschitz games, in which there is a limit λ (the Lipschitz value of
the...
We study a general scenario of simultaneous contests that allocate prize...
We consider the problem of partitioning a line segment into two subsets,...
The cake-cutting problem involves dividing a heterogeneous, divisible
re...
Nearly a decade ago, Azrieli and Shmaya introduced the class of
λ-Lipsch...
We study search problems that can be solved by performing Gradient Desce...
Consensus halving refers to the problem of dividing a resource into two ...
This paper addresses the computational challenges of learning strong
sub...
We study the fair allocation of a cake, which serves as a metaphor for a...
This paper develops algorithms to solve strong-substitutes product-mix
a...
The Hairy Ball Theorem states that every continuous tangent vector field...
We characterise the set of dominant strategy incentive compatible (DSIC)...
Suppose that an m-simplex is partitioned into n convex regions having
di...
We resolve the computational complexity of two problems known as
NECKLAC...
We show that the computational problem CONSENSUS-HALVING is PPA-complete...