Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Lund, Troels"'
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}$-complet
Externí odkaz:
http://arxiv.org/abs/2107.04300
Autor:
McAndrew, Patricia, Bournonville, August, Zinck, Ludvig, Rossini, Gioacchino, Méhul, Etienne-Nicolas, Spontini, Gasparo, Schneitzhoeffer, Jean, Frøhlich, Johannes Frederik, Auber, Daniel Francois, Bredal, Ivar Frederik, Helsted, Edvard, Løvenskjold, Herman, Paulli, Holger Simon, Wallich, Aron, Lund, Troels, Christensen, Christian Ferdinand, Gade, Niels
Publikováno v:
Dance Chronicle, 1979 Jan 01. 3(3), 285-324.
Externí odkaz:
https://www.jstor.org/stable/1567437
Autor:
McAndrew, Patricia, Bournonville, August, Helsted, Edvard, Paulli, Holger Simon, Christensen, Christian Ferdinand, Lund, Troels, Gade, Niels, Hartmann, J. P. E., Weden, Andreas Peter
Publikováno v:
Dance Chronicle, 1981 Jan 01. 4(2), 155-193.
Externí odkaz:
https://www.jstor.org/stable/1567393
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 >
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
https://pure.au.dk/portal/da/publications/computational-complexity-of-computing-a-quasiproper-equilibrium(66c65af2-1868-4e7d-8eb7-4df88d584376).html
Publikováno v:
EC: Economics & Computation; 6/18/2018, p113-130, 18p
Autor:
Bošanský, Branislav, Brânzei, Simina, Hansen, Kristoffer Arnsfelt, Lund, Troels Bjerre, Miltersen, Peter Bro
Publikováno v:
ACM Transactions on Economics and Computation; December 2017, Vol. 5 Issue: 4 p1-24, 24p