{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:25:54Z","timestamp":1742937954423,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_144","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:05:19Z","timestamp":1219662319000},"page":"833-837","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Programming: Average Cost Per Stage Problems"],"prefix":"10.1007","author":[{"given":"Ioannis P.","family":"Androulakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"144_CR1_144","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1137\/0331018","volume":"31","author":"A. Arapostathis","year":"1993","unstructured":"Arapostathis A, Borkar VK, Fern\u00e1ndez-Gaucherand E, Ghosh ML, Markus SI (1993) Discrete-time controlled markov processes with average cost criterion: A\u00a0survey. SIAM J Control Optim 31:282\u2013344","journal-title":"SIAM J. Control Optim."},{"key":"144_CR2_144","doi-asserted-by":"publisher","first-page":"328","DOI":"10.2307\/1426039","volume":"5","author":"J. Bather","year":"1973","unstructured":"Bather J (1973) Optimal decision procedures for finite Markov chains. Part I: Example. Adv Appl Probab 5:328\u2013339","journal-title":"Adv. Appl. Probab."},{"key":"144_CR3_144","volume-title":"Dynamic programming and optimal control","author":"D.P. Bertsekas","year":"1995","unstructured":"Bertsekas DP (1995) Dynamic programming and optimal control. Athena Sci., Belmont, MA"},{"key":"144_CR4_144","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/S0363012995291609","volume":"36","author":"D.P. Bertsekas","year":"1998","unstructured":"Bertsekas DP (1998) A\u00a0new value iteration method for the average cost dynamic programming problem. SIAM J Optim 36:742\u2013759","journal-title":"SIAM J. Optim."},{"key":"144_CR5_144","volume-title":"Neuro-dynamic programming","author":"D.P. Bertsekas","year":"1997","unstructured":"Bertsekas DP, Tsitsiklis JN (1997) Neuro-dynamic programming. Athena Sci., Belmont, MA"},{"key":"144_CR6_144","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1214\/aoms\/1177704593","volume":"33","author":"D. Blackwell","year":"1962","unstructured":"Blackwell D (1962) Discounted dynamic programming. Ann Math Statist 33:719\u2013726","journal-title":"Ann. Math. Statist."},{"key":"144_CR7_144","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1214\/aoms\/1177704593","volume":"33","author":"D. Blackwell","year":"1962","unstructured":"Blackwell D (1962) Discrete dynamic programming. Ann Math Statist 33:719\u2013726","journal-title":"Ann. Math. Statist."},{"key":"144_CR8_144","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.17.5.857","volume":"17","author":"A.R. Odoni","year":"1969","unstructured":"Odoni AR (1969) On finding the maximal gain for markov decision processes. Oper Res 17:857\u2013860","journal-title":"Oper. Res."},{"key":"144_CR9_144","volume-title":"Applied probability models with optimization applications","author":"S.M. Ross","year":"1970","unstructured":"Ross SM (1970) Applied probability models with optimization applications. Dover, Mineola, NY"},{"key":"144_CR10_144","volume-title":"Probability models","author":"S.M. Ross","year":"1985","unstructured":"Ross SM (1985) Probability models. Acad. Press, New York"},{"key":"144_CR11_144","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/moor.2.4.360","volume":"2","author":"P.J. Schweitzer","year":"1977","unstructured":"Schweitzer PJ, Federgruen A (1977) The assymptotic behavior of undiscounted value iteration in Markov decision problems. Math Oper Res 2:360\u2013381","journal-title":"Math. Oper. Res."},{"key":"144_CR12_144","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/moor.3.4.308","volume":"3","author":"P.J. Schweitzer","year":"1978","unstructured":"Schweitzer PJ, Federgruen A (1978) The functional equation of undiscounted Markov renewal programming. Math Oper Res 3:308\u2013321","journal-title":"Math. Oper. Res."},{"key":"144_CR13_144","unstructured":"Singh SP (1994) Reinforcement learning algorithms for average\u2013payoff Markovian decision processes. Proc. 12th Nat. Conf. Artificial Intelligence"},{"key":"144_CR14_144","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0022-247X(63)90017-9","volume":"6","author":"D.J. White","year":"1963","unstructured":"White DJ (1963) Dynamic programming, Markov chains and the method of successive approximation. J\u00a0Math Anal Appl 6:373\u2013376","journal-title":"J. Math. Anal. Appl."}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:12:50Z","timestamp":1720696370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_144","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}