{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:30:47Z","timestamp":1742952647246,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_27","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"384-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Consensus Halving for Sets of Items"],"prefix":"10.1007","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros","family":"Hollender","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayumi","family":"Igarashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasin","family":"Manurangsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warut","family":"Suksompong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0001-8708(87)90055-7","volume":"63","author":"N Alon","year":"1987","unstructured":"Alon, N.: Splitting necklaces. Adv. Math. 63(3), 247\u2013253 (1987)","journal-title":"Adv. Math."},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 53\u201359 (2019)","DOI":"10.24963\/ijcai.2019\/8"},{"issue":"6","key":"27_CR3","doi-asserted-by":"publisher","first-page":"1847","DOI":"10.3982\/ECTA14564","volume":"85","author":"A Bogomolnaia","year":"2017","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaya, E.: Competitive division of a mixed manna. Econometrica 85(6), 1847\u20131871 (2017)","journal-title":"Econometrica"},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From Cake-Cutting to Dispute Resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)"},{"key":"27_CR5","volume-title":"The Win-Win Solution: Guaranteeing Fair Shares to Everybody","author":"SJ Brams","year":"1999","unstructured":"Brams, S.J., Taylor, A.D.: The Win-Win Solution: Guaranteeing Fair Shares to Everybody. W. W. Norton & Company, New York (1999)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. ACM Trans. Econ. Comput. 7(3), 12:1\u201312:2 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 14:1\u201314:57 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. SIAM J. Comput. 39(1), 195\u2013259 (2009)","journal-title":"SIAM J. Comput."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., Goldberg, P.W.: Consensus halving is PPA-complete. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 51\u201364 (2018)","DOI":"10.1145\/3188745.3188880"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., Goldberg, P.W.: The complexity of splitting necklaces and bisecting ham sandwiches. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 638\u2013649 (2019)","DOI":"10.1145\/3313276.3316334"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Filos-Ratsikas, A., Hollender, A., Sotiraki, K., Zampetakis, M.: Consensus-halving: does it ever get easier? In: Proceedings of the 21st ACM Conference on Economics and Computation (EC), pp. 381\u2013399 (2020)","DOI":"10.1145\/3391403.3399527"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0606010","volume":"6","author":"CH Goldberg","year":"1985","unstructured":"Goldberg, C.H., West, D.B.: Bisection of circle colorings. SIAM J. Algebraic Discrete Methods 6(1), 93\u2013106 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Goldberg, P.W., Hollender, A., Igarashi, A., Manurangsi, P., Suksompong, W.: Consensus halving for sets of items. CoRR abs\/2007.06754 (2020)","DOI":"10.1007\/978-3-030-64946-3_27"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1007\/s10878-018-0327-1","volume":"37","author":"L Gourv\u00e8s","year":"2018","unstructured":"Gourv\u00e8s, L.: Agreeable sets with matroidal constraints. J. Comb. Optim. 37(3), 866\u2013888 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0327-1","journal-title":"J. Comb. Optim."},{"issue":"4","key":"27_CR15","first-page":"665","volume":"16","author":"CR Hobby","year":"1965","unstructured":"Hobby, C.R., Rice, J.R.: A moment problem in L1 approximation. Proc. Am. Math. Soc. 16(4), 665\u2013670 (1965)","journal-title":"Proc. Am. Math. Soc."},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Kyropoulou, M., Suksompong, W., Voudouris, A.A.: Almost envy-freeness in group resource allocation. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), pp. 400\u2013406 (2019)","DOI":"10.24963\/ijcai.2019\/57"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.mathsocsci.2017.05.006","volume":"89","author":"P Manurangsi","year":"2017","unstructured":"Manurangsi, P., Suksompong, W.: Asymptotic existence of fair divisions for groups. Math. Soc. Sci. 89, 100\u2013108 (2017)","journal-title":"Math. Soc. Sci."},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.artint.2018.10.001","volume":"268","author":"P Manurangsi","year":"2019","unstructured":"Manurangsi, P., Suksompong, W.: Computing a small agreeable set of indivisible items. Artif. Intell. 268, 96\u2013114 (2019)","journal-title":"Artif. Intell."},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2003","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)"},{"issue":"1","key":"27_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02414140","volume":"103","author":"O Onicescu","year":"1974","unstructured":"Onicescu, O.: Un th\u00e9or\u00e8me d\u2019existence. Annali di Matematica Pura ed Applicata 103(1), 1\u20132 (1974). https:\/\/doi.org\/10.1007\/BF02414140","journal-title":"Annali di Matematica Pura ed Applicata"},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. SIAM J. Discrete Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discrete Math."},{"key":"27_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316779309","volume-title":"Twenty Lectures on Algorithmic Game Theory","author":"T Roughgarden","year":"2016","unstructured":"Roughgarden, T.: Twenty Lectures on Algorithmic Game Theory. Cambridge University Press, Cambridge (2016)"},{"issue":"3","key":"27_CR23","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/15M1039274","volume":"47","author":"A Rubinstein","year":"2018","unstructured":"Rubinstein, A.: Inapproximability of Nash equilibrium. SIAM J. Comput. 47(3), 917\u2013959 (2018)","journal-title":"SIAM J. Comput."},{"key":"27_CR24","unstructured":"Sandomirskiy, F., Segal-Halevi, E.: Fair division with minimal sharing. CoRR abs\/1908.01669 (2019)"},{"issue":"4","key":"27_CR25","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00355-019-01210-9","volume":"53","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi, E., Nitzan, S.: Fair cake-cutting among families. Soc. Choice Welf. 53(4), 709\u2013740 (2019). https:\/\/doi.org\/10.1007\/s00355-019-01210-9","journal-title":"Soc. Choice Welf."},{"issue":"1","key":"27_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0165-4896(02)00087-2","volume":"45","author":"FW Simmons","year":"2003","unstructured":"Simmons, F.W., Su, F.E.: Consensus-halving via theorems of Borsuk-Ulam and Tucker. Math. Soc. Sci. 45(1), 15\u201325 (2003)","journal-title":"Math. Soc. Sci."},{"key":"27_CR27","unstructured":"Suksompong, W.: Assigning a small agreeable set of indivisible items to multiple players. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), pp. 489\u2013495 (2016)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T18:29:12Z","timestamp":1618597752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","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":"Beijing","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","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":"31","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":"11","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":"23% - 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)"}}]}}