2026-08-16T16:19:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2271 2024-03-06T10:28:38Z ddc:004 open_access

How Discontinuous is Computing Nash Equilibria? (Extended Abstract) Pauly, Arno Game Theory computable analysis Nash equilibrium discontinuity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arno Pauly 2009 Is Part Of OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.CCA.2009.2271 urn:nbn:de:0030-drops-22719 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2271 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode