Computing Equilibria of N-Player Games with Arbitrary Accuracy
AbstractFrom a variant of Kuhn's triangulation we derive a discrete version of the Global Newton Method that yields an epsilon-equilibrium of an N-player game and then sequentially reduces epsilon toward zero to obtain any desired precision or the best precision for any number of iterations.
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 1984.
Date of creation: Feb 2008
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
This paper has been announced in the following NEP Reports:
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.
- Talman, A.J.J. & Laan , G. van der, 1980. "A new subdivision for computing fixed points with a homotopy algorithm," Open Access publications from Tilburg University urn:nbn:nl:ui:12-153017, Tilburg University.
- 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.
- Govindan, Srihari & Wilson, Robert B., 2007.
"A Decomposition Algorithm for N-Player Games,"
1967, Stanford University, Graduate School of Business.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.