IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v49y2024i2p1091-1108.html
   My bibliography  Save this article

Zero-Sum Games and Linear Programming Duality

Author

Listed:
  • Bernhard von Stengel

    (Department of Mathematics, London School of Economics, London WC2A 2AE, United Kingdom)

Abstract

The minimax theorem for zero-sum games is easily proved from the strong duality theorem of linear programming. For the converse direction, the standard proof by Dantzig is known to be incomplete. We explain and combine classical theorems about solving linear equations with nonnegative variables to give a correct alternative proof more directly than Adler. We also extend Dantzig’s game so that any max-min strategy gives either an optimal LP solution or shows that none exists.

Suggested Citation

  • Bernhard von Stengel, 2024. "Zero-Sum Games and Linear Programming Duality," Mathematics of Operations Research, INFORMS, vol. 49(2), pages 1091-1108, May.
    • Handle: RePEc:inm:ormoor:v:49:y:2024:i:2:p:1091-1108
    DOI: 10.1287/moor.2022.0149
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0149
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.0149?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
    ---><---

    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:ormoor:v:49:y:2024:i:2:p:1091-1108. 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.