This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

A Decomposition Algorithm for N-Player Games

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Govindan, Srihari (U of Iowa)
Wilson, Robert B. (Stanford U)

Additional information is available for the following registered author(s):

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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

File URL: http://gsbapps.stanford.edu/researchpapers/library/RP1967.pdf
File Format:
File Function:
Download Restriction: no

Publisher Info
Paper provided by Stanford University, Graduate School of Business in its series Research Papers with number 1967.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Aug 2007
Date of revision:
Handle: RePEc:ecl:stabus:1967

Contact details of provider:
Postal: Stanford University, Stanford, CA 94305-5015
Phone: (650) 723-2146
Fax: (650)725-6750
Email:
Web page: http://gsbapps.stanford.edu/researchpapers/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords:

This paper has been announced in the following NEP Reports:

References listed on IDEAS
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.:
  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. [Downloadable!] (restricted)
  2. 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. [Downloadable!] (restricted)
  3. Rahul Savani & Bernhard Stengel, 2006. "Hard-to-Solve Bimatrix Games," Econometrica, Econometric Society, vol. 74(2), pages 397-429, 03. [Downloadable!] (restricted)
  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. [Downloadable!] (restricted)
Full references

Cited by:
(explanations, 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.)

  1. Govindand, Srihari & Wilson, Robert B., 2008. "Computing Equilibria of N-Player Games with Arbitrary Accuracy," Research Papers 1984, Stanford University, Graduate School of Business. [Downloadable!]
Statistics
Access and download statistics

Did you know? About 1000 journals are listed on RePEc.

This page was last updated on 2009-11-5.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.