Pareto–Nash Equilibria in Bicriterial Dyadic Games with Mixed Strategies

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Consider a dyadic two-criteria Pareto–Nash game in mixed strategies. Player 1 (blue graph) has two payoff matrices and . Player 2 (green graph) also has two payoff matrices, and . The set of Pareto–Nash equilibria (red) is determined as the intersection of the graphs of Pareto response mapping of the players.

Contributed by: Victoria Lozan and Valeriu Ungureanu (October 2011)
Open content licensed under CC BY-NC-SA




[1] V. Lozan and V. Ungureanu, "Sets of Pareto–Nash–Stackelberg Equilibria in Strategic Games," in ISCOPAM 2010, Romania: Alexandru Ioan Cuza University, 2011 pp. 113–124.

[2] V. Ungureanu and V. Lozan, "Pareto–Nash Equilibrium Principles," Studia Univeritatis, 27, 2009 pp. 52–56.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.