On memoryless quantitative objectives

DOI10.1007/978-3-642-22953-4_13MaRDI QIDQ3088278zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Laurent Doyen, Rohit Singh

Publication date 19 August 2011

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.3211

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Abstract: In two-player games on graph, the players construct an infinite path through the game graph and get a reward computed by a payoff function over infinite paths. Over weighted graphs, the typical and most studied payoff functions compute the limit-average or the discounted sum of the rewards along the path. Beside their simple definition, these two payoff functions enjoy the property that memoryless optimal strategies always exist. In an attempt to construct other simple payoff functions, we define a class of payoff functions which compute an (infinite) weighted average of the rewards. This new class contains both the limit-average and discounted sum functions, and we show that they are the only members of this class which induce memoryless optimal strategies, showing that there is essentially no other simple payoff functions.

Recommendations

• Memoryless determinacy of parity and mean payoff games: a simple proof
• CONCUR 2005 – Concurrency Theory
• The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games
• Quantitative games with interval objectives
• Generalized mean-payoff and energy games

Cites work

• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 1134975 (Why is no real title available?)
• scientific article; zbMATH DE number 2038772 (Why is no real title available?)
• Alternating-time temporal logic
• Automata, logics, and infinite games. A guide to current research
• Beyond \omega-Regular Languages
• Borel determinacy
• CONCUR 2005 – Concurrency Theory
• Church synthesis problem for noisy input
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• Energy parity games
• Half-Positional Determinacy of Infinite Games
• On the positional determinacy of edge-labeled games
• Positional strategies for mean payoff games
• Quantitative languages
• Stochastic Games
• Stochastic Games with Perfect Information and Time Average Payoff
• Stochastic games
• The complexity of mean payoff games on graphs
• Weighted automata and weighted logics

Cited in

(3)

• Making the best of limited memory in multi-player discounted sum games
• On values of games
• Memoryless determinacy of parity and mean payoff games: a simple proof

This page was built for publication: On memoryless quantitative objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088278)