{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:33:21Z","timestamp":1743064401202,"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_21","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"366-383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polyhedral Clinching Auctions for\u00a0Indivisible Goods"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4784-5110","authenticated-orcid":false,"given":"Hiroshi","family":"Hirai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9575-0514","authenticated-orcid":false,"given":"Ryosuke","family":"Sato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"5","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1257\/0002828043052330","volume":"94","author":"LM Ausubel","year":"2004","unstructured":"Ausubel, L.M.: An efficient ascending-bid auction for multiple objects. Am. Econ. Rev. 94(5), 1452\u20131475 (2004)","journal-title":"Am. Econ. Rev."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Conitzer, V., Munagala, K., Xia, L.: Incentive compatible budget elicitation in multi-unit auctions. In: SODA, pp. 554\u2013572 (2010)","DOI":"10.1137\/1.9781611973075.47"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/opre.1100.0888","volume":"59","author":"S Bikhchandani","year":"2011","unstructured":"Bikhchandani, S., de Vries, S., Schummer, J., Vohra, R.V.: An ascending vickrey auction for selling bases of a matroid. Oper. Res. 59(2), 400\u2013413 (2011)","journal-title":"Oper. Res."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Colini-Baldeschi, R., Leonardi, S., Henzinger, M., Starnberger, M.: On multiple keyword sponsored search auctions with budgets. ACM Trans. Econ. Comput. 4(1), 2:1\u20132:34 (2015)","DOI":"10.1145\/2818357"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Ha, B.Q., Hartline, J.D.: Prior-free auctions for budgeted agents. In: EC, pp. 287\u2013304 (2013)","DOI":"10.1145\/2482540.2482554"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.geb.2011.08.003","volume":"74","author":"S Dobzinski","year":"2012","unstructured":"Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. Games Econ. Behav. 74(2), 486\u2013503 (2012)","journal-title":"Games Econ. Behav."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Leme, R.P.: Efficiency guarantees in auctions with budgets. In: ICALP, pp. 392\u2013404 (2014)","DOI":"10.1007\/978-3-662-43948-7_33"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Henzinger, M., Starnberger, M.: Auctions for heterogeneous items and budget limits. ACM Trans. Econ. Comput. 4(1), 4:1\u20134:17 (2015)","DOI":"10.1145\/2818351"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1257\/aer.97.1.242","volume":"97","author":"B Edelman","year":"2007","unstructured":"Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second-price auction: selling billions of dollars worth of keywords. Am. Econ. Rev. 97(1), 242\u2013259 (2007)","journal-title":"Am. Econ. Rev."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Fiat, A., Leonardi, S., Saia, J., Sankowski, P.: Single valued combinatorial auctions with budgets. In: EC, pp. 223\u2013232 (2011)","DOI":"10.1145\/1993574.1993609"},{"key":"21_CR11","unstructured":"Goel, G., Leonardi, S., Mirrokni, V., Nikzad, A., Leme, R.P.: Reservation exchange markets for internet advertising. In: ICALP, pp. 142:1\u2013142:13 (2016)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Goel, G., Mirrokni, V., Leme, R.P.: Clinching auctions beyond hard budget constraints. In: EC, pp. 167\u2013184 (2014)","DOI":"10.1145\/2600057.2602851"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Goel, G., Mirrokni, V., Leme, R.P.: Polyhedral clinching auctions and the adwords polytope. J. ACM 62(3), 18:1\u201318:27 (2015)","DOI":"10.1145\/2757277"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.geb.2015.11.008","volume":"123","author":"G Goel","year":"2020","unstructured":"Goel, G., Mirrokni, V., Leme, R.P.: Clinching auctions with online supply. Games Econ. Behav. 123, 342\u2013358 (2020)","journal-title":"Games Econ. Behav."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Hirai, H., Sato, R.: Polyhedral clinching auctions for indivisible goods (2023). https:\/\/arxiv.org\/abs\/2303.00231","DOI":"10.1007\/978-3-031-48974-7_21"},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1287\/moor.2021.1124","volume":"47","author":"H Hirai","year":"2022","unstructured":"Hirai, H., Sato, R.: Polyhedral clinching auctions for two-sided markets. Math. Oper. Res. 47(1), 259\u2013285 (2022)","journal-title":"Math. Oper. Res."},{"key":"21_CR17","volume-title":"Auction Theory","author":"V Krishna","year":"2010","unstructured":"Krishna, V.: Auction Theory, 2nd edn. Academic Press, San Diego (2010)","edition":"2"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Sidford, A., Wong, S.C.W.: A faster cutting plane method and its implications for combinatorial and convex optimization. In: FOCS, pp. 1049\u20131065 (2015)","DOI":"10.1109\/FOCS.2015.68"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.geb.2005.02.006","volume":"55","author":"B Lehmann","year":"2006","unstructured":"Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270\u2013296 (2006)","journal-title":"Games Econ. Behav."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Lu, P., Xiao, T.: Improved efficiency guarantees in auctions with budgets. In: EC, pp. 397\u2013413 (2015)","DOI":"10.1145\/2764468.2764500"},{"key":"21_CR21","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.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"21_CR22","unstructured":"Sato, R.: Polyhedral clinching auctions with a single sample (2023). https:\/\/arxiv.org\/abs\/2302.03458"},{"key":"21_CR23","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Syrgkanis, V., Tardos, E.: Composable and efficient mechanisms. In: STOC, pp. 211\u2013220 (2013)","DOI":"10.1145\/2488608.2488635"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:04:51Z","timestamp":1703988291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_21"}},"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_21","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)"}}]}}