Abstract

We consider Gillette's two-person zero-sum stochastic games with perfect information. For each $k \in \ZZ_+$ we introduce an effective reward function, called kk-total. For k=0k = 0 and 11 this function is known as {\it mean payoff} and {\it total reward}, respectively. We restrict our attention to the deterministic case. For all kk, we prove the existence of a saddle point which can be realized by uniformly optimal pure stationary strategies. We also demonstrate that kk-total reward games can be embedded into (k+1)(k+1)-total reward games.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.