Abstract
A cooperative stochastic n-person game on a finite graph tree is considered. The subtree of cooperative trajectories maximizing the sum of expected players’ payoffs is defined, and the solution of the game along the paths of this tree is investigated. The new notion of cooperative payoff distribution procedure (CPDP) is defined, and the time-consistent Shapley value is constructed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellman R., Dynamic Programming, Princeton University Press, Princeton, NJ, 1957.
Kuhn H.W., Extensive games and the problem of information, Annals of Mathematics Studies, 28, 193–216, 1953.
Petrosjan L.A., The Shapley value for differential games, Annals of the International Society of Dynamic Games, 3, 409–419, 1995.
Shapley L.S., A value for n-person games, Annals of Mathematics Studies, 28, 307–317, 1953.
Shapley L.S., Stochastic games, Proceedings of the National Academy of U.S.A., 39, 1095–1100, 1953.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Birkhäuser Boston
About this chapter
Cite this chapter
Petrosjan, L.A. (2006). Cooperative Stochastic Games. In: Haurie, A., Muto, S., Petrosjan, L.A., Raghavan, T.E.S. (eds) Advances in Dynamic Games. Annals of the International Society of Dynamic Games, vol 8. Birkhäuser Boston. https://doi.org/10.1007/0-8176-4501-2_7
Download citation
DOI: https://doi.org/10.1007/0-8176-4501-2_7
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4500-7
Online ISBN: 978-0-8176-4501-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)