{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T02:10:02Z","timestamp":1754014202491,"version":"3.41.2"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T00:00:00Z","timestamp":1627776000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010688","name":"Horizon 2020 European Innovation Council Fast Track to Innovation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010688","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"FWF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1016\/j.jcss.2021.02.008","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T10:29:10Z","timestamp":1614940150000},"page":"133-144","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Bidding mechanisms in graph games"],"prefix":"10.1016","volume":"119","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"\u0110or\u0111e","family":"\u017dikeli\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2011","series-title":"Lectures in Game Theory for Computer Scientists","author":"Apt","key":"10.1016\/j.jcss.2021.02.008_br0010"},{"key":"10.1016\/j.jcss.2021.02.008_br0020","series-title":"Proc. 16th POPL","first-page":"179","article-title":"On the synthesis of a reactive module","author":"Pnueli","year":"1989"},{"key":"10.1016\/j.jcss.2021.02.008_br0030","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/j.jcss.2021.02.008_br0040","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1006\/game.1998.0676","article-title":"Combinatorial games under auction play","volume":"27","author":"Lazarus","year":"1999","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.jcss.2021.02.008_br0050","series-title":"Games of No Chance","first-page":"439","article-title":"Richman games","volume":"vol. 29","author":"Lazarus","year":"1996"},{"key":"10.1016\/j.jcss.2021.02.008_br0060","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0894-0347-08-00606-1","article-title":"Tug-of-war and the infinity Laplacian","volume":"22","author":"Peres","year":"2009","journal-title":"J. Am. Math. Soc."},{"key":"10.1016\/j.jcss.2021.02.008_br0070","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","article-title":"The complexity of stochastic games","volume":"96","author":"Condon","year":"1992","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jcss.2021.02.008_br0080","doi-asserted-by":"crossref","DOI":"10.1145\/3340295","article-title":"Infinite-duration bidding games","volume":"66","author":"Avni","year":"2019","journal-title":"J. ACM"},{"key":"10.1016\/j.jcss.2021.02.008_br0090","series-title":"Proc. 14th WINE","first-page":"21","article-title":"Infinite-duration poorman-bidding games","volume":"vol. 11316","author":"Avni","year":"2018"},{"year":"2005","series-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman","key":"10.1016\/j.jcss.2021.02.008_br0100"},{"key":"10.1016\/j.jcss.2021.02.008_br0110","series-title":"Proc. 32nd SODA","first-page":"617","article-title":"Infinite-duration all-pay bidding games","author":"Avni","year":"2021"},{"year":"1960","series-title":"Dynamic Programming and Markov Processes","author":"Howard","key":"10.1016\/j.jcss.2021.02.008_br0120"},{"key":"10.1016\/j.jcss.2021.02.008_br0130","series-title":"Proc. 15th FoSSaCS","first-page":"270","article-title":"Robustness of structurally equivalent concurrent parity games","author":"Chatterjee","year":"2012"},{"key":"10.1016\/j.jcss.2021.02.008_br0140","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1023\/B:JOTP.0000011995.28536.ef","article-title":"Continuity of the value of competitive Markov decision processes","volume":"16","author":"Solan","year":"2003","journal-title":"J. Theor. Probab."},{"key":"10.1016\/j.jcss.2021.02.008_br0150","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","article-title":"The complexity of mean payoff games on graphs","volume":"158","author":"Zwick","year":"1996","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2021.02.008_br0160","series-title":"Proc. 20th STOC","first-page":"460","article-title":"Some algebraic and geometric computations in PSPACE","author":"Canny","year":"1988"},{"key":"10.1016\/j.jcss.2021.02.008_br0170","series-title":"Proc. 31st CONCUR","article-title":"A survey of bidding games on graphs","volume":"vol. 171","author":"Avni","year":"2020"},{"key":"10.1016\/j.jcss.2021.02.008_br0180","series-title":"Proc. 34th AAAI","first-page":"1798","article-title":"All-pay bidding games on graphs","author":"Avni","year":"2020"},{"key":"10.1016\/j.jcss.2021.02.008_br0190","series-title":"Proc. 13th RP","first-page":"1","article-title":"Bidding games on Markov decision processes","author":"Avni","year":"2019"},{"key":"10.1016\/j.jcss.2021.02.008_br0200","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.geb.2018.08.005","article-title":"Bidding games and efficient allocations","volume":"112","author":"Meir","year":"2018","journal-title":"Games Econ. Behav."},{"key":"10.1016\/j.jcss.2021.02.008_br0210","article-title":"Discrete bidding games","volume":"17","author":"Develin","year":"2010","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.jcss.2021.02.008_br0220","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00283-009-9057-7","article-title":"Bidding chess","volume":"31","author":"Bhatt","year":"2009","journal-title":"Math. Intell."},{"key":"10.1016\/j.jcss.2021.02.008_br0230","series-title":"Proc. 30th CONCUR","article-title":"Determinacy in discrete-bidding infinite-duration games","volume":"vol. 140","author":"Aghajohari","year":"2019"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000021000234?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000021000234?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T01:35:02Z","timestamp":1754012102000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000021000234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":23,"alternative-id":["S0022000021000234"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2021.02.008","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2021,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bidding mechanisms in graph games","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2021.02.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}