Bilinear programming and structured stochastic games (Q1076625)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bilinear programming and structured stochastic games
scientific article

    Statements

    Bilinear programming and structured stochastic games (English)
    0 references
    0 references
    1987
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    structured stochastic games
    0 references
    additive rewards and transitions
    0 references
    switching controllers
    0 references
    bilinear programs
    0 references
    undiscounted stochastic games
    0 references
    optimal stationary strategies
    0 references
    discounted stochastic games
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references