Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-02T23:05:56.036Z Has data issue: false hasContentIssue false

Repeated matrix games

Published online by Cambridge University Press:  14 July 2016

Dana B. Kamerud*
Affiliation:
St. Louis University

Abstract

A matrix game is played repeatedly, with the actions taken at each stage determining both a reward paid to Player I and the probability of continuing to the next stage. An infinite history of play determines a sequence (Rn) of such rewards, to which we assign the payoff lim supn (R1 + · ·· + Rn). Using the concept of playable strategies, we slightly generalize the definition of the value of a game. Then we find sufficient conditions for the existence of a value and for the existence of stationary optimal strategies (Theorems 8 and 9). An example shows that the game need not have a value (Example 4).

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1979 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Breiman, L. (1968) Probability. Addison–Wesley, Reading, MA.Google Scholar
Chung, K. L. (1968) A Course in Probability Theory. Harcourt, Brace and World, New York.Google Scholar
Everett, H. (1957) Recursive games. Ann. Math. Studies 39, 4778.Google Scholar
Kohlberg, E. (1974) Repeated games with absorbing states. Ann. Statist. 2, 724738.Google Scholar
Maitra, A. and Parthasarathy, T. (1971) On stochastic games II. J. Optimization Theory Appl. 8, 154160.Google Scholar
Meyer, P. A. (1966) Probability and Potentials. Blaisdell, Waltham, MA.Google Scholar
Orkin, M. (1972) Recursive matrix games. J Appl. Prob. 9, 813820.Google Scholar
Parthasarathy, T. (1973) Discounted, positive, and noncooperative stochastic games. Internat. J. Game Theory 2, 2537.Google Scholar
Shapely, L. S. (1953) Stochastic games. Proc. Natn. Acad. Sci. USA 39, 10951100.Google Scholar