Nash equilibrium is one of the most influential solution concepts in game theory. With the
development of computer science and artificial intelligence, there is an increasing demand …

We provide a novel reduction from swap-regret minimization to external-regret minimization,
which improves upon the classical reductions of Blum-Mansour and Stoltz-Lugosi in that it …

We study the query complexity of approximate notions of Nash equilibrium in games with a
large number of players n. Our main result states that for n-player binary-action games and …

We investigate how robust are results of committee elections to small changes in the input
preference orders, depending on the voting rules used. We find that for typical rules the …

This review focuses on properties related to the robustness and stability of Nash equilibria in
games with a large number of players. Somewhat surprisingly, these equilibria become …

In an ϵ ϵ-Nash equilibrium, a player can gain at most ϵ ϵ by unilaterally changing his
behavior. For two-player (bimatrix) games with payoffs in 0, 1, the best-known ϵ ϵ …

We analyze the number of payoff queries needed to compute approximate equilibria of multi-
player games. We find that query complexity is an effective tool for distinguishing the …

We present a complete algorithm for finding an epsilon-Nash equilibrium, for arbitrarily small
epsilon, in games with more than two players. The method improves the best-known upper …

With the continuous advancement of network technology, various emerging complex
networking optimization problems opened up a wide range of applications utilizating of …

We study the two-party communication complexity of finding an approximate Brouwer fixed
point of a composition of two Lipschitz functions gof:[0, 1] n→[0, 1] n, where Alice holds f and …