Relexation algorithms in finding Nash equilibria

S. Berridge, J.B. Krawczyk

Research output: Book/ReportReportProfessional

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

Fingerprint

Nash equilibrium
Nash solution
Discrete-time
Simple game

Cite this

Berridge, S., & Krawczyk, J. B. (1970). Relexation algorithms in finding Nash equilibria. Wellington: Victoria University of Wellington.
Berridge, S. ; Krawczyk, J.B. / Relexation algorithms in finding Nash equilibria. Wellington : Victoria University of Wellington, 1970. 29 p.
@book{0c9d637273f4440cb48cf4d178e9651d,
title = "Relexation 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.",
author = "S. Berridge and J.B. Krawczyk",
note = "Pagination: 29",
year = "1970",
language = "English",
publisher = "Victoria University of Wellington",

}

Berridge, S & Krawczyk, JB 1970, Relexation algorithms in finding Nash equilibria. Victoria University of Wellington, Wellington.

Relexation algorithms in finding Nash equilibria. / Berridge, S.; Krawczyk, J.B.

Wellington : Victoria University of Wellington, 1970. 29 p.

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Relexation algorithms in finding Nash equilibria

AU - Berridge, S.

AU - Krawczyk, J.B.

N1 - Pagination: 29

PY - 1970

Y1 - 1970

N2 - 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.

AB - 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.

M3 - Report

BT - Relexation algorithms in finding Nash equilibria

PB - Victoria University of Wellington

CY - Wellington

ER -

Berridge S, Krawczyk JB. Relexation algorithms in finding Nash equilibria. Wellington: Victoria University of Wellington, 1970. 29 p.