论文信息 - Complementary Pivot Theory and Markovian Decision Chains - 字舞流文

Complementary Pivot Theory and Markovian Decision Chains

ABSTRACT Techniques of complementary pivot theory are used for solving the fixed point problem under new conditions.

B. Curtis Eaves | B. Eaves

[1] D. Ornstein. On the existence of stationary optimal strategies , 1969 .

[2] B. Curtis Eaves,et al. On the basic theorem of complementarity , 1971, Math. Program..

[3] R. Grinold. A Generalized Discrete Dynamic Programming Model , 1974 .

[4] R. Strauch. Negative Dynamic Programming , 1966 .

[5] David Blackwell,et al. Positive dynamic programming , 1967 .

[6] G. Dantzig,et al. A generalization of the linear complementarity problem , 1970 .

[7] F. d'Epenoux,et al. A Probabilistic Production and Inventory Problem , 1963 .

[8] B. Curtis Eaves,et al. Homotopies for computation of fixed points , 1972, Math. Program..

[9] C. E. Lemke,et al. Recent results in complementarity problems , 1970 .

[10] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[11] D. Blackwell. Discrete Dynamic Programming , 1962 .

[12] R. Bellman. A Markovian Decision Process , 1957 .

[13] A. F. Veinott. Discrete Dynamic Programming with Sensitive Discount Optimality Criteria , 1969 .

[14] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[15] E. Denardo. CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .

[16] B. Eaves. The Linear Complementarity Problem , 1971 .