{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T22:09:14Z","timestamp":1693346954945},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1976,6]]},"DOI":"10.1007\/bf02276760","type":"journal-article","created":{"date-parts":[[2005,12,9]],"date-time":"2005-12-09T02:46:07Z","timestamp":1134096367000},"page":"157-162","source":"Crossref","is-referenced-by-count":9,"title":["A successive approximation algorithm for an undiscounted Markov decision process"],"prefix":"10.1007","volume":"17","author":[{"given":"J.","family":"van der Wal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02276760_CR1","first-page":"32","volume-title":"Dynamic Programming and Markov processes","author":"R. A. Howard","year":"1969","unstructured":"Howard, R. A.: Dynamic Programming and Markov processes. 5th printing, pp. 32\u201343. Cambridge: M. I. T. Press 1969."},{"key":"BF02276760_CR2","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1287\/opre.17.5.857","volume":"17","author":"A. R. Odoni","year":"1969","unstructured":"Odoni, A. R.: On finding the gain for Markov decision processes. O. R.17, 857\u2013860 (1969).","journal-title":"O. R."},{"key":"BF02276760_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF02246616","volume":"13","author":"K. Spremann","year":"1974","unstructured":"Spremann, K., Gessner, P.: Algorithmus 21. Bewertete Markovprozesse im station\u00e4ren Zustand \u2014Ein neuer Algorithmus mit Beispiel. Computing13, 173\u2013181 (1974).","journal-title":"Computing"},{"key":"BF02276760_CR4","unstructured":"Van Nunen, J. A. E. E.: A set of successive approximation methods for discounted Markovian decision problems. (To appear in Z. f. Oper. Res.)"},{"key":"BF02276760_CR5","first-page":"173","volume-title":"Stochastic Processes","author":"J. L. Doob","year":"1953","unstructured":"Doob, J. L.: Stochastic Processes, p. 173. New York: J. Wiley 1953."},{"key":"BF02276760_CR6","unstructured":"Van der Wal, J.: The solution of an undiscounted completely ergodic Markov decision process by successive approximation. Memorandum COSOR 74-05. Technological University Eindhoven, March 1974 (Department of Mathematics)."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276760.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02276760\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02276760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:33Z","timestamp":1557930513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02276760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["BF02276760"],"URL":"https:\/\/doi.org\/10.1007\/bf02276760","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}