IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2602.18380.html

The Complexity of Sparse Win-Lose Bimatrix Games

Author

Listed:
  • Eleni Batziou
  • John Fearnley
  • Abheek Ghosh
  • Rahul Savani

Abstract

We prove that computing an $\epsilon$-approximate Nash equilibrium of a win-lose bimatrix game with constant sparsity is PPAD-hard for inverse-polynomial $\epsilon$. Our result holds for 3-sparse games, which is tight given that 2-sparse win-lose bimatrix games can be solved in polynomial time.

Suggested Citation

  • Eleni Batziou & John Fearnley & Abheek Ghosh & Rahul Savani, 2026. "The Complexity of Sparse Win-Lose Bimatrix Games," Papers 2602.18380, arXiv.org.
    • Handle: RePEc:arx:papers:2602.18380
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2602.18380
    File Function: Latest version
    Download Restriction: no
    ---><---

    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:arx:papers:2602.18380. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.