On Memoryless Quantitative Objectives

Details On Memoryless Quantitative Objectives On Memoryless Quantitative Objectives

2011-04-16

arxiv.org/abs/1104.3211v1

Computer Science

Computer Science and Game Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Memoryless Quantitative Objectives does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Memoryless Quantitative Objectives, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Memoryless Quantitative Objectives will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-346851