Relaxation Algorithms in finding Nash Equilibria

Authors

  • Steffan Berridge
  • Jacek Krawczyk

Keywords:

C63 (Computational Techniques), C72 (Noncooperative Games), C87 (Economic Soft-ware), E62 (Taxation), Q25 (Water, Air), 90-08 (Computational Methods), 90Al4 (Equilibrium:general theory), 90A30 (Environ-mental economics), 90A56 (Specialty pesof equilibria), 90A58 (Models of real-world systems), 90A70 (Macroeconomic policy-making taxation), 90D05 (2-person games), 90D06 (n-person games), 90Dl0 (Noncooperative games), 90D50 (Discrete-time games), 90D80 (Applications of game theory) Cmnputational economics, Nash normalised equilibrium, coupled constraints, Nikaido-Isoda function, open-loop Nashequilibrium

Abstract

Relaxation algorithms provide a powerful method of finding non-cooperative 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 dif-ficult games involving coupled constraints and multiple discrete time periods using a program developed in Matlab.

Downloads

Download data is not yet available.

Downloads

Published

1997-01-01

How to Cite

Berridge, S., & Krawczyk, J. (1997). Relaxation Algorithms in finding Nash Equilibria. School of Management Working Papers, 1–35. Retrieved from https://ojs.victoria.ac.nz/somwp/article/view/7235

Issue

1997: School of Management Working Paper Series

Section

Articles