{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:57:55Z","timestamp":1742936275293,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031393433"},{"type":"electronic","value":"9783031393440"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39344-0_1","type":"book-chapter","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:10Z","timestamp":1692995230000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Understanding the\u00a0Relationship Between Core Constraints and\u00a0Core-Selecting Payment Rules in\u00a0Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Robin","family":"Fritsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Younjoo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,26]]},"reference":[{"issue":"605","key":"1_CR1","doi-asserted-by":"publisher","first-page":"F334","DOI":"10.1111\/ecoj.12404","volume":"127","author":"LM Ausubel","year":"2017","unstructured":"Ausubel, L.M., Baranov, O.: A practical guide to the combinatorial clock auction. Econ. J. 127(605), F334\u2013F350 (2017). https:\/\/doi.org\/10.1111\/ecoj.12404","journal-title":"Econ. J."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00182-019-00691-3","volume":"49","author":"LM Ausubel","year":"2020","unstructured":"Ausubel, L.M., Baranov, O.: Core-selecting auctions with incomplete information. Int. J. Game Theory 49(1), 251\u2013273 (2020)","journal-title":"Int. J. Game Theory"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ausubel, L.M., Milgrom, P., et al.: The lovely but lonely Vickrey auction. Comb. Auctions 17, 22\u201326 (2006). https:\/\/www.researchgate.net\/profile\/Paul_Milgrom\/publication\/247926036_The_Lovely_but_Lonely_Vickrey_Auction\/links\/54bdcfe10cf27c8f2814ce6e\/The-Lovely-but-Lonely-Vickrey-Auction.pdf","DOI":"10.7551\/mitpress\/9780262033428.003.0002"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Seuken, S., Lubin, B.: A faster core constraint generation algorithm for combinatorial auctions. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29, no. 1 (2015). https:\/\/doi.org\/10.1609\/aaai.v29i1.9289. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/9289","DOI":"10.1609\/aaai.v29i1.9289"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1613\/jair.1.11525","volume":"69","author":"V Bosshard","year":"2020","unstructured":"Bosshard, V., B\u00fcnz, B., Lubin, B., Seuken, S.: Computing Bayes-Nash equilibria in combinatorial auctions with verification. J. Artif. Intell. Res. 69, 531\u2013570 (2020)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bosshard, V., Seuken, S.: The cost of simple bidding in combinatorial auctions. arXiv:2011.12237 (2020)","DOI":"10.1145\/3465456.3467609"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bosshard, V., Wang, Y., Seuken, S.: Non-decreasing payment rules for combinatorial auctions. In: IJCAI, pp. 105\u2013113 (2018)","DOI":"10.24963\/ijcai.2018\/15"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-019-09440-y","volume":"34","author":"H Cheng","year":"2020","unstructured":"Cheng, H., Zhang, W., Zhang, Y., Zhang, L., Wu, J., Wang, C.: Fast core pricing algorithms for path auction. Auton. Agent. Multi-Agent Syst. 34(1), 1\u201337 (2020). https:\/\/doi.org\/10.1007\/s10458-019-09440-y","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"issue":"3\u20134","key":"1_CR10","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00182-007-0100-7","volume":"36","author":"R Day","year":"2008","unstructured":"Day, R., Milgrom, P.: Core-selecting package auctions. Int. J. Game Theory 36(3\u20134), 393\u2013407 (2008). https:\/\/doi.org\/10.1007\/s00182-007-0100-7","journal-title":"Int. J. Game Theory"},{"issue":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1110.1024","volume":"60","author":"RW Day","year":"2012","unstructured":"Day, R.W., Cramton, P.: Quadratic core-selecting payment rules for combinatorial auctions. Oper. Res. 60(3), 588\u2013603 (2012)","journal-title":"Oper. Res."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Day, R.W., Raghavan, S.: Fair payments for efficient allocations in public sector combinatorial auctions. Manag. Sci. 53(9), 1389\u20131406 (2007). https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/mnsc.1060.0662","DOI":"10.1287\/mnsc.1060.0662"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.3982\/TE1198","volume":"11","author":"JK Goeree","year":"2016","unstructured":"Goeree, J.K., Lien, Y.: On the impossibility of core-selecting auctions. Theor. Econ. 11(1), 41\u201352 (2016)","journal-title":"Theor. Econ."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in teams. Econometrica: J. Econometric Soc. 617\u2013631 (1973)","DOI":"10.2307\/1914085"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-35389-6_20","volume-title":"Web and Internet Economics","author":"E Markakis","year":"2019","unstructured":"Markakis, E., Tsikiridis, A.: On core-selecting and core-competitive mechanisms for binary single-parameter auctions. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 271\u2013285. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_20"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF02706244","volume":"30","author":"Y Narahari","year":"2005","unstructured":"Narahari, Y., Dayama, P.: Combinatorial auctions for electronic business. Sadhana 30(2), 179\u2013211 (2005)","journal-title":"Sadhana"},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1287\/opre.2021.2104","volume":"70","author":"R Niazadeh","year":"2022","unstructured":"Niazadeh, R., Hartline, J., Immorlica, N., Khani, M.R., Lucier, B.: Fast core pricing for rich advertising auctions. Oper. Res. 70(1), 223\u2013240 (2022)","journal-title":"Oper. Res."},{"key":"1_CR18","unstructured":"Ott, M., Beck, M., et al.: Incentives for overbidding in minimum-revenue core-selecting auctions. In: VfS Annual Conference 2013 (Duesseldorf): Competition Policy and Regulation in a Global Economic Order, no. 79946, Verein f\u00fcr Socialpolitik\/German Economic Association (2013)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Rassenti, S.J., Smith, V.L., Bulfin, R.L.: A combinatorial auction mechanism for airport time slot allocation. Bell J. Econ. 402\u2013417 (1982)","DOI":"10.2307\/3003463"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/j.geb.2010.11.003","volume":"72","author":"R Sano","year":"2011","unstructured":"Sano, R.: Incentives in core-selecting auctions with single-minded bidders. Games Econom. Behav. 72(2), 602\u2013606 (2011)","journal-title":"Games Econom. Behav."},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Financ. 16(1), 8\u201337 (1961)","journal-title":"J. Financ."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39344-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:27Z","timestamp":1692995247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39344-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031393433","9783031393440"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39344-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.cis.um.edu.mo\/ijtcs2023\/index.html","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":"34","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":"21","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":"62% - 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":"4","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)"}}]}}