{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:56:21Z","timestamp":1757620581916,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_25","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:29Z","timestamp":1753979129000},"page":"333-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simultaneous All-Pay Auctions with\u00a0Budget Constraints"],"prefix":"10.1007","author":[{"given":"Yan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Ying","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Zihe","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Avni, G., Ibsen-Jensen, R., Tkadlec, J.: All-pay bidding games on graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a034, pp. 1798\u20131805 (2020)","DOI":"10.1609\/aaai.v34i02.5546"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Avni, G., Jecker, I., \u017dikeli\u0107, \u0110.: Infinite-duration all-pay bidding games. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 617\u2013636. SIAM (2021)","DOI":"10.1137\/1.9781611976465.38"},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0176-2680(98)00029-9","volume":"14","author":"Y Barut","year":"1998","unstructured":"Barut, Y., Kovenock, D.: The symmetric multiple prize all-pay auction with complete information. Eur. J. Polit. Econ. 14(4), 627\u2013644 (1998)","journal-title":"Eur. J. Polit. Econ."},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01211819","volume":"8","author":"MR Baye","year":"1996","unstructured":"Baye, M.R., Kovenock, D., De Vries, C.G.: The all-pay auction with complete information. Econ. Theor. 8(2), 291\u2013305 (1996)","journal-title":"Econ. Theor."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Boix-Adser\u00e0, E., Edelman, B.L., Jayanti, S.: The multiplayer colonel blotto game. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 47\u201348 (2020)","DOI":"10.1145\/3391403.3399555"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0165-1765(95)00766-0","volume":"50","author":"YK Che","year":"1996","unstructured":"Che, Y.K., Gale, I.: Expected revenue of all-pay auctions and first-price sealed-bid auctions with budget constraints. Econ. Lett. 50(3), 373\u2013379 (1996)","journal-title":"Econ. Lett."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10683-014-9421-0","volume":"18","author":"E Dechenaux","year":"2015","unstructured":"Dechenaux, E., Kovenock, D., Sheremeta, R.M.: A survey of experimental research on contests, all-pay auctions and tournaments. Exp. Econ. 18, 609\u2013669 (2015)","journal-title":"Exp. Econ."},{"key":"25_CR8","unstructured":"Dekel, E., Jackson, M.O., Wolinsky, A.: Jump bidding and budget constraints in all-pay auctions and wars of attrition. Technical Report, Discussion Paper (2007)"},{"key":"25_CR9","unstructured":"Dulleck, U., Frijters, P., Podczeck, K.: All-pay auctions with budget constraints and fair insurance. Technical Report, Working Paper (2006)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Dziubi\u0144ski, M., Jahn, K.: Discrete two player all-pay auction with complete information. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, pp. 2659\u20132666 (2023)","DOI":"10.24963\/ijcai.2023\/296"},{"issue":"1","key":"25_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1111\/j.1468-0343.1989.tb00003.x","volume":"1","author":"AL Hillman","year":"1989","unstructured":"Hillman, A.L., Riley, J.G.: Politically contestable rents and transfers. Econ. Polit. 1(1), 17\u201339 (1989)","journal-title":"Econ. Polit."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1016\/j.geb.2023.10.011","volume":"142","author":"SH Hwang","year":"2023","unstructured":"Hwang, S.H., Koh, Y., Lu, J.: Constrained contests with a continuum of battles. Games Econom. Behav. 142, 992\u20131011 (2023)","journal-title":"Games Econom. Behav."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/s00199-020-01272-2","volume":"71","author":"D Kovenock","year":"2021","unstructured":"Kovenock, D., Roberson, B.: Generalizations of the general lotto and colonel blotto games. Econ. Theor. 71, 997\u20131032 (2021)","journal-title":"Econ. Theor."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Nalebuff, B.J., Stiglitz, J.E.: Prizes and incentives: towards a general theory of compensation and competition. Bell J. Econ. 21\u201343 (1983)","DOI":"10.2307\/3003535"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00199-005-0071-5","volume":"29","author":"B Roberson","year":"2006","unstructured":"Roberson, B.: The colonel blotto game. Econ. Theor. 29(1), 1\u201324 (2006)","journal-title":"Econ. Theor."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00199-011-0673-z","volume":"51","author":"B Roberson","year":"2012","unstructured":"Roberson, B., Kvasov, D.: The non-constant-sum colonel blotto game. Econ. Theor. 51, 397\u2013433 (2012)","journal-title":"Econ. Theor."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:36:14Z","timestamp":1757324174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}