Relaxation Algorithms in Finding Nash Equilibrium
Relaxation algorithms provide a powerful method of finding noncooperative equilibria in general synchronous games. Through use of the Nikaido-Isoda function, the Nash solution to a broad category of constrained, multiplayer, non-zerosum games can easily be found. We provide solutions to some simple games using this procedure and extend ourselves to more difficult games involving coupled constraints and multiple discrete time periods using a program developed in Matlab.
(This abstract was borrowed from another version of this item.)
|Date of creation:|
|Date of revision:|
|Contact details of provider:|| Postal: CEF97, Stanford University, Department of Economics, Stanford CA USA|
Web page: http://bucky.stanford.edu/cef97/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf7:159. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.