License
when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.CCA.2009.2271
URN: urn:nbn:de:0030-drops-22719
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2271/

Pauly, Arno
Contributed Papers

How Discontinuous is Computing Nash Equilibria? (Extended Abstract)

pdf-format:
Dokument 1.pdf (377 KB)


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.

BibTeX - Entry

@InProceedings{pauly:OASIcs:2009:2271,
  author =	{Arno Pauly},
  title =	{{How Discontinuous is Computing Nash Equilibria? (Extended Abstract)}},
  booktitle =	{6th International Conference on Computability and Complexity in Analysis (CCA'09)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-12-5},
  ISSN =	{2190-6807},
  year =	{2009},
  volume =	{11},
  editor =	{Andrej Bauer and Peter Hertling and Ker-I Ko},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2271},
  URN =		{urn:nbn:de:0030-drops-22719},
  doi =		{http://dx.doi.org/10.4230/OASIcs.CCA.2009.2271},
  annote =	{Keywords: Game Theory, computable analysis, Nash equilibrium, discontinuity}
}

Keywords: Game Theory, computable analysis, Nash equilibrium, discontinuity
Seminar: 6th International Conference on Computability and Complexity in Analysis (CCA'09)
Issue date: 2009
Date of publication: 25.11.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI