Mark Braverman
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Game Theory×1Complexity×1
Frequent co-authors
Research Timeline
2026
Hardness of Approximate Hylland-Zeckhauser Equilibria
The paper establishes that finding approximate Hylland-Zeckhauser equilibria (a type of market allocation) is computationally hard, specifically showing it is PPAD-hard under certain complexity assumptions.
Highlighted terms show continued research focus across papers