z-logo
open-access-imgOpen Access
Stochastic Game with Lexicographic Payoffs
Author(s) -
Mindia E. Salukvadze,
Guram N. Beltadze
Publication year - 2018
Publication title -
international journal of modern education and computer science
Language(s) - English
Resource type - Journals
eISSN - 2075-017X
pISSN - 2075-0161
DOI - 10.5815/ijmecs.2018.04.02
Subject(s) - lexicographical order , nash equilibrium , mathematical economics , affine transformation , normal form game , class (philosophy) , mathematics , matrix (chemical analysis) , sequential game , computer science , game theory , mathematical optimization , combinatorics , pure mathematics , artificial intelligence , materials science , composite material
Stochastic games are discussed as a priva-te class of a general dynamic games. A certain class of lexicographic noncooperative games is studied lexicographic stochastic matrix games ) ,..., ( 1 m . The problem of the existence of Nash equilibrium is studied with two analyses standard and nonstandard way. Standard means using the same kind of mixed strategies in case of scalar games. In this case in lexicographic stochastic matrix game Nash equilibrium may not be existed. Its existence takes place in relevant stochastic affine matrix game to the existence of Nash equilibrium. In L game a set of Nash equi-librium is given by means of relevant stochastic affine matrix game's set of equilibrium. The sufficient condi-tions of the existance such affine game is proved. In nonstandard way of analyses we use such mixed stra-tegies, they use m ,..., 1 components with lexicog-raphic probabilites. In this case the kinds of subsets of a set of equilibrium in L game are described.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom