A Decomposition Algorithm for N-Player Games
AbstractAn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Stanford University, Graduate School of Business in its series Research Papers with number 1967.
Date of creation: Aug 2007
Date of revision:
Contact details of provider:
Postal: Stanford University, Stanford, CA 94305-5015
Phone: (650) 723-2146
Web page: http://gsbapps.stanford.edu/researchpapers/
More information through EDIRC
Other versions of this item:
- C63 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Computational Techniques
This paper has been announced in the following NEP Reports:
- NEP-ALL-2008-08-31 (All new papers)
- NEP-CMP-2008-08-31 (Computational Economics)
- NEP-GTH-2008-08-31 (Game Theory)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
- 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.
- B. Curtis Eaves, 1971. "The Linear Complementarity Problem," Management Science, INFORMS, vol. 17(9), pages 612-634, May.
- 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.
- Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, 03.
- Govindand, Srihari & Wilson, Robert B., 2008. "Computing Equilibria of N-Player Games with Arbitrary Accuracy," Research Papers 1984, Stanford University, Graduate School of Business.
- Bernhard Stengel, 2010. "Computation of Nash equilibria in finite games: introduction to the symposium," Economic Theory, Springer, vol. 42(1), pages 1-7, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.