Optimal and near-optimal incentive strategies in the hierarchical control of Markov chains (Q1058473)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal and near-optimal incentive strategies in the hierarchical control of Markov chains |
scientific article |
Statements
Optimal and near-optimal incentive strategies in the hierarchical control of Markov chains (English)
0 references
1985
0 references
This paper considers Markovian Stackelberg problems with one leader and N followers. Firstly, an algorithm is proposed to compute an optimal affine incentive strategy for the leader and Nash reactions of the followers, for general finite state Markov chains, under the average-cost-per-stage criteria. Next, this algorithm is analyzed in the context of weakly- coupled Markov chains to compute near-optimal strategies from a reduced- order aggregate model. The robustness of the near-optimal solution is established, and the multimodel feature of the computational algorithm is highlighted.
0 references
decentralized control
0 references
hierarchical decision making
0 references
large scale systems
0 references
perturbation techniques
0 references
stochastic systems
0 references
Markovian Stackelberg problems
0 references
one leader
0 references
N followers
0 references
optimal affine incentive strategy
0 references
Nash reactions
0 references
finite state Markov chains
0 references
average-cost-per-stage criteria
0 references
near-optimal strategies
0 references
reduced-order aggregate model
0 references
robustness
0 references
