34 citations · 120 across the 32 of their papers we have counts for
Showing 2014 · cs.GTShow all
3 papers · 2 filters
cs.GT2014
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…
cs.GT2014
Learning Economic Parameters from Revealed Preferences
Maria-Florina Balcan, Amit Daniely, Ruta Mehta +2
A recent line of work, starting with Beigman and Vohra (2006) and Zadimoghaddam and Roth (2012), has addressed the problem of {\em learning} a utility function from revealed prefer…
cs.GT2014
Constant Rank Bimatrix Games are PPAD-hard
Ruta Mehta
The rank of a bimatrix game (A,B) is defined as rank(A+B). Computing a Nash equilibrium (NE) of a rank-, i.e., zero-sum game is equivalent to linear programming (von Neumann'28,…