{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:20:48Z","timestamp":1776316848549,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046118","type":"print"},{"value":"9783030046125","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_2","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"21-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Infinite-Duration Poorman-Bidding Games"],"prefix":"10.1007","author":[{"given":"Guy","family":"Avni","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]},{"given":"Rasmus","family":"Ibsen-Jensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"2_CR1","unstructured":"Almagor, S., Avni, G., Kupferman, O.: Repairing multi-player games. In: Proceedings of the 26th CONCUR, pp. 325\u2013339 (2015)"},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"2_CR3","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)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Avni, G., Guha, S., Kupferman, O.: An abstraction-refinement methodology for reasoning about network games. In: Proceedings of the 26th IJCAI, pp. 70\u201376 (2017)","DOI":"10.24963\/ijcai.2017\/11"},{"key":"2_CR5","unstructured":"Avni, G., Henzinger, T.A., Chonev, V.: Infinite-duration bidding games. In: Proceedings of the 28th CONCUR, vol. 85 of LIPIcs, pp. 21:1\u201321:18 (2017)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Avni, G., Henzinger, T.A., Ibsen-Jensen, R.: Infinite-duration poorman-bidding games. CoRR, abs\/1804.04372, (2018). arXiv:1804.04372","DOI":"10.1007\/978-3-030-04612-5_2"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-662-53354-3_13","volume-title":"Algorithmic Game Theory","author":"G Avni","year":"2016","unstructured":"Avni, G., Henzinger, T.A., Kupferman, O.: Dynamic resource allocation games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 153\u2013166. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_13"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2016.08.004","volume":"251","author":"G Avni","year":"2016","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Network-formation games with regular objectives. Inf. Comput. 251, 165\u2013178 (2016)","journal-title":"Inf. Comput."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00283-009-9057-7","volume":"31","author":"J Bhatt","year":"2009","unstructured":"Bhatt, J., Payne, S.: Bidding chess. Math. Intell. 31, 37\u201339 (2009)","journal-title":"Math. Intell."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J., Gimbert, H.: On subgame perfection in quantitative reachability games. Log. Methods Comput. Sci. 9(1) (2012). https:\/\/doi.org\/10.2168\/LMCS-9(1:7)2013","DOI":"10.2168\/LMCS-9(1:7)2013"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Calude, C., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Proceedings of the 49th STOC (2017)","DOI":"10.1145\/3055399.3055409"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th STOC, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11874683_18","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K.: Nash equilibrium for upward-closed objectives. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 271\u2013286. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11874683_18"},{"issue":"1\u20132","key":"2_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Games with secure equilibria. Theor. Comput. Sci. 365(1\u20132), 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Inf. Comput. 208(6), 677\u2013693 (2010)","journal-title":"Inf. Comput."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 26\u201340. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30124-0_6"},{"key":"2_CR17","unstructured":"Condon, A.: On algorithms for simple stochastic games. In: Proceedings of the DIMACS, pp. 51\u201372 (1990)"},{"issue":"1","key":"2_CR18","doi-asserted-by":"crossref","first-page":"R85","DOI":"10.37236\/357","volume":"17","author":"M Develin","year":"2010","unstructured":"Develin, M., Payne, S.: Discrete bidding games. Electron. J. Combin. 17(1), R85 (2010)","journal-title":"Electron. J. Combin."},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-66700-3_15","volume-title":"Algorithmic Game Theory","author":"M Feldman","year":"2017","unstructured":"Feldman, M., Snappir, Y., Tamir, T.: The efficiency of best-response dynamics. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 186\u2013198. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_15"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-12002-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Dana Fisman","year":"2010","unstructured":"Fisman, D., Kupferman, O., Lustig, Y.: Rational synthesis. In: Proceedings of the 16th TACAS, pp. 190\u2013204 (2010)"},{"key":"2_CR21","unstructured":"Huang, Z., Devanur, N.R., Malec, D.: Sequential auctions of identical items with budget-constrained bidders. CoRR, abs\/1209.1698 (2012)"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in up $$\\cap $$ co-up. Inf. Process. Lett. 68(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Kalai, G., Meir, R., Tennenholtz, M.: Bidding games and efficient allocations. In: Proceedings of the 16th EC, pp. 113\u2013130 (2015)","DOI":"10.1145\/2764468.2764526"},{"issue":"5","key":"2_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s00446-012-0170-z","volume":"25","author":"IA Kash","year":"2012","unstructured":"Kash, I.A., Friedman, E.J., Halpern, J.Y.: Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion. Distrib. Comput. 25(5), 335\u2013357 (2012)","journal-title":"Distrib. Comput."},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-662-54577-5_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Kupferman","year":"2017","unstructured":"Kupferman, O., Tamir, T.: Hierarchical network formation games. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 229\u2013246. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_13"},{"key":"2_CR26","first-page":"70","volume":"5","author":"U Larsson","year":"2018","unstructured":"Larsson, U., W\u00e4stlund, J.: Endgames in bidding chess. Games No Chance 5, 70 (2018)","journal-title":"Games No Chance"},{"issue":"2","key":"2_CR27","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":"2_CR28","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":"2_CR29","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1137\/1.9781611973099.70","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Renato Paes Leme","year":"2012","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, \u00c9.: Sequential auctions and externalities. In: Proceedings of the 23rd SODA, pp. 869\u2013886 (2012)"},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"34:1","DOI":"10.1145\/2631917","volume":"15","author":"F Mogavero","year":"2014","unstructured":"Mogavero, F., Murano, A., Perelli, G., Vardi, M.Y.: Reasoning about strategies: on the model-checking problem. ACM Trans. Comput. Log. 15(4), 34:1\u201334:47 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"2_CR31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"2_CR32","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. Am. Math. Soc. 22, 167\u2013210 (2009)","journal-title":"J. Am. Math. Soc."},{"key":"2_CR33","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":"2_CR34","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":"2_CR35","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"},{"issue":"3","key":"2_CR36","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0047-2727(96)01627-1","volume":"65","author":"E Winter","year":"1997","unstructured":"Winter, E.: Negotiations in multi-issue committees. J. Public Econ. 65(3), 323\u2013342 (1997)","journal-title":"J. Public Econ."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:33:43Z","timestamp":1709825623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}