Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
Authors: Victoria Lozan, Valeriu Ungureanu
Keywords: Noncooperative game, finite mixed-strategy game, multi-objective game, graph of best response mapping, intersection, Pareto-Nash equilibrium, set of Pareto-Nash equilibria.
– 0.23 Mb
Keywords: Noncooperative game, finite mixed-strategy game, multi-objective game, graph of best response mapping, intersection, Pareto-Nash equilibrium, set of Pareto-Nash equilibria.
Abstract
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.State University of Moldova
A. Mateevici str., 60, Chişinău,
MD-2009, Republic of Moldova
E-mail: ,
A. Mateevici str., 60, Chişinău,
MD-2009, Republic of Moldova
E-mail: ,
Fulltext
– 0.23 Mb
Contents
- Tutte Polynomial of Multi-Bridge Graphs
- Computing the Pareto-Nash equilibrium set in finite multi-objective mixed-strategy games
- Design and code coupling assessment based on defects prediction. Part 1
- Complex Time for Chaoplex Systems: From Newton to Wiener
- Intelligent Self-Organized Robust Control Design based on Quantum/Soft Computing Technologies and Kansei Engineering
- Cryptoschemes Based on Difficulty of Simultaneous Solving Two Different Difficult Problems*
- About CMC14
