{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:41:34Z","timestamp":1743126094138,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_17","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"258-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Fairness via Picking Sequences in Allocation of Indivisible Goods"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Gourv\u00e8s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Lesca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana\u00eblle","family":"Wilczynski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Birmpas, G., Markakis, E.: Comparing approximate relaxations of envy-freeness. In: Proceedings of IJCAI\u201918, pp. 42\u201348 (2018)","DOI":"10.24963\/ijcai.2018\/6"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., Bouveret, S., Lang, J., Mackenzie, S.: Complexity of manipulating sequential allocation. In: Proceedings of AAAI\u201917, pp. 328\u2013334 (2017)","DOI":"10.1609\/aaai.v31i1.10586"},{"key":"17_CR3","unstructured":"Aziz, H., Huang, X., Mattei, N., Segal-Halevi, E.: The constrained round robin algorithm for fair and efficient allocation. arXiv preprint arXiv:1908.00161 (2019)"},{"key":"17_CR4","unstructured":"Aziz, H., Walsh, T., Xia, L.: Possible and necessary allocations via sequential mechanisms. In: Proceedings of IJCAI\u201915, pp. 468\u2013474 (2015)"},{"key":"17_CR5","unstructured":"Bogomolnaia, A., Moulin, H., Stong, R.: Guarantees in fair division: general or monotone preferences. arXiv preprint arXiv:1911.10009 (2019)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bouveret, S., Chevaleyre, Y., Maudet, N.: Fair allocation of indivisible goods. In: Handbook of Computational Social Choice, chap. 12, pp. 284\u2013310. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.013"},{"key":"17_CR7","unstructured":"Bouveret, S., Lang, J.: A general elicitation-free protocol for allocating indivisible goods. In: Proceedings of IJCAI\u201911, pp. 73\u201378 (2011)"},{"key":"17_CR8","unstructured":"Bouveret, S., Lang, J.: Manipulating picking sequences. In: Proceedings of ECAI\u201914, pp. 141\u2013146 (2014)"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10458-015-9287-3","volume":"30","author":"S Bouveret","year":"2015","unstructured":"Bouveret, S., Lema\u00eetre, M.: Characterizing conflicts in fair division of indivisible goods using a scale of criteria. Auton. Agents Multi-Agent Syst. 30(2), 259\u2013290 (2015). https:\/\/doi.org\/10.1007\/s10458-015-9287-3","journal-title":"Auton. Agents Multi-Agent Syst."},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/B:THEO.0000024421.85722.0a","volume":"55","author":"SJ Brams","year":"2003","unstructured":"Brams, S.J., Edelman, P.H., Fishburn, P.C.: Fair division of indivisible items. Theory Decis. 55(2), 147\u2013180 (2003)","journal-title":"Theory Decis."},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1177\/1043463105058317","volume":"17","author":"SJ Brams","year":"2005","unstructured":"Brams, S.J., King, D.L.: Efficient fair division: help the worst off or avoid envy? Ration. Soc. 17(4), 387\u2013421 (2005)","journal-title":"Ration. Soc."},{"key":"17_CR12","volume-title":"The Win-Win Solution: Guaranteeing Fair Shares to Everybody","author":"SJ Brams","year":"2000","unstructured":"Brams, S.J., Taylor, A.D.: The Win-Win Solution: Guaranteeing Fair Shares to Everybody. WW Norton & Company, New York (2000)"},{"issue":"6","key":"17_CR13","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589\u2013610 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"17_CR15","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-12:32 (2019)","journal-title":"ACM Trans. Econ. Comput."},{"key":"17_CR16","unstructured":"Chakraborty, M., Igarashi, A., Suksompong, W., Zick, Y.: Weighted envy-freeness in indivisible item allocation. In: Proceedings of AAMAS\u201920, pp. 231\u2013239 (2020)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Freeman, R., Shah, N.: Fair public decision making. In: Proceedings of EC\u201917, pp. 629\u2013646 (2017)","DOI":"10.1145\/3033274.3085125"},{"issue":"1","key":"17_CR18","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Econ. Essays"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Kalinowski, T., Narodytska, N., Walsh, T., Xia, L.: Strategic behavior when allocating indivisible goods sequentially. In: Proceedings of AAAI\u201913, pp. 452\u2013458 (2013)","DOI":"10.1609\/aaai.v27i1.8697"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/opre.19.2.270","volume":"19","author":"DA Kohler","year":"1971","unstructured":"Kohler, D.A., Chandrasekaran, R.: A class of sequential games. Oper. Res. 19(2), 270\u2013277 (1971)","journal-title":"Oper. Res."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Kurokawa, D., Procaccia, A.D., Wang, J.: When can the maximin share guarantee be guaranteed? In: Proceedings of AAAI\u201916, pp. 523\u2013529 (2016)","DOI":"10.1609\/aaai.v30i1.10041"},{"key":"17_CR22","series-title":"Springer Texts in Business and Economics","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-662-47904-9_8","volume-title":"Economics and Computation","author":"J Lang","year":"2016","unstructured":"Lang, J., Rothe, J.: Fair division of indivisible goods. In: Rothe, J. (ed.) Economics and Computation. STBE, pp. 493\u2013550. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-47904-9_8"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of EC\u201904, pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"17_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400864140","volume-title":"Cooperative Microeconomics: A Game-Theoretic Introduction","author":"H Moulin","year":"1995","unstructured":"Moulin, H.: Cooperative Microeconomics: A Game-Theoretic Introduction. Princeton University Press, Princeton (1995)"},{"issue":"1","key":"17_CR25","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 internet age. Ann. Rev. Econ. 11(1), 407\u2013441 (2019)","journal-title":"Ann. Rev. Econ."},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D.: Cake cutting algorithms. In: Handbook of Computational Social Choice, pp. 311\u2013330. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.014"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of EC\u201914, pp. 675\u2013692 (2014)","DOI":"10.1145\/2600057.2602835"},{"issue":"1","key":"17_CR28","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1), 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"17_CR29","unstructured":"Tominaga, Y., Todo, T., Yokoo, M.: Manipulations in two-agent sequential allocation with random sequences. In: Proceedings of AAMAS\u201916, pp. 141\u2013149 (2016)"},{"issue":"1","key":"17_CR30","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:02:08Z","timestamp":1673647328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","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":"58","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":"27","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":"47% - 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":"7","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)"}}]}}