| Articolul precedent |
| Articolul urmator |
 |
 307 0 |
 SM ISO690:2012UNGUREANU, Valeriu. Computing Pareto–Nash Equilibrium Sets in Finite Multi-Objective Mixed-Strategy Games. In: Smart Innovation, Systems and Technologies, 1 martie 2018, Berlin. Berlin, Germania: Springer Science and Business Media Deutschland GmbH, 2018, Vol.89, pp. 217-244. ISSN 21903018. DOI: https://doi.org/10.1007/978-3-319-75151-1_10 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Smart Innovation, Systems and Technologies Vol.89, 2018 |
||||||
|
Sesiunea "Smart Innovation, Systems and Technologies" Berlin, Germania, 1 martie 2018 | ||||||
|
||||||
| DOI:https://doi.org/10.1007/978-3-319-75151-1_10 | ||||||
| Pag. 217-244 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
The problem of a Pareto–Nash equilibrium set computing in finite multi-objective mixed-strategy games (Pareto–Nash games) is considered in this chapter. A method for a Pareto–Nash equilibrium set computing is exposed. The method is based on the fact that the set of Pareto–Nash equilibria is identified with the intersection of the graphs of efficient response mappings. |
||||||
| Cuvinte-cheie Mixed strategy game, Multi objective, Nash equilibria, Nash games |
||||||
|
|
|
|
