{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:00:24Z","timestamp":1743145224103,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_3","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"41-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partial Allocations in\u00a0Budget-Feasible Mechanism Design: Bridging Multiple Levels of\u00a0Service and\u00a0Divisible Agents"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Amanatidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Klumper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Markakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artem","family":"Tsikiridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-662-54110-4_29","volume-title":"Web and Internet Economics","author":"G Amanatidis","year":"2016","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: Coverage, matching, and beyond: new results on budgeted mechanism design. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 414\u2013428. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_29"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-71924-5_1","volume-title":"Web and Internet Economics","author":"G Amanatidis","year":"2017","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: On budget-feasible mechanism design for symmetric submodular objectives. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 1\u201315. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_1"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Kleer, P., Sch\u00e4fer, G.: Budget-feasible mechanism design for non-monotone submodular objectives: offline and online. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, pp. 901\u2013919 (2019)","DOI":"10.1145\/3328526.3329622"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Klumper, S., Markakis, E., Sch\u00e4fer, G., Tsikiridis, A.: Partial allocations in budget-feasible mechanism design: bridging multiple levels of service and divisible agents. CoRR\/arXiv abs\/2307.07385 (2023)","DOI":"10.1007\/978-3-031-48974-7_3"},{"issue":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1287\/opre.2017.1693","volume":"66","author":"N Anari","year":"2018","unstructured":"Anari, N., Goel, G., Nikzad, A.: Budget feasible procurement auctions. Oper. Res. 66(3), 637\u2013652 (2018)","journal-title":"Oper. Res."},{"issue":"1","key":"3_CR6","first-page":"113","volume":"7","author":"KR Apt","year":"2022","unstructured":"Apt, K.R., Heering, J.: Characterization of incentive compatible single-parameter mechanisms revisited. J. Mech. Inst. Design 7(1), 113\u2013129 (2022)","journal-title":"J. Mech. Inst. Design"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Garimidi, P., Gkatzelis, V., Schoepflin, D., Tan, X.: Deterministic budget-feasible clock auctions. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, pp. 2940\u20132963 (2022)","DOI":"10.1137\/1.9781611977073.114"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.1137\/16M1067275","volume":"46","author":"X Bei","year":"2017","unstructured":"Bei, X., Chen, N., Gravin, N., Lu, P.: Worst-case mechanism design via Bayesian analysis. SIAM J. Comput. 46(4), 1428\u20131448 (2017)","journal-title":"SIAM J. Comput."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-13129-0_7","volume-title":"Web and Internet Economics","author":"H Chan","year":"2014","unstructured":"Chan, H., Chen, J.: Truthful multi-unit procurements with budgets. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 89\u2013105. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_7"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., Lu, P.: On the approximability of budget feasible mechanisms. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 685\u2013699 (2011)","DOI":"10.1137\/1.9781611973082.54"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Papadimitriou, C.H., Singer, Y.: Mechanisms for complement-free procurement. In: Proceedings of the 12th ACM Conference on Electronic Commerce, EC 2011, pp. 273\u2013282 (2011)","DOI":"10.1145\/1993574.1993615"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Goel, G., Nikzad, A., Singla, A.: Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets. In: Proceedings of the 23rd International Conference on World Wide Web, WWW 2014, pp. 279\u2013280 (2014)","DOI":"10.1145\/2567948.2577311"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3417746","volume":"8","author":"N Gravin","year":"2020","unstructured":"Gravin, N., Jin, Y., Lu, P., Zhang, C.: Optimal budget-feasible mechanisms for additive valuations. ACM Trans. Econ. Comput. (TEAC) 8(4), 1\u201315 (2020)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Huang, H., Han, K., Cui, S., Tang, J.: Randomized pricing with deferred acceptance for revenue maximization with submodular objectives. In: Proceedings of the ACM Web Conference 2023, pp. 3530\u20133540 (2023)","DOI":"10.1145\/3543507.3583477"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-030-04612-5_17","volume-title":"Web and Internet Economics","author":"P Jalaly Khalilabadi","year":"2018","unstructured":"Jalaly Khalilabadi, P., Tardos, \u00c9.: Simple and efficient budget feasible mechanisms for monotone submodular valuations. In: Christodoulou, G., Harks, T. (eds.) WINE 2018. LNCS, vol. 11316, pp. 246\u2013263. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04612-5_17"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-031-15714-1_5","volume-title":"Algorithmic Game Theory","author":"S Klumper","year":"2022","unstructured":"Klumper, S., Sch\u00e4fer, G.: Budget feasible mechanisms for procurement auctions with divisible agents. In: Kanellopoulos, P., Kyropoulou, M., Voudouris, A. (eds.) SAGT 2022. LNCS, vol. 13584, pp. 78\u201393. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15714-1_5"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-59250-3_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Leonardi","year":"2017","unstructured":"Leonardi, S., Monaco, G., Sankowski, P., Zhang, Q.: Budget feasible mechanisms on matroids. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 368\u2013379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_30"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10458-022-09563-9","volume":"36","author":"M Li","year":"2022","unstructured":"Li, M., Wang, C., Zhang, M.: Budget feasible mechanisms for facility location games with strategic facilities. Auton. Agent. Multi-Agent Syst. 36(2), 35 (2022)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"3_CR20","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. Wiley, Hoboken (1990)"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/704074","volume":"128","author":"P Milgrom","year":"2020","unstructured":"Milgrom, P., Segal, I.: Clock auctions and radio spectrum reallocation. J. Polit. Econ. 128(1), 1\u201331 (2020)","journal-title":"J. Polit. Econ."},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Math. Oper. Res. 6(1), 58\u201373 (1981)","journal-title":"Math. Oper. Res."},{"key":"3_CR23","unstructured":"Rubinstein, A., Zhao, J.: Beyond worst-case budget-feasible mechanism design. In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Singer, Y.: Budget feasible mechanisms. In: In Proceedings of the 51st Annual Symposium on Foundations of Computer Science, FOCS 2010, pp. 765\u2013774 (2010)","DOI":"10.1109\/FOCS.2010.78"}],"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-031-48974-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:02:30Z","timestamp":1703988150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","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":"Shanghai","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"221","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":"37","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":"0","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":"17% - 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":"8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}