Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 16 / Issue 18

available in:   PDF (253 kB) PS (374 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-016-18-2686


How Incomputable is Finding Nash Equilibria?

Arno Pauly (University of Cambridge, United Kingdom)

Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, also pure and correlated equilibria, as well as various concepts of iterated strategy elimination, are dealt with. As a side result, the Weihrauch-degree of solving systems of linear inequalities is settled.

Keywords: Computable Analysis, Discontinuity, Game Theory, Nash Equilibrium,, Weihrauch-degree

Categories: F.2.0