{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:54:53Z","timestamp":1742943293086,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811668890"},{"type":"electronic","value":"9789811668906"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_76","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"1011-1027","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semi-Markov Decision Processes with\u00a0Vector Pay-Offs"],"prefix":"10.1007","author":[{"given":"Kushal","family":"Guha Bakshi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"key":"76_CR1","doi-asserted-by":"crossref","unstructured":"Jewell WS (1963) Markov-renewal programming. I: formulation, finite return models. Oper Res","DOI":"10.21236\/AD0402064"},{"key":"76_CR2","unstructured":"Howard RA (1963) Semi-Markovian decision-processes. Bull Int Stat Inst"},{"key":"76_CR3","unstructured":"Ross SM (2013) Applied probability models with optimization applications. Courier Corporation"},{"key":"76_CR4","doi-asserted-by":"crossref","unstructured":"Lippman SA, et al (1971) Maximal average-reward policies for semi-Markov decision processes with arbitrary state and action space. Ann Math Stat","DOI":"10.1214\/aoms\/1177693170"},{"key":"76_CR5","doi-asserted-by":"crossref","unstructured":"Federgruen A, Hordijk A, Tijms HC (1978) A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices. J Appl Probab","DOI":"10.1016\/B978-0-12-568150-6.50007-6"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Yang P, Catthoor F (2003) Pareto-optimization-based run-time task scheduling for embedded systems. In: Proceedings of the 1st IEEE\/ACM\/IFIP international conference on Hardware\/software codesign and system synthesis","DOI":"10.1145\/944645.944680"},{"key":"76_CR7","unstructured":"Owen G (1995) Game theory academic press. San Diego"},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee K, Majumdar R, Henzinger TA (2006) Markov decision processes with multiple objectives. In: Annual symposium on theoretical aspects of computer science","DOI":"10.1007\/11672142_26"},{"key":"76_CR9","doi-asserted-by":"crossref","unstructured":"Mondal P (2016) On undiscounted semi-Markov decision processes with absorbing states. Math Methods Oper Res","DOI":"10.1007\/s00186-015-0524-y"},{"key":"76_CR10","doi-asserted-by":"crossref","unstructured":"Sinha S, Mondal P (2017) Semi-Markov decision processes with limiting ratio average rewards. J Math Anal Appl","DOI":"10.1016\/j.jmaa.2017.06.017"},{"key":"76_CR11","unstructured":"Papadimitriou CH, Yannakakis M (2000) On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st annual symposium on foundations of computer science"},{"key":"76_CR12","unstructured":"Belenson SM, Kapur KC (2017) An algorithm for solving multicriterion linear programming problems with examples. J Math Anal Appl"},{"key":"76_CR13","doi-asserted-by":"crossref","unstructured":"Luc DT, Luc DT (2016) Pareto optimality. Multiobjective linear programming: an introduction","DOI":"10.1007\/978-3-319-21091-9"},{"key":"76_CR14","unstructured":"Puterman ML (2014) Markov decision processes: discrete stochastic dynamic programming. Wiley"},{"key":"76_CR15","doi-asserted-by":"crossref","unstructured":"Wessels J, Nunen JAEE van (1975) Discounted semi-Markov decision processes: linear programming and policy iteration. Wiley Online Library","DOI":"10.1111\/j.1467-9574.1975.tb00238.x"},{"key":"76_CR16","doi-asserted-by":"crossref","unstructured":"Goldstein AA, Cheney W, et al (1958) A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations. Pacific J Math","DOI":"10.2140\/pjm.1958.8.415"},{"key":"76_CR17","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability. Freeman San Francisco"},{"key":"76_CR18","doi-asserted-by":"crossref","unstructured":"Brayton RK, Hachtel GD, Sangiovanni-Vincentelli AL (1981) A survey of optimization techniques for integrated-circuit design. Proc IEEE","DOI":"10.1109\/PROC.1981.12170"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:11:02Z","timestamp":1646489462000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_76","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}