Bounding the support size in extensive form games with imperfect information

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

It is a well known fact that in extensive form games with perfect information, there is a Nash equilibrium with support of size one. This doesn't hold for games with imperfect information, where the size of minimal support can be larger. We present a dependency between the level of uncertainty and the minimum support size. For many games, there is a big disproportion between the game uncertainty and the number of actions available. In Bayesian extensive games with perfect information, the only uncertainty is about the type of players. In card games, the uncertainty comes from dealing the deck. In these games, we can significantly reduce the support size. Our result applies to general-sum extensive form games with any finite number of players.

Cite

CITATION STYLE

APA

Schmid, M., Moravcik, M., & Hladik, M. (2014). Bounding the support size in extensive form games with imperfect information. In Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 784–790). AI Access Foundation. https://doi.org/10.1609/aaai.v28i1.8813

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free