On a D-solution of a cooperative m-person discounted Markov game
From MaRDI portal
Publication:1110464
DOI10.1016/0022-247X(86)90017-XzbMath0656.90101MaRDI QIDQ1110464
Publication date: 1986
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
supergradientside paymentscountable state spacecompact metric action spacescooperative m-person discounted Markov gamesD-solutiondomination conceptlower support function
Cooperative games (91A12) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40) Probabilistic games; gambling (91A60)
Related Items (7)
An N-person non-cooperative discounted vector-valued dynamic game with a metric space ⋮ On a dynamic fractional game ⋮ On a Continuously Discounted Vector Valued Markov Decision Process ⋮ An n-person noncooperative discounted vector valued dynamic game with a stopped set ⋮ The closest solution to the shadow minimum of a cooperative dynamic game ⋮ On continuous-time discounted stochastic dynamic programming ⋮ On discounted dynamic programming with constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A noncooperative \(n\)-person semi-Markov game with a separable metric state space
- Duality theorem of nondifferentiable convex multiobjective programming
- Non-cooperative \(n\)-person game with a stopped set
- On an N-person noncooperative Markov game with a metric state space
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Mathematical methods of game and economic theory
- Fixed-point and Minimax Theorems in Locally Convex Topological Linear Spaces
- Minimax Theorems
This page was built for publication: On a D-solution of a cooperative m-person discounted Markov game