IDEAS home Printed from https://ideas.repec.org/a/taf/apeclt/v30y2023i12p1656-1660.html
   My bibliography  Save this article

Search for a unique Nash equilibrium in two public goods games: mixed integer programming technique

Author

Listed:
  • Kenichi Suzuki
  • Tatsuyoshi Miyakoshi
  • Jun-ichi Itaya
  • Akitomo Yamanashi

Abstract

We provide the methods for searching for the unique Nash equilibrium using mixed integer programming techniques. We also simulate the model parameters using this technique and derive the numerical solution to show the characteristics of a key player providing both public goods as suggested by Bergstrom et al. (1986). We present two key results. First, when the number of players decreases, the appearance rate of the unique equilibrium accompanying a key player increases. Second, when the variance of the preference or price parameters decreases, the appearance rate of the unique equilibrium accompanying a key player increases.

Suggested Citation

  • Kenichi Suzuki & Tatsuyoshi Miyakoshi & Jun-ichi Itaya & Akitomo Yamanashi, 2023. "Search for a unique Nash equilibrium in two public goods games: mixed integer programming technique," Applied Economics Letters, Taylor & Francis Journals, vol. 30(12), pages 1656-1660, July.
  • Handle: RePEc:taf:apeclt:v:30:y:2023:i:12:p:1656-1660
    DOI: 10.1080/13504851.2022.2075822
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13504851.2022.2075822
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/13504851.2022.2075822?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:apeclt:v:30:y:2023:i:12:p:1656-1660. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RAEL20 .

    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.