3 research outputs found
Large Supports are required for Well-Supported Nash Equilibria
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 provide a graph-theoretic characterization of
win-lose games that possess -WSNE with constant cardinality supports.
We then apply a result in additive number theory of Haight to construct
win-lose games that do not satisfy the requirements of the characterization.
These constructions disprove graph theoretic conjectures of Daskalakis, Mehta
and Papadimitriou, and Myers