Relaxation Algorithms in Finding Nash Equilibria

Abstract

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 34 citations exist upstream.