Computing Equilibria of Two-Person Games from the Extensive Form
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 the strategies actually used by the players, and further it is shown that in games with perfect recall these strategies can be generated as needed from an auxiliary analysis of the players' decision trees derived from the extensive form of the game.
Volume (Year): 18 (1972)
Issue (Month): 7 (March)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:18:y:1972:i:7:p:448-460. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.