Titlebook: Stochastic Games And Related Topics; In Honor of Professo T. E. S. Raghavan,T. S. Ferguson,O. J. Vrieze Book 1991 Kluwer Academic Publisher

staging

易于交談

https://doi.org/10.1007/978-94-011-3760-7algorithms; dynamical systems; equilibrium; information; university; utility

自制

978-94-010-5673-1Kluwer Academic Publishers 1991

Middle-Ear

Stochastic Games And Related Topics978-94-011-3760-7Series ISSN 0924-6126 Series E-ISSN 2194-3044

alcohol-abuse

能得到

Models for the Game of Liar’s DiceAn explicit multimove game of competition where a player must occasionally lie and the other must detect the lie is solved.

舔食

Algorithms for Stochastic GamesIn this paper, we present algorithms for the solution of finite discounted stochastic games, without special structure. Three equilibrium concepts are considered: saddle points in two-person zero-sum games, Nash equilibrium points in .-person non-cooperative games and finally Stackelberg equilibrium in two-person games.

ALE

非實體

Positive Stochastic Games and a Theorem of OrnsteinStochastic games were first formulated by Shapley in 1953. In his fundamental paper Shapley [.] established the existence of value and optimal stationary strategies for zero-sum β-discounted stochastic games with finitely many states and actions for the two players.

Chronological

Nonzero-Sum Stochastic GamesNonzero-sum discounted stochastic games have equilibrium strategies when the state space is uncountable.