Blackwell-Optimal Strategies in Priority Mean-Payoff Games
We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are o...
Main Authors: | Hugo Gimbert, Wiesław Zielonka |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1006.1402v1 |
Similar Items
-
Buying Optimal Payoffs in Bi-Matrix Games
by: Anshul Gupta, et al.
Published: (2018-06-01) -
Tropical spectrahedra : Application to semidefinite programming and mean payoff games
by: Skomra, Mateusz
Published: (2018) -
The Researches of Degenerated Disagreement Payoff and Non-Degenerated Disagreement Payoff in Assignment Game
by: Chen, Yin-Yu, et al.
Published: (2017) -
Solving Matrix Games with I-fuzzy Payoffs: Pareto-optimal Security Strategies Approach
by: A. Aggarwal, et al.
Published: (2014-06-01) -
Competitive Centipede Games: Zero-End Payoffs and Payoff Inequality Deter Reciprocal Cooperation
by: Eva M. Krockow, et al.
Published: (2015-08-01)