Blackwell-Optimal Strategies in Priority Mean-Payoff Games
Hugo Gimbert, Wiesław Zielonka
Electronic Proceedings in Theoretical Computer Science · 2010
doi:10.4204/eptcs.25.5 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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 optimal for priority mean-payoff games establishing a strong link between these two classes.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.