Cooperative Markov decision processes: time consistency, greedy players satisfaction, and cooperation maintenance

DOI10.1007/s00182-012-0343-9zbMath1282.90226OpenAlexW2014505125MaRDI QIDQ1939519

Laura Cottatellucci, Lorenzo Maggi, Konstantin E. Avrachenkov

Publication date: 4 March 2013

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00182-012-0343-9

zbMATH Keywords

stochastic gamestime consistencycooperation maintenancecooperative Markov decision processesgreedy playerspayoff distribution procedure

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40)

Related Items (7)

Subgame-perfect cooperation in an extensive game ⋮ Sustainability of Cooperation in Dynamic Games Played over Event Trees ⋮ Confidence intervals for the Shapley-Shubik power index in Markovian games ⋮ On the regularization of a cooperative solution in a multistage game with random time horizon ⋮ Time-consistent Shapley value for games played over event trees ⋮ Dynamic linear programming games with risk-averse players ⋮ Sharing the global outcomes of finite natural resource exploitation: a dynamic coalitional stability perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The core of a repeated \(n\)-person cooperative game
• The strong sequential core for stationary cooperative games
• Cores of convex games
• DYNAMIC COOPERATIVE GAMES
• Introduction to the Theory of Cooperative Games

This page was built for publication: Cooperative Markov decision processes: time consistency, greedy players satisfaction, and cooperation maintenance