Paper Info
Title
Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences.
Abstract
We examine problem existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such strategies follows from existence optimal deterministic stationarystrategies some derived one-player games.Thus we reducethe problem from two-player to one-player games (Markov decisionproblems), where usually it is much easier to tackle.The reduction is very general, it holds not only for all possible payoff mappings but alsoin more a general situations whereplayersu0027 preferences are not expressed by payoffs.
Year
Venue
Field
2016
arXiv: Computer Science and Game Theory
Mathematical economics,Decision problem,Mathematical optimization,Markov chain,Perfect information,Mathematics,Stochastic game
DocType
Volume
Citations 
Journal
abs/1611.08487
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Gimbert, H.153.21
Wieslaw Zielonka261438.95