### Abstract

The main objective of this paper is to develop a new iterative approach towards the solution of dynamic stochastic teams when the coupling among a subset of agents is weak, either through the state dynamics or through the performance index. In each case, the weak coupling is characterized in terms of a number of small (perturbation) parameters. When these parameter values are set equal to zero, the original fairly complex dynamic team, with a quasiclassical or a nonclassical information pattern is decomposed into relatively simpler stochastic control and team problems, the solution of which make up the zeroth order approximation (in a function space) to the team-optimal solution of the original problem. Using this as a starting point for an iteration, we show that approximations of all orders can be obtained by solving a sequence of stochastic control and/or simpler team problems. The paper studies, particularly, two agent LQG teams with quasiclassical or nonclassical information patterns, but the approach is applicable to other models (with more than two agents and non-Gaussian statistics) as well.

Original language | English (US) |
---|---|

Pages | 1-6 |

Number of pages | 6 |

State | Published - Jan 1 1991 |

Event | Proceedings of the 11th Triennial World Congress of the International Federation of Automatic Control - Tallinn, USSR Duration: Aug 13 1990 → Aug 17 1990 |

### Other

Other | Proceedings of the 11th Triennial World Congress of the International Federation of Automatic Control |
---|---|

City | Tallinn, USSR |

Period | 8/13/90 → 8/17/90 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*Approximation schemes for stochastic teams with weakly coupled agents*. 1-6. Paper presented at Proceedings of the 11th Triennial World Congress of the International Federation of Automatic Control, Tallinn, USSR, .

**Approximation schemes for stochastic teams with weakly coupled agents.** / Basar, M Tamer; Srikant, Rayadurgam.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - Approximation schemes for stochastic teams with weakly coupled agents

AU - Basar, M Tamer

AU - Srikant, Rayadurgam

PY - 1991/1/1

Y1 - 1991/1/1

N2 - The main objective of this paper is to develop a new iterative approach towards the solution of dynamic stochastic teams when the coupling among a subset of agents is weak, either through the state dynamics or through the performance index. In each case, the weak coupling is characterized in terms of a number of small (perturbation) parameters. When these parameter values are set equal to zero, the original fairly complex dynamic team, with a quasiclassical or a nonclassical information pattern is decomposed into relatively simpler stochastic control and team problems, the solution of which make up the zeroth order approximation (in a function space) to the team-optimal solution of the original problem. Using this as a starting point for an iteration, we show that approximations of all orders can be obtained by solving a sequence of stochastic control and/or simpler team problems. The paper studies, particularly, two agent LQG teams with quasiclassical or nonclassical information patterns, but the approach is applicable to other models (with more than two agents and non-Gaussian statistics) as well.

AB - The main objective of this paper is to develop a new iterative approach towards the solution of dynamic stochastic teams when the coupling among a subset of agents is weak, either through the state dynamics or through the performance index. In each case, the weak coupling is characterized in terms of a number of small (perturbation) parameters. When these parameter values are set equal to zero, the original fairly complex dynamic team, with a quasiclassical or a nonclassical information pattern is decomposed into relatively simpler stochastic control and team problems, the solution of which make up the zeroth order approximation (in a function space) to the team-optimal solution of the original problem. Using this as a starting point for an iteration, we show that approximations of all orders can be obtained by solving a sequence of stochastic control and/or simpler team problems. The paper studies, particularly, two agent LQG teams with quasiclassical or nonclassical information patterns, but the approach is applicable to other models (with more than two agents and non-Gaussian statistics) as well.

UR - http://www.scopus.com/inward/record.url?scp=0025844631&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025844631&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0025844631

SP - 1

EP - 6

ER -