Timeability of Extensive-Form Games

DOI10.1145/2840728.2840737zbMath1335.91026arXiv1502.03430OpenAlexW1928184567MaRDI QIDQ2800565

Vincent Conitzer, Sune Kristian Jakobsen, Troels Bjerre Sørensen

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03430

zbMATH Keywords

equilibrium computationcomputational game theory

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Games in extensive form (91A18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games of timing (91A55)

Related Items (3)

Rethinking formal models of partially observable multiagent decision making ⋮ A Numbers-on-Foreheads Game ⋮ Value functions for depth-limited solving in zero-sum imperfect-information games

This page was built for publication: Timeability of Extensive-Form Games