Stackelberg games for model-free continuous-time stochastic systems based on adaptive dynamic programming

Xikui Liu, Yingying Ge and Yan Li

Applied Mathematics and Computation, 2019, vol. 363, issue C, -

Abstract: Solving the Stackelberg game problem generally needs full data of the system. In this paper, two online adaptive dynamic programming algorithms are proposed to solve the Stackelberg game problem for model-free linear continuous-time systems subject to multiplicative noise. Stackelberg games are based on two different strategies: Nash-based Stackelberg strategy and Pareto-based Stackelberg strategy. We apply directly the state and input information to iteratively update Stackelberg games online. The effectiveness of the algorithms is verified by two simulation examples.

Keywords: Adaptive dynamic programming; Optimal control; Continuous-time stochastic systems; Stackelberg game (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031930551X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:363:y:2019:i:c:2

DOI: 10.1016/j.amc.2019.124568

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().