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.
|Place of Publication||Wellington|
|Publisher||Victoria University of Wellington|
|Number of pages||29|
|Publication status||Published - 1970|