IDEAS home Printed from https://ideas.repec.org/p/ecl/stabus/1967.html
   My bibliography  Save this paper

A Decomposition Algorithm for N-Player Games

Author

Listed:
  • Govindan, Srihari

    (U of Iowa)

  • Wilson, Robert B.

    (Stanford U)

Abstract

An N-player game can be approximated by adding a coordinator who interacts bilaterally with each player. The coordinator proposes strategies to the players, and his payoff is maximized when each player's optimal reply agrees with his proposal. When the feasible set of proposals is finite, a solution of an associated linear complementarity problem yields an approximate equilibrium of the original game. Computational efficiency is improved by using the vertices of Kuhn's triangulation of the players' strategy space for the coordinator's pure strategies. Computational experience is reported.

Suggested Citation

  • Govindan, Srihari & Wilson, Robert B., 2007. "A Decomposition Algorithm for N-Player Games," Research Papers 1967, Stanford University, Graduate School of Business.
    • Handle: RePEc:ecl:stabus:1967
    as

    Download full text from publisher

    File URL: http://gsbapps.stanford.edu/researchpapers/library/RP1967.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    2. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, March.
    3. B. Curtis Eaves, 1971. "The Linear Complementarity Problem," Management Science, INFORMS, vol. 17(9), pages 612-634, May.
    4. Govindan, Srihari & Wilson, Robert, 2003. "A global Newton method to compute Nash equilibria," Journal of Economic Theory, Elsevier, vol. 110(1), pages 65-86, May.
    5. Govindan, Srihari & Wilson, Robert, 2004. "Computing Nash equilibria by iterated polymatrix approximation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1229-1241, April.
    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. Yiyin Cao & Yin Chen & Chuangyin Dang, 2024. "A Differentiable Path-Following Method with a Compact Formulation to Compute Proper Equilibria," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 377-396, March.
    2. Govindand, Srihari & Wilson, Robert B., 2008. "Computing Equilibria of N-Player Games with Arbitrary Accuracy," Research Papers 1984, Stanford University, Graduate School of Business.
    3. Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 1-7, January.
    4. Iryna Topolyan, 2013. "Existence of perfect equilibria: a direct proof," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(3), pages 697-705, August.
    5. Dang, Chuangyin & Meng, Xiaoxuan & Talman, Dolf, 2015. "An Interior-Point Path-Following Method for Computing a Perfect Stationary Point of a Polynomial Mapping on a Polytope," Discussion Paper 2015-019, Tilburg University, Center for Economic Research.
    6. 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.
    7. Cao, Yiyin & Dang, Chuangyin & Xiao, Zhongdong, 2022. "A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1032-1050.
    8. Cao, Yiyin & Dang, Chuangyin, 2022. "A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games," Games and Economic Behavior, Elsevier, vol. 134(C), pages 127-150.

    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. Rahul Savani & Bernhard Stengel, 2015. "Game Theory Explorer: software for the applied game theorist," Computational Management Science, Springer, vol. 12(1), pages 5-33, January.
    2. 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.
    3. Bharat Adsul & Jugal Garg & Ruta Mehta & Milind Sohoni & Bernhard von Stengel, 2021. "Fast Algorithms for Rank-1 Bimatrix Games," Operations Research, INFORMS, vol. 69(2), pages 613-631, March.
    4. Yin Chen & Chuangyin Dang, 2019. "A Reformulation-Based Simplicial Homotopy Method for Approximating Perfect Equilibria," Computational Economics, Springer;Society for Computational Economics, vol. 54(3), pages 877-891, October.
    5. Cao, Yiyin & Dang, Chuangyin, 2022. "A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games," Games and Economic Behavior, Elsevier, vol. 134(C), pages 127-150.
    6. P. Giovani Palafox-Alcantar & Dexter V. L. Hunt & Chris D. F. Rogers, 2020. "A Hybrid Methodology to Study Stakeholder Cooperation in Circular Economy Waste Management of Cities," Energies, MDPI, vol. 13(7), pages 1-30, April.
    7. Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
    8. Rahul Savani & Bernhard von Stengel, 2016. "Unit vector games," International Journal of Economic Theory, The International Society for Economic Theory, vol. 12(1), pages 7-27, March.
    9. Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 185-201, June.
    10. Sam Ganzfried, 2020. "Fast Complete Algorithm for Multiplayer Nash Equilibrium," Papers 2002.04734, arXiv.org, revised Jan 2023.
    11. Hausken, Kjell, 2008. "Strategic defense and attack for reliability systems," Reliability Engineering and System Safety, Elsevier, vol. 93(11), pages 1740-1750.
    12. Doraszelski, Ulrich & Satterthwaite, Mark, 2007. "Computable Markov-Perfect Industry Dynamics: Existence, Purification, and Multiplicity," CEPR Discussion Papers 6212, C.E.P.R. Discussion Papers.
    13. Ulrich Doraszelski & Mark Satterthwaite, 2007. "Computable Markov-Perfect Industry Dynamics: Existence, Purification, and Multiplicity," Levine's Bibliography 321307000000000912, UCLA Department of Economics.
    14. Govindand, Srihari & Wilson, Robert B., 2008. "Computing Equilibria of N-Player Games with Arbitrary Accuracy," Research Papers 1984, Stanford University, Graduate School of Business.
    15. Qilong Liu & Qingshui Liao, 2023. "Computing Nash Equilibria for Multiplayer Symmetric Games Based on Tensor Form," Mathematics, MDPI, vol. 11(10), pages 1-17, May.
    16. P. Herings & Ronald Peeters, 2010. "Homotopy methods to compute equilibria in game theory," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 119-156, January.
    17. Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 1-7, January.
    18. Jiang, Albert Xin & Leyton-Brown, Kevin & Bhat, Navin A.R., 2011. "Action-Graph Games," Games and Economic Behavior, Elsevier, vol. 71(1), pages 141-173, January.
    19. Cao, Yiyin & Dang, Chuangyin & Xiao, Zhongdong, 2022. "A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications," European Journal of Operational Research, Elsevier, vol. 298(3), pages 1032-1050.
    20. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.

    More about this item

    JEL classification:

    • C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:ecl:stabus:1967. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/gsstaus.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.