Search
Skip to Search Results- 5Game theory
- 4Poker
- 3Computer Games
- 2Artificial Intelligence
- 2Extensive games
- 1Computer game playing
- 3Johanson, Michael
- 2Bowling, Michael
- 2Zinkevich, Martin
- 1Billings, Darse
- 1Lanctot, Marc
- 1Piccione, Carmelo
-
2013
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
2013-02-26
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
2009
Bowling, Michael, Zinkevich, Martin, Waugh, Kevin, Lanctot, Marc
Technical report TR09-15. Sequential decision-making with multiple agents and imperfect information is commonly modeled as an extensive game. One efficient method for computing Nash equilibria in large, zero-sum, imperfect information games is counterfactual regret minimization (CFR). In the...
-
2007
Bowling, Michael, Johanson, Michael, Zinkevich, Martin, Piccione, Carmelo
Technical report TR07-14. Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has received a great deal of recent attention. In this paper, we describe a new technique for...