Pages that link to "Item:Q1262826"
From MaRDI portal
The following pages link to The closest solution to the shadow minimum of a cooperative dynamic game (Q1262826):
Displayed 10 items.
- On discounted dynamic programming with constraints (Q806686) (← links)
- Computing multiobjective Markov chains handled by the extraproximal method (Q1730553) (← links)
- Negotiating transfer pricing using the Nash bargaining solution (Q1787057) (← links)
- Solving traffic queues at controlled-signalized intersections in continuous-time Markov games (Q1997708) (← links)
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games (Q2031943) (← links)
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
- The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context (Q2698591) (← links)
- A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies (Q4561198) (← links)
- On Lyapunov Game Theory Equilibrium: Static and Dynamic Approaches (Q4567819) (← links)
- Using the Manhattan distance for computing the multiobjective Markov chains problem (Q5028582) (← links)