The closest solution to the shadow minimum of a cooperative dynamic game

DOI10.1016/0898-1221(89)90135-1zbMath0686.90047OpenAlexW2001025552MaRDI QIDQ1262826

Kensuke Tanaka

Publication date: 1989

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(89)90135-1

zbMATH Keywords

continuous timeweak optimal solutioncontinuous-timePareto solutionmetric state spacecooperative m-person discounted Markov gameminimization norm problem

Mathematics Subject Classification ID

Cooperative games (91A12) Multistage and repeated games (91A20)

Related Items (10)

A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies ⋮ On Lyapunov Game Theory Equilibrium: Static and Dynamic Approaches ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context ⋮ Computing multiobjective Markov chains handled by the extraproximal method ⋮ Solving traffic queues at controlled-signalized intersections in continuous-time Markov games ⋮ Negotiating transfer pricing using the Nash bargaining solution ⋮ A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games ⋮ Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness ⋮ On discounted dynamic programming with constraints ⋮ Using the Manhattan distance for computing the multiobjective Markov chains problem

Cites Work

• Unnamed Item
• Unnamed Item
• An n-person noncooperative discounted vector valued dynamic game with a stopped set
• An N-person non-cooperative discounted vector-valued dynamic game with a metric space
• On a D-solution of a cooperative m-person discounted Markov game
• On an N-person noncooperative Markov game with a metric state space
• Mathematical methods of game and economic theory

This page was built for publication: The closest solution to the shadow minimum of a cooperative dynamic game