10.4230/OASICS.CCA.2009.2271
Pauly, Arno
Arno
Pauly
How Discontinuous is Computing Nash Equilibria? (Extended Abstract)
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2009
Extended Abstract
Game Theory
computable analysis
Nash equilibrium
discontinuity
Bauer, Andrej
Andrej
Bauer
Hertling, Peter
Peter
Hertling
Ko, Ker-I
Ker-I
Ko
2009
2009-11-25
2009-11-25
2009-11-25
en
urn:nbn:de:0030-drops-22719
10.4230/OASIcs.CCA.2009
978-3-939897-12-5
2190-6807
10.4230/OASIcs.CCA.2009
OASIcs, Volume 11, CCA 2009
6th International Conference on Computability and Complexity in Analysis (CCA'09)
2012
11
23
197
208
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Bauer, Andrej
Andrej
Bauer
Hertling, Peter
Peter
Hertling
Ko, Ker-I
Ker-I
Ko
2190-6807
Open Access Series in Informatics (OASIcs)
2009
11
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
12 pages
386122 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
OASIcs, Vol. 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09), pages 197-208