research
∙
09/30/2022
Pure-Circuit: Strong Inapproximability for PPAD
The current state-of-the-art methods for showing inapproximability in PP...
share
research
∙
11/03/2020
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
We study search problems that can be solved by performing Gradient Desce...
research
∙
07/01/2018
An Improved Envy-Free Cake Cutting Protocol for Four Agents
We consider the classic cake-cutting problem of producing envy-free allo...
research
∙
09/26/2017
