# Fast algorithms for finding randomized strategies in game trees

@inproceedings{Koller1994FastAF, title={Fast algorithms for finding randomized strategies in game trees}, author={Daphne Koller and Nimrod Megiddo and Bernhard von Stengel}, booktitle={STOC '94}, year={1994} }

Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the different players. The standard approach to finding such strategies in games with imperfect information is, in general, computationally intractable. The approach is to generate the normal form of the game (the matrix containing the payoff for each strategy combination), and then solve a linear program (LP) or a linear…

## 221 Citations

Generating and Solving Imperfect Information Games

- Computer ScienceIJCAI
- 1995

Gala is described an implemented system that provides the user with a very natural and expressive language for describing games and implements the first practical algorithm for finding optimal randomized strategies in two player imperfect information competitive games.

Finding mixed strategies with small supports in extensive form games

- Computer Science
- 1996

This paper investigates the existence of “small” mixed strategies in extensive form games, and how such strategies can be used to create more efficient algorithms, and constructs the first exponential-time algorithm for finding all equilibria of an arbitrary two- person game in extensiveform.

Computing Strong Game-Theoretic Strategies and Exploiting Suboptimal Opponents in Large Games

- Computer Science
- 2013

This work proposes a new paradigm in which relevant portions of the game are solved in real time in much finer degrees of granularity than the abstract game which is solved offline, enabling us to solve games with significantly less abstraction for the initial betting rounds.

Finding equilibria in large sequential games of imperfect information

- Economics, Computer ScienceEC '06
- 2006

It is proved that any Nash equilibrium in an abstracted smaller game, obtained by one or more applications of the transformation, can be easily converted into a Nash equilibriumIn the original game.

Combinatorial optimization games

- EconomicsSODA '97
- 1997

A general integer programming formulation for a class of combinatorial optimization games is introduced, which immediately allows us to improve the algorithmic result for finding imputations in the core of the network flow game on simple networks.

A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games

- Computer ScienceAISTATS
- 2007

This work presents a new anytime algorithm for convex games that leverages fast best-response oracles for both players to build a model of the overall game and does an exact minimization in this direction via a specialized line search.

Algorithms and Complexity in Combinatorial OptimizationGamesXiaotie

- Mathematics
- 1997

We introduce an integer programming formulation for a class of combinatorial optimization games, which includes many interesting problems on graphs. We prove a simple (but very useful) theorem that…

Finding Nash equilibria in two-player, zero sum games

- Economics
- 2008

Current equilibrium-finding methods are presented and key areas for future work are identified and two algorithms are presented that computes standard Nash equilibria in two-player, zero-sum games.

Effectiveness of Game-Theoretic Strategies in Extensive-Form General-Sum Games

- Economics
- 2015

Game theory is a descriptive theory defining the conditions for the strategies of rational agents to form an equilibrium (a.k.a. the solution concepts). From the prescriptive viewpoint, game theory…

Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games

- Computer ScienceAAMAS
- 2008

This paper considers Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face, and presents an efficient exact algorithm for finding the optimal strategy for the leader to commit to in these games.

## References

SHOWING 1-10 OF 87 REFERENCES

Computing Equilibria of Two-Person Games from the Extensive Form

- Economics
- 1972

The Lemke-Howson algorithm for computing equilibria of finite 2-person non-cooperative games in normal form is modified to restrict the computations to the ordinarily small portion corresponding to…

On the Complexity of Some Two-Person Perfect-Information Games

- Computer ScienceJ. Comput. Syst. Sci.
- 1978

Theory of Games and Economic Behavior

- EconomicsNature
- 1946

THIS book is based on the theory that the economic man attempts to maximize his share of the world's goods and services in the same way that a participant in a game involving many players attempts to…

A Combinatorial Problem Which Is Complete in Polynomial Space

- MathematicsJACM
- 1976

It is shown that determining who wins such a game if each player plays perfectly is very hard; this result suggests that the theory of combinational games is difficult.

N by N Checkers is Exptime Complete

- Computer Science, MathematicsSIAM J. Comput.
- 1984

The question of whether a particular player can force a win from a given position and also the question of what is the best move in agiven position are considered.

Collective coin flipping, robust voting schemes and minima of Banzhaf values

- Computer Science26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
- 1985

It is quite remarkable that while dictatorial voting games are, of course, the most sensitive to the presence of unfair players, some voting schemes that are proposed here are significantly more robust than majority voting.

Theory of Games and Economic Behavior.

- Economics
- 1944

This is the classic work upon which modern-day game theory is based. What began more than sixty years ago as a modest proposal that a mathematician and an economist write a short paper together…

Probabilistic computations: Toward a unified measure of complexity

- Mathematics18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
- 1977

Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively.