乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:23:10Z","timestamp":1725859390956},"reference-count":102,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["712\/20"],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10458-022-09545-x","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T06:03:47Z","timestamp":1643868227000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Redividing the cake"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7497-5834","authenticated-orcid":false,"given":"Erel","family":"Segal-Halevi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"issue":"4","key":"9545_CR1","first-page":"425","volume":"2","author":"A Abdulkadiro\u011flu","year":"2020","unstructured":"Abdulkadiro\u011flu, A., Che, Y.-K., Pathak, P. A., Roth, A. E., & Tercieux, O. (2020). Efficiency, justified envy, and incentives in priority-based matching. American Economic Review: Insights, 2(4), 425\u201342.","journal-title":"American Economic Review: Insights"},{"key":"9545_CR2","unstructured":"Anna, A., & Wiese, A. (2015). A quasi-PTAS for the two-dimensional geometric knapsack problem. In Proceedings of the SODA\u201915 (pp. 1491\u20131505). SIAM."},{"issue":"1","key":"9545_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ejor.2018.12.048","volume":"276","author":"A Agnetis","year":"2019","unstructured":"Agnetis, A., Chen, B., Nicosia, G., & Pacifici, A. (2019). Price of fairness in two-agent single-machine scheduling problems. European Journal of Operational Research, 276(1), 79\u201387.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9545_CR4","doi-asserted-by":"publisher","first-page":"2242","DOI":"10.1137\/16M110407X","volume":"32","author":"A Arseniy","year":"2018","unstructured":"Arseniy, A., & Segal-Halevi, E. (2018). Counting blanks in polygonal arrangements. SIAM Journal on Discrete Mathematics, 32(3), 2242.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9545_CR5","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., & Walsh, T. (2015). Online fair division: Analysing a food bank problem. In Proceedings of the IJCAI\u201915 (pp. 2540\u20132546)."},{"issue":"1","key":"9545_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10726-018-9596-4","volume":"28","author":"F Aleskerov","year":"2019","unstructured":"Aleskerov, F., & Shvydun, S. (2019). Allocation of disputable zones in the arctic region. Group Decision and Negotiation, 28(1), 11\u201342.","journal-title":"Group Decision and Negotiation"},{"key":"9545_CR7","unstructured":"Anari, N., Gharan, S. O., Saberi, A., & Singh, M. (2017). Nash social welfare, matrix permanent, and stable polynomials. In 8th Innovations in theoretical computer science conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"issue":"5","key":"9545_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01769706","volume":"10","author":"EM Arkin","year":"1993","unstructured":"Arkin, E. M., Khuller, S., & Mitchell, J. S. B. (1993). Geometric knapsack problems. Algorithmica, 10(5), 399\u2013427.","journal-title":"Algorithmica"},{"key":"9545_CR9","unstructured":"Arunachaleswaran, E. R., & Gopalakrishnan, R. (2018). The price of indivisibility in cake cutting. arXiv preprint arXiv:1801.08341"},{"key":"9545_CR10","unstructured":"Arzi, O. (2012). Cake cutting: Achieving efficiency while maintaining fairness. Master\u2019s Thesis, Bar-Ilan University, October 2012. Under the supervision of Prof. Yonatan Aumann."},{"issue":"4","key":"9545_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2781776","volume":"3","author":"Y Aumann","year":"2015","unstructured":"Aumann, Y., & Dombb, Y. (2015). The efficiency of fair division with connected pieces. ACM Transactions on Economics and Computation, 3(4), 1\u201316.","journal-title":"ACM Transactions on Economics and Computation"},{"key":"9545_CR12","unstructured":"Aumann, Y., Dombb, Y., & Hassidim, A. (2013). Computing socially-efficient cake divisions. In Proceedings of the AAMAS\u201913 (pp. 343\u2013350)."},{"key":"9545_CR13","doi-asserted-by":"crossref","unstructured":"Aziz, H., & Ye, C. (2014). Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In T.-Y. Liu, Q. Qi, & Y. Ye (Eds.), Proceedings of the WINE\u201914. Lecture Notes in Computer Science (Vol. 8877, pp. 1\u201314). Springer.","DOI":"10.1007\/978-3-319-13129-0_1"},{"issue":"6","key":"9545_CR14","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1080\/00029890.2009.11920966","volume":"116","author":"JB Barbanel","year":"2009","unstructured":"Barbanel, J. B., Brams, S. J., & Stromquist, W. (2009). Cutting a pie is not a piece of cake. The American Mathematical Monthly, 116(6), 496\u2013514.","journal-title":"The American Mathematical Monthly"},{"key":"9545_CR15","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S. K., & Vaish, R. (2018). Finding fair and efficient allocations. In Proceedings of the 2018 ACM conference on economics and computation (pp. 557\u2013574). ACM. arXiv preprint arXiv:1707.04731","DOI":"10.1145\/3219166.3219176"},{"key":"9545_CR16","doi-asserted-by":"crossref","unstructured":"Barman, S., Bhaskar, U., & Shah, N. (2020). Optimal bounds on the price of fairness for indivisible goods. In Proceedings of the WINE\u201920 (pp. 356\u2013369). Springer.","DOI":"10.1007\/978-3-030-64946-3_25"},{"issue":"2","key":"9545_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00029890.1987.12000609","volume":"94","author":"A Beck","year":"1987","unstructured":"Beck, A. (1987). Constructing a fair border. The American Mathematical Monthly, 94(2), 157\u2013162.","journal-title":"The American Mathematical Monthly"},{"key":"9545_CR18","doi-asserted-by":"crossref","unstructured":"Bei, X., & Suksompong, W. (2021). Dividing a graphical cake. In Proceedings of the AAAI\u201921. Forthcoming. Available at arXiv:1910.14129","DOI":"10.1609\/aaai.v35i6.16652"},{"key":"9545_CR19","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., & Yang, E. (2012). Optimal proportional cake cutting with connected pieces. In Proceedings of the AAAI\u201912 (pp. 1263\u20131269)."},{"key":"9545_CR20","unstructured":"Bei, X., Igarashi, A., Lu, X., & Suksompong, W. (2019). The price of connectivity in fair division. arXiv preprint arXiv:1908.05433."},{"key":"9545_CR21","doi-asserted-by":"crossref","unstructured":"Bei, X., Lu, X., Manurangsi, P., & Suksompong, W. (2019). The price of fairness for indivisible goods. In Proceedings of the IJCAI\u201919.","DOI":"10.24963\/ijcai.2019\/12"},{"key":"9545_CR22","doi-asserted-by":"crossref","unstructured":"Benade, G., Kazachkov, A.\u00a0M., Procaccia, A.\u00a0D., & Psomas, C.-A. (2018). How to make envy vanish over time. In Proceedings of the EC\u201918 (pp. 593\u2013610).","DOI":"10.1145\/3219166.3219179"},{"issue":"5","key":"9545_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/S0304-4068(03)00077-6","volume":"40","author":"M Berliant","year":"2004","unstructured":"Berliant, M., & Dunz, K. (2004). A foundation of location theory: Existence of equilibrium, the welfare theorems, and core. Journal of Mathematical Economics, 40(5), 593\u2013618.","journal-title":"Journal of Mathematical Economics"},{"issue":"3","key":"9545_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-4068(92)90001-N","volume":"21","author":"M Berliant","year":"1992","unstructured":"Berliant, M., Thomson, W., & Dunz, K. (1992). On the fair division of a heterogeneous commodity. Journal of Mathematical Economics, 21(3), 201\u2013216.","journal-title":"Journal of Mathematical Economics"},{"issue":"4","key":"9545_CR25","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1111\/1471-0366.00042","volume":"2","author":"H Bernstein","year":"2002","unstructured":"Bernstein, H. (2002). Land reform: Taking a long(er) view. Journal of Agrarian Change, 2(4), 433\u2013463.","journal-title":"Journal of Agrarian Change"},{"issue":"1","key":"9545_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2011). The price of fairness. Operations Research, 59(1), 17\u201331.","journal-title":"Operations Research"},{"issue":"12","key":"9545_CR27","doi-asserted-by":"publisher","first-page":"2234","DOI":"10.1287\/mnsc.1120.1549","volume":"58","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2012). On the efficiency-fairness trade-off. Management Science, 58(12), 2234\u20132250.","journal-title":"Management Science"},{"key":"9545_CR28","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., & Moscardelli, L. (2018). Pricing problems with buyer preselection. In 43rd International symposium on mathematical foundations of computer science (MFCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"issue":"3\u20134","key":"9545_CR29","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00182-007-0108-z","volume":"36","author":"SJ Brams","year":"2008","unstructured":"Brams, S. J., Jones, M., & Klamler, C. (2008). Proportional pie-cutting. International Journal of Game Theory, 36(3\u20134), 353\u2013367.","journal-title":"International Journal of Game Theory"},{"key":"9545_CR30","unstructured":"Brams, S.\u00a0J., Feldman, M., Lai, J.\u00a0K., Morgenstern, J., & Procaccia, A.\u00a0D. (2012). On maxsum fair cake divisions. In Proceedings of the AAAI\u201912 (pp. 1285\u20131291)."},{"key":"9545_CR31","unstructured":"Br\u00e2nzei, S., & Miltersen, P.\u00a0B. (2015). A dictatorship theorem for cake cutting. In Proceedings of the IJCAI\u201915 (pp. 482\u2013488). AAAI Press"},{"key":"9545_CR32","unstructured":"Caragiannis, I., Lai, J.\u00a0K., & Procaccia, A.\u00a0D. (2011). Towards more expressive cake cutting. In Proceedings of the IJCAI\u201911 (pp. 127\u2013132). AAAI Press"},{"issue":"4","key":"9545_CR33","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. (2012). The efficiency of fair division. Theory of Computing Systems, 50(4), 589\u2013610.","journal-title":"Theory of Computing Systems"},{"key":"9545_CR34","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Gravin, N., & Huang, X. (2019). Envy-freeness up to any item with high nash welfare: The virtue of donating items. In Proceedings of the 2019 ACM conference on economics and computation (pp. 527\u2013545).","DOI":"10.1145\/3328526.3329574"},{"key":"9545_CR35","doi-asserted-by":"crossref","unstructured":"Cohler, Y.\u00a0J., Lai, J.\u00a0K., Parkes, D.\u00a0C., & Procaccia, A.\u00a0D. (2011). Optimal Envy-free cake cutting. In Proceedings of the AAAI\u201911 (pp. 626\u2013631).","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"9545_CR36","doi-asserted-by":"crossref","unstructured":"Cole, R., & Gkatzelis, V. (2015). Approximating the nash social welfare with indivisible items. In Proceedings of the forty-seventh annual ACM symposium on Theory of computing (pp. 371\u2013380).","DOI":"10.1145\/2746539.2746589"},{"key":"9545_CR37","doi-asserted-by":"crossref","unstructured":"Cole, R., Devanur, N., Gkatzelis, V., Jain, K., Mai, T., Vazirani, V.\u00a0V., & Yazdanbod, S. (2017). Convex program duality, fisher markets, and nash social welfare. In Proceedings of the 2017 ACM conference on economics and computation (pp. 459\u2013460).","DOI":"10.1145\/3033274.3085109"},{"issue":"3","key":"9545_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3380742","volume":"16","author":"\u00c1 Cseh","year":"2020","unstructured":"Cseh, \u00c1., & Fleiner, T. (2020). The complexity of cake cutting with unequal shares. ACM Transactions on Algorithms, 16(3), 1\u201321.","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"9545_CR39","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.geb.2008.04.006","volume":"66","author":"M Dall\u2019Aglio","year":"2009","unstructured":"Dall\u2019Aglio, M., & Maccheroni, F. (2009). Disputed lands. Games and Economic Behavior, 66(1), 57\u201377.","journal-title":"Games and Economic Behavior"},{"key":"9545_CR40","doi-asserted-by":"crossref","unstructured":"Delimitrou, C., & Kozyrakis, C. (2014). Quasar: Resource-efficient and QoS-aware cluster management. In Proceedings of the ASPLOS\u201914 (pp. 127\u2013144). New York, NY: ACM.","DOI":"10.1145\/2644865.2541941"},{"key":"9545_CR41","unstructured":"Devulapalli, R. (2014). Geometric partitioning algorithms for fair division of geographic resources. PhD Thesis, University of Minnesota."},{"key":"9545_CR42","doi-asserted-by":"crossref","unstructured":"Dickerson, J.\u00a0P., Procaccia, A.\u00a0D., & Sandholm, T. (2014). Price of fairness in kidney exchange. In Proceedings of the AAMAS\u201914 (pp. 1013\u20131020). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.","DOI":"10.1097\/00007890-201407151-02779"},{"key":"9545_CR43","unstructured":"Dmitry. (2021). Maximal expansion of a convex polygon. Computer Science Stack Exchange. https:\/\/cs.stackexchange.com\/q\/135878 (version: 2021-02-25)."},{"issue":"1","key":"9545_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L. E., & Spanier, E. H. (1961). How to cut a cake fairly. The American Mathematical Monthly, 68(1), 1\u201317.","journal-title":"The American Mathematical Monthly"},{"key":"9545_CR45","doi-asserted-by":"crossref","unstructured":"Edmonds, J., & Pruhs, K. (2006). Balanced allocations of cake. In FOCS (Vol.\u00a047, pp. 623\u2013634). IEEE Computer Society.","DOI":"10.1109\/FOCS.2006.17"},{"key":"9545_CR46","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K., & Solanki, J. (2008). Confidently cutting a cake into approximately fair pieces. In Algorithmic aspects in information and management (pp. 155\u2013164).","DOI":"10.1007\/978-3-540-68880-8_16"},{"key":"9545_CR47","doi-asserted-by":"crossref","unstructured":"Elkind, E., Segal-Halevi, E., & Suksompong, W. (2021). Mind the gap: Cake cutting with separation. In Proceedings of the AAAI\u201921. Forthcoming. Available at arXiv:2012.06682","DOI":"10.1609\/aaai.v35i6.16672"},{"key":"9545_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11409-0_1","volume-title":"Graph-theoretic concepts in computer science","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D. (2010). Graph-theoretic solutions to computational geometry problems. Lecture Notes in Computer Science. In C. Paul & M. Habib (Eds.), Graph-theoretic concepts in computer science (Vol. 5911, pp. 1\u201316). Springer."},{"issue":"3","key":"9545_CR49","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0166-218X(84)90005-2","volume":"7","author":"S Even","year":"1984","unstructured":"Even, S., & Paz, A. (1984). A note on cake cutting. Discrete Applied Mathematics, 7(3), 285\u2013296.","journal-title":"Discrete Applied Mathematics"},{"key":"9545_CR50","doi-asserted-by":"crossref","unstructured":"Friedman, E., Psomas, C.\u00a0A., & Vardi, S. (2015). Dynamic fair division with minimal disruptions. In Proceedings of the EC\u201915 (pp. 697\u2013713). ACM. Extended version available at http:\/\/www.shaivardi.com\/research\/DFRD.pdf","DOI":"10.1145\/2764468.2764495"},{"key":"9545_CR51","doi-asserted-by":"crossref","unstructured":"Friedman, E., Psomas, C.-A., & Vardi, S. (2017). Controlled dynamic fair division. In Proceedings of the EC\u201917 (pp. 461\u2013478).","DOI":"10.1145\/3033274.3085123"},{"key":"9545_CR52","unstructured":"Har-Peled, S. (2021). Partitioning a connected polygon into connected pieces of equal area. In Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/48463 (version: 2021-02-22)."},{"key":"9545_CR53","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. (2015). Dividing connected chores fairly. Theoretical Computer Science, 593, 51\u201361.","journal-title":"Theoretical Computer Science"},{"issue":"7","key":"9545_CR54","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1080\/00029890.1983.11971254","volume":"90","author":"TP Hill","year":"1983","unstructured":"Hill, T. P. (1983). Determining a fair border. The American Mathematical Monthly, 90(7), 438\u2013442.","journal-title":"The American Mathematical Monthly"},{"key":"9545_CR55","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.landusepol.2012.07.013","volume":"31","author":"M Hoffman","year":"2013","unstructured":"Hoffman, M. (2013). Why community ownership? Understanding land reform in Scotland. Land Use Policy, 31, 289\u2013297.","journal-title":"Land Use Policy"},{"key":"9545_CR56","unstructured":"Hohenwarter, M., Borcherds, M., Ancsin, G., Bencze, B., Blossier, M., Delobelle, A., Denizet, C., \u00c9li\u00e1s, J., Fekete, \u00c1., G\u00e1l, L., Kone\u010dn\u00fd, Z., Kov\u00e1cs, Z., Lizelfelner, S., Parisse, B., & Sturr, G. (2013). GeoGebra 5.0. http:\/\/www.geogebra.org"},{"key":"9545_CR57","doi-asserted-by":"crossref","unstructured":"Hosseini, H., & Searns, A. (2020). Guaranteeing maximin shares: Some agents left behind. Manuscript.","DOI":"10.24963\/ijcai.2021\/34"},{"issue":"05","key":"9545_CR58","first-page":"679","volume":"69","author":"ZS Huo","year":"2020","unstructured":"Huo, Z. S., Xiao, L., Guo, M., & Rong, X. (2020). Incremental throughput allocation of heterogeneous storage with no disruptions in dynamic setting. IEEE Computer Architecture Letters, 69(05), 679\u2013698.","journal-title":"IEEE Computer Architecture Letters"},{"issue":"4","key":"9545_CR59","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0304-4068(98)00053-6","volume":"32","author":"T Ichiishi","year":"1999","unstructured":"Ichiishi, T., & Idzik, A. (1999). Equitable allocation of divisible goods. Journal of Mathematical Economics, 32(4), 389\u2013400.","journal-title":"Journal of Mathematical Economics"},{"key":"9545_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218843009002051","volume":"18","author":"K Iyer","year":"2009","unstructured":"Iyer, K., & Huhns, M. N. (2009). A procedure for the allocation of two-dimensional resources in a multiagent system. International Journal of Cooperative Information Systems, 18, 1\u201334.","journal-title":"International Journal of Cooperative Information Systems"},{"key":"9545_CR61","unstructured":"JustPassingBy. (2016). A connectivity-preserving function from a connected set onto an interval. In Mathematics Stack Exchange. https:\/\/math.stackexchange.com\/q\/1641485 (version: 2016-02-09)."},{"key":"9545_CR62","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1613\/jair.4405","volume":"51","author":"I Kash","year":"2014","unstructured":"Kash, I., Procaccia, A. D., & Shah, N. (2014). No agent left behind: Dynamic fair division of multiple resources. Journal of Artificial Intelligence Research, 51, 579\u2013603.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9545_CR63","doi-asserted-by":"crossref","unstructured":"Keil, J. M. (2000). Polygon decomposition. In Handbook of computational geometry (pp. 491\u2013518). University of Saskatchewan Saskatoon, Sask., Canada.","DOI":"10.1016\/B978-044482537-7\/50012-7"},{"key":"9545_CR64","doi-asserted-by":"crossref","unstructured":"Kurz, S. (2016). The price of fairness for a small number of indivisible items. In Operations research proceedings 2014 (pp. 335\u2013340). Springer.","DOI":"10.1007\/978-3-319-28697-6_47"},{"key":"9545_CR65","doi-asserted-by":"crossref","DOI":"10.1515\/9780773570498","volume-title":"Determining boundaries in a conflicted world: The role of Uti Possidetis","author":"SN Lalonde","year":"2002","unstructured":"Lalonde, S. N. (2002). Determining boundaries in a conflicted world: The role of Uti Possidetis. McGill-Queen\u2019s Press-MQUP."},{"key":"9545_CR66","doi-asserted-by":"crossref","unstructured":"Lipton, M. (2009). Land reform in developing countries: Property rights and property wrongs. Routledge.","DOI":"10.4324\/9780203876251"},{"key":"9545_CR67","doi-asserted-by":"crossref","unstructured":"MacInnes, M., & Shields, K. (2015). The Land Reform (Scotland) bill and human rights: Key points and recommendations. SSRN 2698578 (2015).","DOI":"10.2139\/ssrn.2698578"},{"key":"9545_CR68","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1613\/jair.1.11618","volume":"68","author":"P McGlaughlin","year":"2020","unstructured":"McGlaughlin, P., & Garg, J. (2020). Improving nash social welfare approximations. Journal of Artificial Intelligence Research, 68, 225\u2013245.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9545_CR69","doi-asserted-by":"crossref","unstructured":"Michorzewski, M., Peters, D., & Skowron, P. (2020). Price of fairness in budget division and probabilistic social choice. In Proceedings of the AAAI conference on artificial intelligence (pp. 2184\u20132191).","DOI":"10.1609\/aaai.v34i02.5594"},{"key":"9545_CR70","unstructured":"Mohammadi, A., & Soleimani-damaneh, M. (2017). Reconstruction of the core convex topology and its applications in vector optimization and convex analysis. arXiv preprint arXiv:1704.06932"},{"issue":"2","key":"9545_CR71","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01560582","volume":"7","author":"H Moulin","year":"1990","unstructured":"Moulin, H. (1990). Fair division under joint ownership: Recent results and open problems. Social Choice and Welfare, 7(2), 149\u2013170.","journal-title":"Social Choice and Welfare"},{"key":"9545_CR72","volume-title":"Fair division and collective welfare","author":"H Moulin","year":"2004","unstructured":"Moulin, H. (2004). Fair division and collective welfare. The MIT Press."},{"issue":"3","key":"9545_CR73","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.ejor.2016.08.013","volume":"257","author":"G Nicosia","year":"2017","unstructured":"Nicosia, G., Pacifici, A., & Pferschy, U. (2017). Price of fairness for allocating a bounded resource. European Journal of Operational Research, 257(3), 933\u2013943.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"9545_CR74","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.dam.2019.12.018","volume":"283","author":"K Nyman","year":"2020","unstructured":"Nyman, K., Francis Edward, S., & Zerbib, S. (2020). Fair division with multiple pieces. Discrete Applied Mathematics, 283(1), 115\u2013122.","journal-title":"Discrete Applied Mathematics"},{"key":"9545_CR75","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jmateco.2018.08.003","volume":"78","author":"J Ortega","year":"2018","unstructured":"Ortega, J. (2018). Social integration in two-sided matching markets. Journal of Mathematical Economics, 78, 119\u2013126.","journal-title":"Journal of Mathematical Economics"},{"key":"9545_CR76","unstructured":"Powelson, J.\u00a0P. (1988). The story of land: A world history of land tenure and agrarian reform. Lincoln Institute of Land Policy."},{"key":"9545_CR77","doi-asserted-by":"publisher","DOI":"10.1201\/9781439863855","volume-title":"Cake-cutting algorithms: Be fair if you can","author":"JM Robertson","year":"1998","unstructured":"Robertson, J. M., & Webb, W. A. (1998). Cake-cutting algorithms: Be fair if you can. A K Peters\/CRC Press."},{"key":"9545_CR78","unstructured":"Rosset, P., Patel, R., & Courville, M., (Eds.). (2006). Promised land: Competing visions of agrarian reform. Food First Books, first trade paper edition."},{"key":"9545_CR79","unstructured":"Searns, A. (2020). Rethinking resource allocation: Fairness and computability. Master\u2019s Thesis, Rochester Institute of Technology. Available at https:\/\/scholarworks.rit.edu\/theses\/10651\/"},{"key":"9545_CR80","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmateco.2017.01.007","volume":"70","author":"E Segal-Halevi","year":"2017","unstructured":"Segal-Halevi, E., Nitzan, S., Hassidim, A., & Aumann, Y. (2017). Fair and square: Cake-cutting in two dimensions. Journal of Mathematical Economics, 70, 1\u201328.","journal-title":"Journal of Mathematical Economics"},{"issue":"3","key":"9545_CR81","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1287\/moor.2019.1016","volume":"45","author":"E Segal-Halevi","year":"2020","unstructured":"Segal-Halevi, E., Nitzan, S., Hassidim, A., & Aumann, Y. (2020). Envy-free division of land. Mathematics of Operations Research, 45(3), 896\u2013922.","journal-title":"Mathematics of Operations Research"},{"key":"9545_CR82","unstructured":"Segal-Halevi, E. (2017). Fair Division of Land. Ph.D. Thesis, Bar Ilan University, Computer Science Department. Guided by Yonatan Aumann and Avinatan Hassidim."},{"key":"9545_CR83","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E. (2018). Redividing the cake. In Proceedings of the IJCAI\u201918 (pp. 498\u2013504). AAAI Press.","DOI":"10.24963\/ijcai.2018\/69"},{"issue":"1","key":"9545_CR84","doi-asserted-by":"publisher","first-page":"123382","DOI":"10.1016\/j.jmaa.2019.123382","volume":"480","author":"E Segal-Halevi","year":"2019","unstructured":"Segal-Halevi, E. (2019). Cake-cutting with different entitlements: How many cuts are needed? Journal of Mathematical Analysis and Applications, 480(1), 123382 arXiv preprint arXiv:1803.05470.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"9545_CR85","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2020.10.011","volume":"291","author":"E Segal-Halevi","year":"2021","unstructured":"Segal-Halevi, E. (2021). Fair multi-cake cutting. Discrete Applied Mathematics, 291, 15\u201335 arXiv preprint arXiv:1812.08150.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"9545_CR86","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1080\/00291950500535251","volume":"60","author":"WDH Sellar","year":"2006","unstructured":"Sellar, W. D. H. (2006). The great land debate and the Land Reform (Scotland) Act 2003. Norsk Geografisk Tidsskrift-Norwegian Journal of Geography, 60(1), 100\u2013109.","journal-title":"Norsk Geografisk Tidsskrift-Norwegian Journal of Geography"},{"issue":"39","key":"9545_CR87","first-page":"1","volume":"35","author":"I Shtechman","year":"2021","unstructured":"Shtechman, I., Gonen, R., & Segal-Halevi, E. (2021). Fair cake-cutting algorithms with real land-value data. Autonomous Agents and Multi-Agent Systems, 35(39), 1\u201328.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"1","key":"9545_CR88","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H. (1948). The problem of fair division. Econometrica, 16(1), 101\u2013104.","journal-title":"Econometrica"},{"key":"9545_CR89","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.dam.2019.01.036","volume":"260","author":"W Suksompong","year":"2019","unstructured":"Suksompong, W. (2019). Fairly allocating contiguous blocks of indivisible items. Discrete Applied Mathematics, 260, 227\u2013236.","journal-title":"Discrete Applied Mathematics"},{"key":"9545_CR90","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.mathsocsci.2018.07.001","volume":"95","author":"BR Sziklai","year":"2018","unstructured":"Sziklai, B. R., & Segal-Halevi, E. (2018). Resource-monotonicity and population-monotonicity in connected cake-cutting. Mathematical Social Sciences, 95, 19\u201330.","journal-title":"Mathematical Social Sciences"},{"issue":"2","key":"9545_CR91","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00199-018-1128-6","volume":"68","author":"BR Sziklai","year":"2019","unstructured":"Sziklai, B. R., & Segal-Halevi, E. (2019). Monotonicity and competitive equilibrium in cake-cutting. Economic Theory, 68(2), 363\u2013401.","journal-title":"Economic Theory"},{"key":"9545_CR92","doi-asserted-by":"crossref","unstructured":"Tang, Z., Wang, C., & Zhang, M. (2020). Price of fairness in budget division for egalitarian social welfare. In International conference on combinatorial optimization and applications (pp. 594\u2013607). Springer.","DOI":"10.1007\/978-3-030-64843-5_40"},{"issue":"3","key":"9545_CR93","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/moor.8.3.319","volume":"8","author":"W Thomson","year":"1983","unstructured":"Thomson, W. (1983). The fair division of a fixed supply among a growing population. Mathematics of Operations Research, 8(3), 319\u2013326.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"9545_CR94","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00199-006-0109-3","volume":"31","author":"W Thomson","year":"2007","unstructured":"Thomson, W. (2007). Children crying at birthday parties. Why? Economic Theory, 31(3), 501\u2013521.","journal-title":"Economic Theory"},{"key":"9545_CR95","first-page":"393","volume-title":"Fair allocation rules","author":"W Thomson","year":"2011","unstructured":"Thomson, W. (2011). Fair allocation rules (Vol. 2, pp. 393\u2013506). Elsevier."},{"key":"9545_CR96","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-24873-3_22","volume":"6992","author":"T Walsh","year":"2011","unstructured":"Walsh, T. (2011). Online cake cutting. Algorithmic Decision Theory, 6992, 292\u2013305.","journal-title":"Algorithmic Decision Theory"},{"key":"9545_CR97","volume-title":"The poor had no lawyers: Who owns Scotland (and How They Got it)","author":"A Wightman","year":"2015","unstructured":"Wightman, A. (2015). The poor had no lawyers: Who owns Scotland (and How They Got it). Birlinn Ltd."},{"issue":"2","key":"9545_CR98","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.disopt.2006.07.003","volume":"4","author":"GJ Woeginger","year":"2007","unstructured":"Woeginger, G. J., & Sgall, J. (2007). On the complexity of cake cutting. Discrete Optimization, 4(2), 213\u2013220.","journal-title":"Discrete Optimization"},{"key":"9545_CR99","unstructured":"Yagami, I. (2021). Computing the set of points nearest to a point in a polygon boundary. Computer Science Stack Exchange. https:\/\/cs.stackexchange.com\/q\/141012 (version: 2021-06-04)."},{"key":"9545_CR100","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Laurenzano, M.\u00a0A., Mars, J., & Tang, L. (2014). SMiTe: Precise QoS prediction on real-system SMT processors to improve utilization in warehouse scale computers. In Proceedings of the MICRO\u201914 (pp. 406\u2013418). IEEE Computer Society.","DOI":"10.1109\/MICRO.2014.53"},{"key":"9545_CR101","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00581-5","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Zhang, Z., & Liu, Z. (2020). The price of fairness for a two-agent scheduling game minimizing total completion time. Journal of Combinatorial Optimization. https:\/\/doi.org\/10.1007\/s10878-020-00581-5.","journal-title":"Journal of Combinatorial Optimization"},{"key":"9545_CR102","unstructured":"Zivan, R. (2011). Can trust increase the efficiency of cake cutting algorithms? In Proceedings of the AAMAS\u201911 (pp. 1145\u20131146)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09545-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-022-09545-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09545-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T21:46:25Z","timestamp":1700171185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-022-09545-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":102,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9545"],"URL":"https:\/\/doi.org\/10.1007\/s10458-022-09545-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"10 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}