How discontinuous is Computing Nash Equilibria?
Computer Science and Game Theory
2009-07-10 v1
Abstract
We investigate the degree of discontinuity of several solution concepts from non-cooperative game theory. While the consideration of Nash equilibria forms the core of our work, also pure and correlated equilibria are dealt with. Formally, we restrict the treatment to two player games, but results and proofs extend to the n-player case. As a side result, the degree of discontinuity of solving systems of linear inequalities is settled.
Keywords
Cite
@article{arxiv.0907.1482,
title = {How discontinuous is Computing Nash Equilibria?},
author = {Arno Pauly},
journal= {arXiv preprint arXiv:0907.1482},
year = {2009}
}
Comments
to be presented at CCA 2009