Relaxation Algorithms in Finding Nash Equilibria
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.
|Date of creation:||19 Jul 1997|
|Date of revision:|
|Note:||Type of Document - .zip (.tex .eps inside); prepared on UNIX LaTeX; to print on PostScript; pages: 28; figures: included .eps files. Presented at the 1997 Conference of the Society for Computational Economics, Stanford, California|
|Contact details of provider:|| Web page: http://126.96.36.199|
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwpco:9707002. 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: (EconWPA)
If references are entirely missing, you can add them using this form.