Fast algorithms for finding randomized strategies in game trees

@inproceedings{Koller1994FastAF,
  title={Fast algorithms for finding randomized strategies in game trees},
  author={D. Koller and N. Megiddo and B. Stengel},
  booktitle={STOC '94},
  year={1994}
}
  • D. Koller, N. Megiddo, B. Stengel
  • Published in STOC '94 1994
  • Computer Science
  • 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… CONTINUE READING
    202 Citations
    Generating and Solving Imperfect Information Games
    • 49
    • PDF
    Computing Strong Game-Theoretic Strategies and Exploiting Suboptimal Opponents in Large Games
    • 1
    • PDF
    Finding equilibria in large sequential games of imperfect information
    • 48
    • PDF
    Finding equilibria in large sequential games of incomplete information ∗
    • 4
    • PDF
    Combinatorial optimization games
    • X. Deng
    • Computer Science
    • SODA '97
    • 1997
    • 25
    A Fast Bundle-based Anytime Algorithm for Poker and other Convex Games
    • 22
    • PDF

    References

    SHOWING 1-5 OF 5 REFERENCES
    Computing Equilibria of Two-Person Games from the Extensive Form
    • 47
    • Highly Influential
    JR 旅客販売総合システム(マルス)における運用及び管理について
    • 13,250
    • Highly Influential
    • PDF
    Finding small sample spaces satisfying given constraints
    • SIAM Journal on Discrete Mathematics
    • 1993
    Lp representation and e cient computation of behavior strategies
    • Technical Report S-9301,
    • 1993
     Uber eine Anwendung der Mengen- lehre auf die Theorie des Schachspiels
    • E. W. Hobson and A. E. H. Love, editors, Proceedings of the Fifth International Congress of Mathemati- cians II, pages 501{504. Cambridge University Press
    • 1913