{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:09:33Z","timestamp":1743052173425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030629991"},{"type":"electronic","value":"9783030630003"}],"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-63000-3_4","type":"book-chapter","created":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:03:23Z","timestamp":1606694603000},"page":"42-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Three-Player Envy-Free Discrete Division Protocol for Mixed Manna"],"prefix":"10.1007","author":[{"given":"Yuki","family":"Okano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6312-257X","authenticated-orcid":false,"given":"Yoshifumi","family":"Manabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,30]]},"reference":[{"key":"4_CR1","unstructured":"Aleksandrov, M.: Jealousy-freeness and other common properties in fair division of mixed manna. arXiv preprint arXiv:2004.11469 (2020)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-58285-2_1","volume-title":"KI 2020: Advances in Artificial Intelligence","author":"M Aleksandrov","year":"2020","unstructured":"Aleksandrov, M., Walsh, T.: Two algorithms for additive and fair division of mixed manna. In: Schmid, U., Kl\u00fcgl, F., Wolter, D. (eds.) KI 2020. LNCS (LNAI), vol. 12325, pp. 3\u201317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58285-2_1"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of combinations of indivisible goods and chores. arXiv preprint arXiv:1807.10684 (2018)","DOI":"10.24963\/ijcai.2019\/8"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Mackenzie, S.: A discrete and bounded envy-free cake cutting protocol for any number of agents. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013427. IEEE (2016)","DOI":"10.1109\/FOCS.2016.52"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaya, E.: Dividing goods and bads under additive utilities. Higher School of Economics Research Paper No. WP BRP 153 (2016)","DOI":"10.2139\/ssrn.2826474"},{"issue":"6","key":"4_CR6","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., et al.: Competitive division of a mixed manna. Econometrica 85(6), 1847\u20131871 (2017)","journal-title":"Econometrica"},{"key":"4_CR7","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":"4_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Dehghani, S., Farhadi, A., HajiAghayi, M., Yami, H.: Envy-free chore division for an arbitrary number of agents. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2564\u20132583. SIAM (2018)","DOI":"10.1137\/1.9781611975031.164"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Farhadi, A., Hajiaghayi, M.T.: On the complexity of chore division. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 226\u2013232. AAAI Press (2018)","DOI":"10.24963\/ijcai.2018\/31"},{"key":"4_CR11","unstructured":"Garg, J., McGlaughlin, P.: Computing competitive equilibria with mixed manna. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 420\u2013428 (2020)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.05.041","volume":"593","author":"S Heydrich","year":"2015","unstructured":"Heydrich, S., van Stee, R.: Dividing connected chores fairly. Theor. Comput. Sci. 593, 51\u201361 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR13","first-page":"686","volume":"20","author":"Y Manabe","year":"2012","unstructured":"Manabe, Y., Okamoto, T.: Meta-envy-free cake-cutting and pie-cutting protocols. J. Inf. Process. 20(3), 686\u2013693 (2012)","journal-title":"J. Inf. Process."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1146\/annurev-economics-080218-025559","volume":"11","author":"H Moulin","year":"2019","unstructured":"Moulin, H.: Fair division in the age of internet. Annu. Rev. Econ. 11, 407\u2013441 (2019)","journal-title":"Annu. Rev. Econ."},{"key":"4_CR15","unstructured":"Okano, Y., Manabe, Y.: A three-player envy-free division protocol for mixed manna. In: Proceedings of International Conference on Information Technology and Computer Science (ICITCS 2018) (2018)"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/0025570X.2002.11953114","volume":"75","author":"E Peterson","year":"2002","unstructured":"Peterson, E., Su, F.E.: Four-person envy-free chore division. Math. Mag. 75(2), 117\u2013122 (2002)","journal-title":"Math. Mag."},{"issue":"7","key":"4_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2483852.2483870","volume":"56","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D.: Cake cutting: not just child\u2019s play. Commun. ACM 56(7), 78\u201387 (2013)","journal-title":"Commun. ACM"},{"key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-Cutting Algorithms: Be Fair if You Can","author":"J Robertson","year":"1998","unstructured":"Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair if You Can. AK Peters\/CRC Press, Boca Raton (1998)"},{"key":"4_CR19","unstructured":"Segal-Halevi, E.: Fairly dividing a cake after some parts were burnt in the oven. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1276\u20131284. International Foundation for Autonomous Agents and Multiagent Systems (2018)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63000-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T00:03:57Z","timestamp":1606694637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63000-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030629991","9783030630003"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63000-3_4","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":"30 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taoyuan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"9 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/tpnc2020\/","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":"24","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":"12","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":"50% - 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":"2","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)"}},{"value":"An invited paper is also included.","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)"}}]}}