IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v25y1977i4p541-562.html
   My bibliography  Save this article

Computation of Optimal Poker Strategies

Author

Listed:
  • Norman Zadeh

    (Berkeley, California)

Abstract

In this paper we discuss aspects of the solution of an eight-person draw poker game. Best strategies against perfect players (game-theoretic strategies) and against lesser players are presented. These strategies generally are functions of pot odds, the positions of relavant opponents, and their playing habits. For example, if player A opens with a pair of kings or better (his habit), player B should call with a minimum of aces when second from last to act (his position) and the pot equals twice the bet (pot odds are 2 to 1). Strategies of this type are given for opening, calling, and raising. We study the percentage of time one should raise as a bluff before the draw. A simple explanation is given for previously known results concerning optimal bluffing and calling after the draw.

Suggested Citation

  • Norman Zadeh, 1977. "Computation of Optimal Poker Strategies," Operations Research, INFORMS, vol. 25(4), pages 541-562, August.
  • Handle: RePEc:inm:oropre:v:25:y:1977:i:4:p:541-562
    DOI: 10.1287/opre.25.4.541
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.25.4.541
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.25.4.541?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:25:y:1977:i:4:p:541-562. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.