scholarly journals Pareto Optimality and Equilibria in Noncooperative Games

2020 ◽  
Author(s):  
Vladislav Zhukovskiy ◽  
Konstantin Kudryavtsev
Keyword(s):  
Nash Equilibrium ◽  
Pareto Optimality ◽  
Pure Strategy ◽  
Sufficient Conditions ◽  
Noncooperative Games ◽  
Equilibrium Strategy ◽  
Pareto Optimal ◽  
Mixed Strategies ◽  
Nash Equilibrium Strategy ◽  
Payoff Functions

This chapter considers the Nash equilibrium strategy profiles that are Pareto optimal with respect to the rest of the Nash equilibrium strategy profiles. The sufficient conditions for the existence of such pure strategy profiles are established. These conditions employ the Germeier convolutions of the payoff functions. For the noncooperative games with compact strategy sets and continuous payoff functions, the existence of the Pareto-optimal Nash equilibria (PoNE) in mixed strategies is proven.

A New Approach to Noncooperative Games Under Uncertainty

2018 ◽  
Vol 20 (01) ◽  
pp. 1750024
Author(s):  
Vladislav Iosifovich Zhukovskiy ◽  
Tatiana Vladimirovna Makarkina ◽  
Maria Ivanovna Vysokos
Keyword(s):  
Nash Equilibrium ◽  
Risk Taking ◽  
Noncooperative Games ◽  
Admissible Set ◽  
Mixed Strategies ◽  
Compact Sets ◽  
New Approach ◽  
Payoff Functions

The novelty of the approach presented in this paper is that each player of a conflict seeks not only to increase his payoff, but also to reduce his risk, taking into account a possible realization of any uncertainty from a given admissible set. A new concept, the so-called strongly guaranteed Nash equilibrium in payoffs and risks, is introduced and its existence in mixed strategies is proved under standard constraints for noncooperative games, i.e., compact sets of players’ strategies and continuous payoff functions.

Some Sufficiency Conditions for Pareto-Optimal Control

1973 ◽  
Vol 95 (4) ◽  
pp. 356-361 ◽  
Author(s):  
G. Leitmann ◽  
W. Schmitendorf
Keyword(s):  
Optimal Control ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Pareto Optimality ◽  
Optimal Control Theory ◽  
Cooperative Games ◽  
Sufficient Conditions ◽  
Pareto Optimal ◽  
Vector Valued ◽  
Sufficiency Conditions

We consider the optimal control problem with vector-valued criterion (including cooperative games) and seek Pareto-optimal (noninferior) solutions. Scalarization results, together with modified sufficiency theorems from optimal control theory, are used to deduce sufficient conditions for Pareto-optimality. The utilization of these conditions is illustrated by various examples.

scholarly journals Spatial correlated games

2017 ◽  
Vol 4 (11) ◽  
pp. 171361 ◽  
Author(s):  
Ramón Alonso-Sanz
Keyword(s):  
Nash Equilibrium ◽  
Equilibrium Strategy ◽  
Variable Degree ◽  
Two Dimensional ◽  
Dimensional Lattice ◽  
Nash Equilibrium Strategy ◽  
Link Type

This article studies correlated two-person games constructed from games with independent players as proposed in Iqbal et al. (2016 R. Soc. open sci. 3 , 150477. ( doi:10.1098/rsos.150477 )). The games are played in a collective manner, both in a two-dimensional lattice where the players interact with their neighbours, and with players interacting at random. Four game types are scrutinized in iterated games where the players are allowed to change their strategies, adopting that of their best paid mate neighbour. Particular attention is paid in the study to the effect of a variable degree of correlation on Nash equilibrium strategy pairs.

scholarly journals Non-Cooperative Spectrum Access Strategy Based on Impatient Behavior of Secondary Users in Cognitive Radio Networks

Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 995 ◽  
Author(s):  
Zeng ◽  
Liu ◽  
Wang ◽  
Lan
Keyword(s):  
Cognitive Radio ◽  
Nash Equilibrium ◽  
Learning Ability ◽  
Equilibrium Strategy ◽  
Spectrum Access ◽  
Secondary Users ◽  
Nash Equilibrium Strategy ◽  
Pricing Scheme ◽  
The Social ◽  
Limited Spectrum

In the cognitive radio network (CRN), secondary users (SUs) compete for limited spectrum resources, so the spectrum access process of SUs can be regarded as a non-cooperative game. With enough artificial intelligence (AI), SUs can adopt certain spectrum access strategies through their learning ability, so as to improve their own benefit. Taking into account the impatience of the SUs with the waiting time to access the spectrum and the fact that the primary users (PUs) have preemptive priority to use the licensed spectrum in the CRN, this paper proposed the repairable queueing model with balking and reneging to investigate the spectrum access. Based on the utility function from an economic perspective, the relationship between the Nash equilibrium and the socially optimal spectrum access strategy of SUs was studied through the analysis of the system model. Then a reasonable spectrum pricing scheme was proposed to maximize the social benefits. Simulation results show that the proposed access mechanism can realize the consistency of Nash equilibrium strategy and social optimal strategy to maximize the benefits of the whole cognitive system.

On the Foundations of Nash Equilibrium

1996 ◽  
Vol 12 (1) ◽  
pp. 67-88 ◽  
Author(s):  
Hans Jørgen Jacobsen
Keyword(s):  
Game Theory ◽  
Nash Equilibrium ◽  
Cooperative Game Theory ◽  
Mixed Strategy ◽  
Pure Strategy ◽  
Mixed Strategies ◽  
Positive Theory ◽  
Equilibrium Concept ◽  
Strategy Equilibrium ◽  
Pure Strategies

The most important analytical tool in non-cooperative game theory is the concept of a Nash equilibrium, which is a collection of possibly mixed strategies, one for each player, with the property that each player's strategy is a best reply to the strategies of the other players. If we do not go into normative game theory, which concerns itself with the recommendation of strategies, and focus instead entirely on the positive theory of prediction, two alternative interpretations of the Nash equilibrium concept are predominantly available.In the more traditional one, a Nash equilibrium is a prediction of actual play. A game may not have a Nash equilibrium in pure strategies, and a mixed strategy equilibrium may be difficult to incorporate into this interpretation if it involves the idea of actual randomization over equally good pure strategies. In another interpretation originating from Harsanyi (1973a), see also Rubinstein (1991), and Aumann and Brandenburger (1991), a Nash equilibrium is a ‘consistent’ collection of probabilistic expectations, conjectures, on the players. It is consistent in the sense that for each player each pure strategy, which has positive probability according to the conjecture about that player, is indeed a best reply to the conjectures about others.

Sign in / Sign up

Export Citation Format

Share Document