Geodesic
Decomposition algorithm of searching equilibria in the dynamical game
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 3 (2011) no. 4, pp. 49-88

Voir la notice de l'article provenant de la source Math-Net.Ru

A problem of noncooperative game with several players is considered, in which the players (governments of neighboring countries) make emission reduction trading. Particular attention is paid to the case of two players, one of whom is Eastern European countries, while another is countries of the former Soviet Union. A statistical analysis of the model parameters for quadratic cost functions and logarithmic benefit functions, based on the real data, is performed. The concepts of non-cooperative Nash equilibrium and cooperative Pareto maxima are introduced and linked with each other. The definition of a new concept – the market equilibrium, which combines properties of Nash and Pareto equilibria, is given. An analytic solution to the problem of finding market equilibrium is represented. This analytical solution can serve as a test for verification of numerical search algorithms. A computational algorithm of searching for market equilibrium is proposed, which shifts Nash competitive equilibrium to Pareto cooperative maximum. An algorithm is interpreted in the form of a repeated auction, in which the auctioneer has no information about cost functions and functions of environmental effect from emission reduction for the participating countries. An auctioneer strategy, which provides conditions for reaching market equilibrium, is considered. From the viewpoint of game theory, repeated auction describes the learning process in a noncooperative repeated game under uncertainty. The results of proposed computational algorithms are compared to analytical solutions. Numerical calculations of equilibrium and algorithm trajectories, converging to the equilibrium, are given.
Keywords: dynamic games, Nash equilibrium, equilibrium search algorithms, auctions modeling.
Mots-clés : Pareto maximum 
@article{MGTA_2011_3_4_a2,
     author = {Nikolay A. Krasovskiy and Alexander M. Tarasyev},
     title = {Decomposition algorithm of searching equilibria in the dynamical game},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {49--88},
     publisher = {mathdoc},
     volume = {3},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a2/}
}
TY  - JOUR
AU  - Nikolay A. Krasovskiy
AU  - Alexander M. Tarasyev
TI  - Decomposition algorithm of searching equilibria in the dynamical game
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2011
SP  - 49
EP  - 88
VL  - 3
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a2/
LA  - ru
ID  - MGTA_2011_3_4_a2
ER  - 
%0 Journal Article
%A Nikolay A. Krasovskiy
%A Alexander M. Tarasyev
%T Decomposition algorithm of searching equilibria in the dynamical game
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2011
%P 49-88
%V 3
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a2/
%G ru
%F MGTA_2011_3_4_a2
Nikolay A. Krasovskiy; Alexander M. Tarasyev. Decomposition algorithm of searching equilibria in the dynamical game. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 3 (2011) no. 4, pp. 49-88. http://geodesic.mathdoc.fr/item/MGTA_2011_3_4_a2/