Relexation algorithms in finding Nash equilibria

S. Berridge, J.B. Krawczyk

Research output: Book/ReportReport

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.
Original languageEnglish
Place of PublicationWellington
PublisherVictoria University of Wellington
Number of pages29
Publication statusPublished - 1970

Cite this