IDEAS home Printed from https://ideas.repec.org/p/sce/scecf7/159.html
   My bibliography  Save this paper

Relaxation Algorithms in Finding Nash Equilibrium

Author

Listed:
  • Steffan Berridge
  • Jacek Krawczyk

    (Victoria University of Wellington)

Abstract

Relaxation algorithms provide a powerful method of finding noncooperative equilibria in general synchronous games. Through use of the Nikaido-Isoda function, the Nash solution to a broad category of constrained, multiplayer, non-zerosum games can easily be found. We provide solutions to some simple games using this procedure and extend ourselves to more difficult games involving coupled constraints and multiple discrete time periods using a program developed in Matlab.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Steffan Berridge & Jacek Krawczyk, "undated". "Relaxation Algorithms in Finding Nash Equilibrium," Computing in Economics and Finance 1997 159, Society for Computational Economics.
    • Handle: RePEc:sce:scecf7:159
    as

    Download full text from publisher

    File URL: http://bucky.stanford.edu/cef97/abstracts/berridge.html
    File Function: paper abstract
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Basar, Tamer, 1987. "Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria," Journal of Economic Dynamics and Control, Elsevier, vol. 11(4), pages 531-549, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Krawczyk, Jacek B., 2005. "Coupled constraint Nash equilibria in environmental games," Resource and Energy Economics, Elsevier, vol. 27(2), pages 157-181, June.
    2. Francesco Caruso & Maria Carmela Ceparano & Jacqueline Morgan, 2020. "Best response algorithms in ratio-bounded games: convergence of affine relaxations to Nash equilibria," CSEF Working Papers 593, Centre for Studies in Economics and Finance (CSEF), University of Naples, Italy.
    3. Anna Heusinger & Christian Kanzow, 2009. "Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions," Computational Optimization and Applications, Springer, vol. 43(3), pages 353-377, July.

    More about this item

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C87 - Mathematical and Quantitative Methods - - Data Collection and Data Estimation Methodology; Computer Programs - - - Econometric Software
    • E62 - Macroeconomics and Monetary Economics - - Macroeconomic Policy, Macroeconomic Aspects of Public Finance, and General Outlook - - - Fiscal Policy; Modern Monetary Theory
    • Q25 - Agricultural and Natural Resource Economics; Environmental and Ecological Economics - - Renewable Resources and Conservation - - - Water

    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:sce:scecf7:159. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.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.