research
∙
07/24/2023
On the complexity of Pareto-optimal and envy-free lotteries
We study the classic problem of dividing a collection of indivisible res...
share
research
∙
03/14/2022
Computational Complexity of Multi-Player Evolutionarily Stable Strategies
In this paper we study the computational complexity of computing an evol...
research
∙
11/12/2021
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
We introduce a new technique for proving membership of problems in FIXP ...
research
∙
07/09/2021
Computational Complexity of Computing a Quasi-Proper Equilibrium
We study the computational complexity of computing or approximating a qu...
research
∙
03/07/2021
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem
In the consensus halving problem we are given n agents with valuations o...
research
∙
06/15/2020
Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games
We show that the problem of deciding whether in a multi-player perfect i...
research
∙
01/15/2020
On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria
We study the computational complexity of decision problems about Nash eq...
research
∙
03/28/2019
A Stay-in-a-Set Game without a Stationary Equilibrium
We give an example of a finite-state two-player turn-based stochastic ga...
research
∙
07/28/2015
