How discontinuous is computing Nash equilibria? (Extended abstract)

DOI10.4230/OASICS.CCA.2009.2271MaRDI QIDQ2917346zbMATH OpenOpenAlexFDO

Authors Arno Pauly

Publication date 28 September 2012

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa37388/Download/0037388-18122017154800.pdf

zbMATH Keywords

computable analysisdiscontinuitygame theoryNash equilibrium

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) 2-person games (91A05) Noncooperative games (91A10) Special types of economic equilibria (91B52)

Recommendations

• How incomputable is finding Nash equilibria?
• Complexity of pure-strategy Nash equilibria in non-cooperative games
• The complexity of computing a Nash equilibrium
• Computability and randomness of Nash equilibrium in infinite games
• Beyond Nash equilibrium: solution concepts for the 21st century

Cited in

(3)

• On the (semi)lattices induced by continuous reducibilities
• How incomputable is finding Nash equilibria?
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma

This page was built for publication: How discontinuous is computing Nash equilibria? (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917346)