{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:29:00Z","timestamp":1754108940876},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030308056"},{"type":"electronic","value":"9783030308063"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30806-3_1","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:36Z","timestamp":1567760916000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bidding Games on Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Novotn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"key":"1_CR1","unstructured":"Aghajohari, M., Avni, G., Henzinger, T.A.: Determinacy in discrete-bidding infinite-duration games. In: Proceedings 30th CONCUR (2019)"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973468","volume-title":"Lectures in Game Theory for Computer Scientists","author":"KR Apt","year":"2011","unstructured":"Apt, K.R., Gr\u00e4del, E.: Lectures in Game Theory for Computer Scientists. Cambridge University Press, Cambridge (2011)"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"31:1","DOI":"10.1145\/3340295","volume":"66","author":"G Avni","year":"2019","unstructured":"Avni, G., Henzinger, T.A., Chonev, V.: Infinite-duration bidding games. J. ACM 66(4), 31:1\u201331:29 (2019)","journal-title":"J. ACM"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-04612-5_2","volume-title":"Web and Internet Economics","author":"G Avni","year":"2018","unstructured":"Avni, G., Henzinger, T.A., Ibsen-Jensen, R.: Infinite-duration poorman-bidding games. In: Christodoulou, G., Harks, T. (eds.) WINE 2018. LNCS, vol. 11316, pp. 21\u201336. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-04612-5_2"},{"key":"1_CR5","unstructured":"Avni, G., Henzinger, T.A., \u017dikeli\u0107, \u0110.: Bidding mechanisms in graph games. In: Proceedings of the 44th MFCS (2019)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-28729-9_18","volume-title":"Foundations of Software Science and Computational Structures","author":"K Chatterjee","year":"2012","unstructured":"Chatterjee, K.: Robustness of structurally equivalent concurrent parity games. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 270\u2013285. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-28729-9_18"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992)","journal-title":"Inf. Comput."},{"key":"1_CR8","volume-title":"Dynamic Programming and Markov Processes","author":"AR Howard","year":"1960","unstructured":"Howard, A.R.: Dynamic Programming and Markov Processes. MIT Press, Cambridge (1960)"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/game.1998.0676","volume":"27","author":"AJ Lazarus","year":"1999","unstructured":"Lazarus, A.J., Loeb, D.E., Propp, J.G., Stromquist, W.R., Ullman, D.H.: Combinatorial games under auction play. Games Econ. Behav. 27(2), 229\u2013264 (1999)","journal-title":"Games Econ. Behav."},{"key":"1_CR10","first-page":"439","volume":"29","author":"AJ Lazarus","year":"1996","unstructured":"Lazarus, A.J., Loeb, D.E., Propp, J.G., Ullman, D.: Richman games. Games No Chance 29, 439\u2013449 (1996)","journal-title":"Games No Chance"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1090\/S0894-0347-08-00606-1","volume":"22","author":"Y Peres","year":"2009","unstructured":"Peres, Y., Schramm, O., Sheffield, S., Wilson, D.B.: Tug-of-war and the infinity laplacian. J. Amer. Math. Soc. 22, 167\u2013210 (2009)","journal-title":"J. Amer. Math. Soc."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Proceedings of the 16th POPL, pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"1_CR13","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2005","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (2005)"},{"key":"1_CR14","first-page":"1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second order theories and automata on infinite trees. Trans. AMS 141, 1\u201335 (1969)","journal-title":"Trans. AMS"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1023\/B:JOTP.0000011995.28536.ef","volume":"16","author":"E Solan","year":"2003","unstructured":"Solan, E.: Continuity of the value of competitive Markov decision processes. J. Theor. Probab. 16, 831\u2013845 (2003)","journal-title":"J. Theor. Probab."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:10:26Z","timestamp":1567761026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}