Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games

The Pareto-Nash equilibrium set (PNES) is described as intersection of graphs of efficient response mappings. The problem of PNES computing in finite multi-objective mixed-strategy games (Pareto-Nash games) is considered. A method for PNES computing is studied. Mathematics Subject Classification...

Full description

Bibliographic Details
Main Authors: Victoria Lozan, Valeriu Ungureanu
Format: Article
Language:English
Published: Vladimir Andrunachievici Institute of Mathematics and Computer Science 2013-10-01
Series:Computer Science Journal of Moldova
Subjects:
Online Access:http://www.math.md/files/csjm/v21-n2/v21-n2-(pp174-203).pdf
_version_ 1798003667631079424
author Victoria Lozan
Valeriu Ungureanu
author_facet Victoria Lozan
Valeriu Ungureanu
author_sort Victoria Lozan
collection DOAJ
description The Pareto-Nash equilibrium set (PNES) is described as intersection of graphs of efficient response mappings. The problem of PNES computing in finite multi-objective mixed-strategy games (Pareto-Nash games) is considered. A method for PNES computing is studied. Mathematics Subject Classification 2010: 91A05, 91A06, 91A10, 91A43, 91A44.
first_indexed 2024-04-11T12:11:26Z
format Article
id doaj.art-2cc0cb4bae8842099b72c7f4f708d956
institution Directory Open Access Journal
issn 1561-4042
language English
last_indexed 2024-04-11T12:11:26Z
publishDate 2013-10-01
publisher Vladimir Andrunachievici Institute of Mathematics and Computer Science
record_format Article
series Computer Science Journal of Moldova
spelling doaj.art-2cc0cb4bae8842099b72c7f4f708d9562022-12-22T04:24:36ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422013-10-01212(62)174203Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy gamesVictoria Lozan0Valeriu Ungureanu1State University of Moldova, A. Mateevici str., 60, Chisinau, MD-2009, Republic of MoldovaState University of Moldova, A. Mateevici str., 60, Chisinau, MD-2009, Republic of MoldovaThe Pareto-Nash equilibrium set (PNES) is described as intersection of graphs of efficient response mappings. The problem of PNES computing in finite multi-objective mixed-strategy games (Pareto-Nash games) is considered. A method for PNES computing is studied. Mathematics Subject Classification 2010: 91A05, 91A06, 91A10, 91A43, 91A44.http://www.math.md/files/csjm/v21-n2/v21-n2-(pp174-203).pdfNoncooperative gamefinite mixed-strategy gamemulti-objective gamegraph of best response mappingintersectionPareto-Nash equilibriumset of Pareto-Nash equilibria
spellingShingle Victoria Lozan
Valeriu Ungureanu
Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
Computer Science Journal of Moldova
Noncooperative game
finite mixed-strategy game
multi-objective game
graph of best response mapping
intersection
Pareto-Nash equilibrium
set of Pareto-Nash equilibria
title Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
title_full Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
title_fullStr Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
title_full_unstemmed Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
title_short Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
title_sort computing the pareto nash equilibrium set in finite multi objective mixed strategy games
topic Noncooperative game
finite mixed-strategy game
multi-objective game
graph of best response mapping
intersection
Pareto-Nash equilibrium
set of Pareto-Nash equilibria
url http://www.math.md/files/csjm/v21-n2/v21-n2-(pp174-203).pdf
work_keys_str_mv AT victorialozan computingtheparetonashequilibriumsetinfinitemultiobjectivemixedstrategygames
AT valeriuungureanu computingtheparetonashequilibriumsetinfinitemultiobjectivemixedstrategygames