Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference23 articles.
1. M.L. Balinski, “An algorithm for finding all vertices of convex polyhedral sets”,SIAM Journal on Applied Mathematics 9 (1961) 72–88.
2. T. Bewley and E. Kohlberg, “On stochastic games with stationary optimal strategies”,Mathematics of Operations Research 3 (1978) 104–125.
3. D. Blackwell and T.S. Ferguson, “The big match”,Annals of Mathematical Statistics 39 (1968) 159–163.
4. E.V. Denardo and B.L. Fox, “Multichain Markov renewal programs”,SIAM Journal on Applied Mathemàtics 16 (1968) 468–487.
5. J.A. Filar, “Algorithms for solving some undiscounted stochastic games”, Ph.D. Dissertation, University of Illinois at Chicago Circle (Chicago, IL, 1980).
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献