On Memoryless Quantitative Objectives

@article{Chatterjee2011OnMQ,
  title={On Memoryless Quantitative Objectives},
  author={K. Chatterjee and L. Doyen and R. Singh},
  journal={ArXiv},
  year={2011},
  volume={abs/1104.3211}
}
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. Besides 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… Expand
8 Citations

Figures from this paper

Discounting and Averaging in Games across Time scales
  • 4
On Values of Games
  • 1
Discounting the Past in Stochastic Games
  • PDF
Values on generalized reachability games
  • PDF
Approximate Determinization of Quantitative Automata
  • 7
  • PDF
Stochastic games on graphs

References

SHOWING 1-10 OF 38 REFERENCES
The Complexity of Mean Payoff Games on Graphs
  • 486
Energy Parity Games
  • 125
  • PDF
When Can You Play Positionally?
  • 45
  • PDF
Games Where You Can Play Optimally Without Any Memory
  • 64
  • PDF
Half-Positional Determinacy of Infinite Games
  • 43
  • PDF
On the positional determinacy of edge-labeled games
  • 15
  • PDF
Stochastic Games*
  • L. .. Shapley
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences
  • 1953
  • 1,963
  • PDF
Church Synthesis Problem for Noisy Input
  • 29
  • PDF
Positional strategies for mean payoff games
  • 380
Discounting the Future in Systems Theory
  • 162
  • PDF
...
1
2
3
4
...