We give a simple and computationally efficient algorithm that, for any constant ε> 0, obtains ε
T-swap regret within only T=(n) rounds; this is an exponential improvement compared to the …

For a constant ϵ, we prove a (N) lower bound on the (randomized) communication
complexity of ϵ-Nash equilibrium in two-player N x N games. For n-player binary-action …

We consider (i) the problem of finding a (possibly mixed) Nash equilibrium in congestion
games, and (ii) the problem of finding an (exponential precision) fixed point of the gradient …

In the envy-free cake-cutting problem we are given a resource, usually called a cake and
represented as the 0,1 interval, and a set of n agents with heterogeneous preferences over …

Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria Page 1 Copyright
© by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. © 2021 …

Query complexity and communication complexity of equilibria have been actively studied in
the past decade. Recent progress in these fields of informational complexity has led to a …

We study the fundamental, classical mechanism design problem of single-buyer multi-item
Bayesian revenue-maximizing auctions under the lens of communication complexity …

The goal of this monograph is twofold:(i) to explain how complexity theory has helped
illuminate several barriers in economics and game theory, and (ii) to illustrate how …

We study the communication complexity of incentive compatible auction-protocols between
a monopolist seller and a single buyer with a combinatorial valuation function over n items …

In algorithmic game theory, we analyze games and design mechanisms through
computational lens. We prefer mechanisms that are simple, deterministic and incentive …