Relaxation Algorithms in Finding Nash Equilibria

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

MoreLess

Year of publication:	1999
Authors:	Berridge, Steffan ; Krawczyk, Jacek B.
Publisher:	[S.l.] : SSRN
Subject:	Nash-Gleichgewicht \| Nash equilibrium \| Algorithmus \| Algorithm \| Spieltheorie \| Game theory \| Mathematische Optimierung \| Mathematical programming \| Computerunterstützung \| Computerized method

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (29 p)
Type of publication:	Book / Working Paper
Language:	English
Other identifiers:	10.2139/ssrn.66448 [DOI]
Classification:	C63 - Computational Techniques ; C72 - Noncooperative Games ; C87 - Econometric Software ; E62 - Fiscal Policy; Public Expenditures, Investment, and Finance; Taxation ; Q25 - Water
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014066996