26 citations · 203 across the 41 of their papers we have counts for
5 papers · 1 filter
Distributed Methods for Computing Approximate Equilibria
Artur Czumaj, Argyrios Deligkas, Michail Fasoulakis +3
We present a new, distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same t…
Computing stable outcomes in symmetric additively-separable hedonic games
Martin Gairing, Rahul Savani
We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively…
The Complexity of All-switches Strategy Improvement
John Fearnley, Rahul Savani
Strategy improvement is a widely-used and well-studied class of algorithms for solving graph-based infinite games. These algorithms are parameterized by a switching rule, and one o…
An Empirical Study of Finding Approximate Equilibria in Bimatrix Games
John Fearnley, Tobenna Peter Igwe, Rahul Savani
While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate…
Unit Vector Games
Rahul Savani, Bernhard von Stengel
McLennan and Tourky (2010) showed that "imitation games" provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke-Howson algorithm. In an imitation…