The State of Solving Large Incomplete-Information Games, and Application to Poker

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. This is nontrivial because an agent's utility-maximizing strategy generally depends on the other agents' strategies.