Articles The State of Solving Large Incomplete-Information Games, and Application to Poker
| Citations: | 2 - 0 self |
BibTeX
@MISC{Sandholm_articlesthe,
author = {Tuomas Sandholm},
title = {Articles The State of Solving Large Incomplete-Information Games, and Application to Poker},
year = {}
}
OpenURL
Abstract
n Game-theoretic solution concepts prescribe how rational parties should act, but to become operational the concepts need to be accompanied by algorithms. I will review the state of solving incomplete-information games. They encompass many practical problems such as auctions, negotiations, and security applications. I will discuss them in the context of how they have transformed computer poker. In short, game-theoretic reasoning now scales to many large problems, outperforms the alternatives on those problems, and in some games beats the best humans. Game-theoretic solution concepts prescribe how rational parties should act in multiagent settings. This is nontrivial







