|
|
|
|
How Incomputable is Finding Nash Equilibria?
|
|
|
|
|
|
|
|
نویسنده
|
Pauly Arno
|
|
منبع
|
journal of universal computer science - 2010 - دوره : 16 - شماره : 18 - صفحه:2686 -2710
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Computable Analysis ,Discontinuity ,Game Theory ,Nash Equilibrium ,Weihrauch-degree
|
|
آدرس
|
University of Cambridge, United Kingdom
|
|
پست الکترونیکی
|
arno.pauly@cl.cam.ac.uk
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|