26 citations · 203 across the 41 of their papers we have counts for
24 papers · 1 filter
Ordinal Potential-based Player Rating
Nelson Vadori, Rahul Savani
It was recently observed that Elo ratings fail at preserving transitive relations among strategies and therefore cannot correctly extract the transitive component of a game. We pro…
Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures
Nelson Vadori, Rahul Savani, Thomas Spooner +1
Cheung and Piliouras (2020) recently showed that two variants of the Multiplicative Weights Update method - OMWU and MWU - display opposite convergence properties depending on whet…
Sample-based Approximation of Nash in Large Many-Player Games via Gradient Descent
Ian Gemp, Rahul Savani, Marc Lanctot +6
Nash equilibrium is a central concept in game theory. Several Nash solvers exist, yet none scale to normal-form games with many actions and many players, especially those with payo…
Path Polymatrix Games are PPAD-hard
Argyrios Deligkas, John Fearnley, Rahul Savani
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree polymatrix game with at most twenty actions per player, and path polymatrix game with at most four hundred act…
One-Clock Priced Timed Games are PSPACE-hard
John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani
The main result of this paper is that computing the value of a one-clock priced timed game (OCPTG) is PSPACE-hard. Along the way, we provide a family of OCPTGs that have an exponen…
Symmetric Decomposition of Asymmetric Games
Karl Tuyls, Julien Perolat, Marc Lanctot +6
We introduce new theoretical insights into two-population asymmetric games allowing for an elegant symmetric decomposition into two single population symmetric games. Specifically,…