Extended proper equilibrium

Autor: Milgrom, Paul, Mollner, Joshua

Publikováno v: In Journal of Economic Theory June 2021 194

Erratum to: A nonstandard characterization of sequential equilibrium, perfect equilibrium, and proper equilibrium.

Autor: Halpern, Joseph¹ halpern@cs.cornell.edu

Publikováno v: International Journal of Game Theory. May2017, Vol. 46 Issue 2, p591-594. 4p.

Computational Complexity of Computing a Quasi-Proper Equilibrium

Autor: Kristoffer Arnsfelt Hansen, Troels Bjerre Lund

Publikováno v: Fundamentals of Computation Theory ISBN: 9783030865924
FCT

We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of computing a symbolic quasi-proper equilibrium is \(\mathrm {PPAD}\)-comp

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a75d275257837590562a865fab3feaab
https://doi.org/10.1007/978-3-030-86593-1_18

Computational Complexity of Proper Equilibrium

Autor: Kristoffer Arnsfelt Hansen, Troels Bjerre Lund

Publikováno v: EC
Hansen, K A & Lund, T B 2018, Computational Complexity of Proper Equilibrium . in Proceedings of the 2018 ACM Conference on Economics and Computation : EC '18 . Association for Computing Machinery, pp. 113-130 . https://doi.org/10.1145/3219166.3219199
Hansen, K A & Lund, T B 2018, Computational Complexity of Proper Equilibrium . in É Tardos, E Elkind & R Vohra (eds), Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018 . Association for Computing Machinery, New York, NY, USA, pp. 113-130, The nineteenth ACM conference on Economics and Computation (ACM EC’18), Ithaca, United States, 18/06/2018 . https://doi.org/10.1145/3219166.3219199

We study the computational complexity of proper equilibrium in finite games and prove the following results. First, for two-player games in strategic form we show that the task of simply verifying the proper equilibrium conditions of a given pure Nas

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::896b095a275a4d6fb4797b38aeb68dd0
https://doi.org/10.1145/3219166.3219199

Computational Complexity of Computing a Quasi-Proper Equilibrium

Autor: Lund, Troels Bjerre, Hansen, Kristoffer Arnsfelt

Publikováno v: Hansen, K A & Lund, T B 2021, Computational Complexity of Computing a Quasi-Proper Equilibrium . in E Bampis & A Pagourtzis (eds), Fundamentals of Computation Theory : 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings . Springer, Cham, Lecture Notes in Computer Science, vol. 12867, pp. 259-271, 23rd International Symposium on Fundamentals of Computation Theory, 12/09/2021 . https://doi.org/10.1007/978-3-030-86593-1_18
Lund, T B & Hansen, K A 2021, Computational Complexity of Computing a Quasi-Proper Equilibrium . in Fundamentals of Computation Theory : 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings . Cham, Lecture Notes in Computer Science, vol. 12867, pp. 259-271 . < https://arxiv.org/abs/2107.04300 >

We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of computing a symbolic quasi-proper equilibrium is PPAD-complete for two-p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::38d81e2433b7f94dcd60176a70f9c724
https://pure.au.dk/portal/da/publications/computational-complexity-of-computing-a-quasiproper-equilibrium(66c65af2-1868-4e7d-8eb7-4df88d584376).html