Dynamic feedback Stackelberg games with non-unique solutions

DOI10.1016/j.na.2007.07.032zbMath1142.91381OpenAlexW1985768057WikidataQ57806749 ScholiaQ57806749MaRDI QIDQ944753

B. E. Eshmatov

Publication date: 10 September 2008

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2007.07.032

zbMATH Keywords

dynamic programming algorithmStackelberg gamesdiscrete time dynamic modelslower-level problems

Mathematics Subject Classification ID

Discrete-time games (91A50) (n)-person games, (n>2) (91A06) Dynamic programming (90C39) Dynamic games (91A25) Multistage and repeated games (91A20)

Related Items (4)

Min-max and min-min Stackelberg strategies with closed-loop information structure ⋮ Discrete time dynamic Stackelberg games with the leaders in turn ⋮ Open‐loop Stackelberg learning solution for hierarchical control problems ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Some properties of the bilevel programming problem
• A three-dimension null-space approach for mathematical programs with equilibrium constraints.
• Dynamic Stackelberg games under open-loop complete information
• Discrete time dynamic multi-leader-follower games with feedback perfect information
• Stackelburg solution for two-person games with biased information patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic feedback Stackelberg games with non-unique solutions