Only this author abstract is provided: 'One step' algorithms are presented for two classes of structured stochastic games, namely those with additive rewards and transitions, and those which have switching controllers. Solutions to such classes of games under the 'average reward' criterion can be derived from optimal solutions to appropriate bilinear programs. The validity of using bilinear programming as a solution method follows from two preliminary theorems, the first of which is a complete classification of undiscounted stochastic games with optimal stationary strategies. The second of these preliminary theorems relaxes the conditions of the classification theorem for certain classes of stochastic games and provides the basis for the bilinear programming results. Analogous results hold for the discounted stochastic games with the above special structures.
|Original language||English (US)|
|Number of pages||1|
|Journal||Proceedings - Annual Allerton Conference on Communication, Control, and Computing|
|Publication status||Published - Dec 1 1985|
ASJC Scopus subject areas