7 citations · 10 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2015★ 7 cited
Large Supports are required for Well-Supported Nash Equilibria
Yogesh Anbalagan, Hao Huang, Shachar Lovett +3
We prove that for any constant and any , there exist bimatrix win-lose games for which every -WSNE requires supports of cardinality greater than . To do this, we pro…
cs.GT2013★ 3 cited
Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria below 2/3
Yogesh Anbalagan, Sergey Norin, Rahul Savani +1
In an epsilon-approximate Nash equilibrium, a player can gain at most epsilon in expectation by unilateral deviation. An epsilon well-supported approximate Nash equilibrium has the…