Nash equilibria set computing in finite extended games

he Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied. Mathematics Subject Classification 2000:91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 9...

Full description

Bibliographic Details
Main Author:	Valeriu Ungureanu
Format:	Article
Language:	English
Published:	Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2006-12-01
Series:	Computer Science Journal of Moldova
Subjects:	Noncooperative game normal form game Nash equilibrium (NE) Nash equilibria set (NES) graph of best response mapping intersection method algorithm computational complexity
Online Access:	http://www.math.md/files/csjm/v14-n3/v14-n3-(pp345-365).pdf

id	doaj-b26f8d6e08034dc2944503890cd196ea
record_format	Article
spelling	doaj-b26f8d6e08034dc2944503890cd196ea2020-11-24T22:45:13ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422006-12-01143(42)345365Nash equilibria set computing in finite extended gamesValeriu Ungureanu0State University of Moldova, 60, A. Mateevici str., Chisinau, MD-2009, Moldovahe Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied. Mathematics Subject Classification 2000:91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90.http://www.math.md/files/csjm/v14-n3/v14-n3-(pp345-365).pdfNoncooperative gamenormal form gameNash equilibrium (NE)Nash equilibria set (NES)graph of best response mappingintersectionmethodalgorithmcomputational complexity
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Valeriu Ungureanu
spellingShingle	Valeriu Ungureanu Nash equilibria set computing in finite extended games Computer Science Journal of Moldova Noncooperative game normal form game Nash equilibrium (NE) Nash equilibria set (NES) graph of best response mapping intersection method algorithm computational complexity
author_facet	Valeriu Ungureanu
author_sort	Valeriu Ungureanu
title	Nash equilibria set computing in finite extended games
title_short	Nash equilibria set computing in finite extended games
title_full	Nash equilibria set computing in finite extended games
title_fullStr	Nash equilibria set computing in finite extended games
title_full_unstemmed	Nash equilibria set computing in finite extended games
title_sort	nash equilibria set computing in finite extended games
publisher	Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
series	Computer Science Journal of Moldova
issn	1561-4042
publishDate	2006-12-01
description	he Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied. Mathematics Subject Classification 2000:91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90.
topic	Noncooperative game normal form game Nash equilibrium (NE) Nash equilibria set (NES) graph of best response mapping intersection method algorithm computational complexity
url	http://www.math.md/files/csjm/v14-n3/v14-n3-(pp345-365).pdf
work_keys_str_mv	AT valeriuungureanu nashequilibriasetcomputinginfiniteextendedgames
_version_	1725689533973921792

Nash equilibria set computing in finite extended games

Similar Items