IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v157y2013i2d10.1007_s10957-012-0165-8.html
   My bibliography  Save this article

An Alternating Direction Method for Nash Equilibrium of Two-Person Games with Alternating Offers

Author

Listed:
  • Zheng Peng

    (Fuzhou University)

  • Wenxing Zhu

    (Fuzhou University)

Abstract

In this paper, we propose a method for finding a Nash equilibrium of two-person games with alternating offers. The proposed method is referred to as the inexact proximal alternating direction method. In this method, the idea of alternating direction method simulates alternating offers in the game, while the inexact solutions of subproblems can be matched to the assumptions of incomplete information and bounded individual rationality in practice. The convergence of the proposed method is proved under some suitable conditions. Numerical tests show that the proposed method is competitive to the state-of-the-art algorithms.

Suggested Citation

  • Zheng Peng & Wenxing Zhu, 2013. "An Alternating Direction Method for Nash Equilibrium of Two-Person Games with Alternating Offers," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 533-551, May.
    • Handle: RePEc:spr:joptap:v:157:y:2013:i:2:d:10.1007_s10957-012-0165-8
    DOI: 10.1007/s10957-012-0165-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0165-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-012-0165-8?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.

    References listed on IDEAS

    as
    1. B. S. He & H. Yang & S. L. Wang, 2000. "Alternating Direction Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 106(2), pages 337-356, August.
    2. Orbay, Hakan, 2009. "Computing Cournot equilibrium through maximization over prices," Economics Letters, Elsevier, vol. 105(1), pages 71-73, October.
    3. Jianzhong Zhang & Biao Qu & Naihua Xiu, 2010. "Some projection-like methods for the generalized Nash equilibria," Computational Optimization and Applications, Springer, vol. 45(1), pages 89-109, January.
    4. Ray, Isha & Williams, Jeffrey, 2002. "Locational asymmetry and the potential for cooperation on a canal," Journal of Development Economics, Elsevier, vol. 67(1), pages 129-155, February.
    5. Diskin, Abraham & Felsenthal, Dan S., 2007. "Individual rationality and bargaining," LSE Research Online Documents on Economics 24233, London School of Economics and Political Science, LSE Library.
    6. Steffan Berridge & Jacek Krawczyk, "undated". "Relaxation Algorithms in Finding Nash Equilibrium," Computing in Economics and Finance 1997 159, Society for Computational Economics.
    7. Francisco Facchinei & Christian Kanzow, 2010. "Generalized Nash Equilibrium Problems," Annals of Operations Research, Springer, vol. 175(1), pages 177-211, March.
    8. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, December.
    9. G. De Marco & J. Morgan, 2008. "Slightly Altruistic Equilibria," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 347-362, May.
    10. Von Stengel, Bernhard, 2002. "Computing equilibria for two-person games," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 45, pages 1723-1759, Elsevier.
    11. Sergiu Hart, 1985. "Nonzero-Sum Two-Person Repeated Games with Incomplete Information," Mathematics of Operations Research, INFORMS, vol. 10(1), pages 117-153, February.
    12. Francisco Facchinei & Veronica Piccialli & Marco Sciandrone, 2011. "Decomposition algorithms for generalized potential games," Computational Optimization and Applications, Springer, vol. 50(2), pages 237-262, October.
    13. Abraham Diskin & Dan Felsenthal, 2007. "Individual rationality and bargaining," Public Choice, Springer, vol. 133(1), pages 25-29, October.
    14. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yu, Yuewen & Luo, Xia & Su, Qiming & Peng, Weikang, 2023. "A dynamic lane-changing decision and trajectory planning model of autonomous vehicles under mixed autonomous vehicle and human-driven vehicle environment," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).

    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. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    2. Francisco Facchinei & Jong-Shi Pang & Gesualdo Scutari, 2014. "Non-cooperative games with minmax objectives," Computational Optimization and Applications, Springer, vol. 59(1), pages 85-112, October.
    3. Sreekumaran, Harikrishnan & Hota, Ashish R. & Liu, Andrew L. & Uhan, Nelson A. & Sundaram, Shreyas, 2021. "Equilibrium strategies for multiple interdictors on a common network," European Journal of Operational Research, Elsevier, vol. 288(2), pages 523-538.
    4. Rodica Ioana Lung & Noémi Gaskó & Mihai Alexandru Suciu, 2020. "Pareto-based evolutionary multiobjective approaches and the generalized Nash equilibrium problem," Journal of Heuristics, Springer, vol. 26(4), pages 561-584, August.
    5. Giancarlo Bigi & Mauro Passacantando, 2016. "Gap functions for quasi-equilibria," Journal of Global Optimization, Springer, vol. 66(4), pages 791-810, December.
    6. Pishchulov, Grigory & Trautrims, Alexander & Chesney, Thomas & Gold, Stefan & Schwab, Leila, 2019. "The Voting Analytic Hierarchy Process revisited: A revised method with application to sustainable supplier selection," International Journal of Production Economics, Elsevier, vol. 211(C), pages 166-179.
    7. Nadja Harms & Tim Hoheisel & Christian Kanzow, 2015. "On a Smooth Dual Gap Function for a Class of Player Convex Generalized Nash Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 659-685, August.
    8. Migot, Tangi & Cojocaru, Monica-G., 2020. "A parametrized variational inequality approach to track the solution set of a generalized nash equilibrium problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 1136-1147.
    9. , & ,, 2013. "Implementation of communication equilibria by correlated cheap talk: The two-player case," Theoretical Economics, Econometric Society, vol. 8(1), January.
    10. Sonja Brangewitz & Gaël Giraud, 2012. "Learning by Trading in Infinite Horizon Strategic Market Games with Default," Documents de travail du Centre d'Economie de la Sorbonne 12062r, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Oct 2013.
    11. Yann BRAOUEZEC & Keyvan KIANI, 2021. "Economic foundations of generalized games with shared constraint: Do binding agreements lead to less Nash equilibria?," Working Papers 2021-ACF-06, IESEG School of Management.
    12. Yiyin Cao & Chuangyin Dang & Yabin Sun, 2022. "Complementarity Enhanced Nash’s Mappings and Differentiable Homotopy Methods to Select Perfect Equilibria," Journal of Optimization Theory and Applications, Springer, vol. 192(2), pages 533-563, February.
    13. Simone Sagratella, 2017. "Computing equilibria of Cournot oligopoly models with mixed-integer quantities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 549-565, December.
    14. Jiawang Nie & Xindong Tang & Lingling Xu, 2021. "The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials," Computational Optimization and Applications, Springer, vol. 78(2), pages 529-557, March.
    15. Reinoud Joosten, 2007. "Strategic Advertisement with Externalities: A New Dynamic Approach," Papers on Economics and Evolution 2007-02, Philipps University Marburg, Department of Geography.
    16. Etessami, Kousha, 2021. "The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game," Games and Economic Behavior, Elsevier, vol. 125(C), pages 107-140.
    17. Braouezec, Yann & Kiani, Keyvan, 2023. "Economic foundations of generalized games with shared constraint: Do binding agreements lead to less Nash equilibria?," European Journal of Operational Research, Elsevier, vol. 308(1), pages 467-479.
    18. Axel Dreves & Simone Sagratella, 2020. "Nonsingularity and Stationarity Results for Quasi-Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 185(3), pages 711-743, June.
    19. Axel Dreves, 2017. "Computing all solutions of linear generalized Nash equilibrium problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(2), pages 207-221, April.
    20. Simone Sagratella, 2017. "Algorithms for generalized potential games with mixed-integer variables," Computational Optimization and Applications, Springer, vol. 68(3), pages 689-717, December.

    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:spr:joptap:v:157:y:2013:i:2:d:10.1007_s10957-012-0165-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.