8 citations · 10 across the 6 of their papers we have counts for
3 papers · 1 filter
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod
Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowle…
The Complexity of Genetic Diversity
Ruta Mehta, Ioannis Panageas, Georgios Piliouras +1
A key question in biological systems is whether genetic diversity persists in the long run under evolutionary competition or whether a single dominant genotype emerges. Classic wor…
Settling the Complexity of Arrow-Debreu Markets under Leontief and PLC Utilities, using the Classes FIXP and \Exists-R
Jugal Garg, Ruta Mehta, Vijay V. Vazirani +1
This paper resolves two of the handful of remaining questions on the computability of market equilibria, a central theme within algorithmic game theory (AGT). Our results are as fo…