Computing the Pareto-Nash equilibrium set infinite multi-objective mixed-strategy games
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
930 2
Ultima descărcare din IBN:
2018-06-22 22:04
Căutarea după subiecte
similare conform CZU
519.72+519.8 (3)
Cibernetică matematică (93)
Cercetări operaționale (OR) teorii şi metode matematice (168)
SM ISO690:2012
LOZAN, Victoria, UNGUREANU, Valeriu. Computing the Pareto-Nash equilibrium set infinite multi-objective mixed-strategy games. In: Computer Science Journal of Moldova, 2013, nr. 2(62), pp. 174-203. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 2(62) / 2013 / ISSN 1561-4042 /ISSNe 2587-4330

Computing the Pareto-Nash equilibrium set infinite multi-objective mixed-strategy games
CZU: 519.72+519.8
MSC 2010: 91A05, 91A06, 91A10, 91A43, 91A44

Pag. 174-203

Lozan Victoria, Ungureanu Valeriu
 
Moldova State University
 
 
Disponibil în IBN: 6 decembrie 2013


Rezumat

The Pareto-Nash equilibrium set (PNES) is described as in- tersection of graphs of e±cient response mappings. The prob- lem of PNES computing infinite multi-objective mixed-strategy games (Pareto-Nash games) is considered. A method for PNES computing is studied.

Cuvinte-cheie
Noncooperative game, finite mixed-strategy game, multi-objective game