Envy-Free Division of Land

References

• [1] Agarwal PK, Katz MJ, Sharir M (1995) Computing depth orders for fat objects and related problems. Comput. Geometry 5(4):187–206.Google Scholar
• [2] Aziz H, Mackenzie S (2016) A discrete and bounded envy-free cake cutting protocol for any number of agents. 2016 IEEE 57th Annual Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 416–427.Google Scholar
• [3] Azrieli Y, Shmaya E (2014) Rental harmony with roommates. J. Econom. Theory 153:128–137.Google Scholar
• [4] Barbanel JB, Brams SJ (2004) Cake division with minimal cuts: Envy-free procedures for three persons, four persons, and beyond. Math. Soc. Sci. 48(3):251–269.Google Scholar
• [5] Barbanel JB, Brams SJ, Stromquist W (2009) Cutting a pie is not a piece of cake. Amer. Math. Monthly 116(6):496–514.Google Scholar
• [6] Beck A (1987) Constructing a fair border. Amer. Math. Monthly 94(2):157–162.Google Scholar
• [7] Bei X, Huzhang G, Suksompong W (2018) Truthful fair division without free disposal. Proc. 27th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 63–69.Google Scholar
• [8] Bei X, Chen N, Huzhang G, Tao B, Wu J (2017) Cake cutting: Envy and truth. Proc. 26th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 3625–3631.Google Scholar
• [9] Berliant M, Dunz K (2004) A foundation of location theory: Existence of equilibrium, the welfare theorems, and core. J. Math. Econom. 40(5):593–618.Google Scholar
• [10] Berliant M, Raa T (1988) A foundation of location theory: Consumer preferences and demand. J. Econom. Theory 44(2):336–353.Google Scholar
• [11] Berliant M, Thomson W, Dunz K (1992) On the fair division of a heterogeneous commodity. J. Math. Econom. 21(3):201–216.Google Scholar
• [12] Brams SJ, Taylor AD (1995) An envy-free cake division protocol. Amer. Math. Monthly 102(1):9–18.Google Scholar
• [13] Brams SJ, Taylor AD (1996) Fair Division: From Cake Cutting to Dispute Resolution (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [14] Brams SJ, Jones M, Klamler C (2008) Proportional pie-cutting. Internat. J. Game Theory 36(3–4):353–367.Google Scholar
• [15] Brams SJ, Taylor AD, Zwicker WS (1997) A moving-knife solution to the four-person envy-free cake division problem. Proc. Amer. Math. Soc. 125(2):547–554.Crossref, Google Scholar
• [16] Brânzei S, Miltersen PB (2015) A dictatorship theorem for cake cutting. Proc. 24th Internat. Conf. Artificial Intelligence (IJCAI’15) (AAAI Press, Menlo Park, CA), 482–488.Google Scholar
• [17] Caragiannis I, Lai JK, Procaccia AD (2011) Toward more expressive cake cutting. Proc. 22nd Internat. Joint Conf. Artificial Intelligence (IJCAI’11) (AAAI Press), 127–132.Google Scholar
• [18] Chambers CP (2005) Allocation rules for land division. J. Econom. Theory 121(2):236–258.Google Scholar
• [19] Chen Y, Lai JK, Parkes DC, Procaccia AD (2013) Truth, justice, and cake cutting. Games Econom. Behav. 77(1):284–297.Google Scholar
• [20] Cohler YJ, Lai JK, Parkes DC, Procaccia AD (2011) Optimal envy-free cake cutting. Proc. 25th AAAI Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 626–631.Google Scholar
• [21] Dall’Aglio M, Maccheroni F (2009) Disputed lands. Games Econom. Behav. 66(1):57–77.Google Scholar
• [22] Deng X, Qi Q, Saberi A (2012) Algorithmic solutions for envy-free cake cutting. Oper. Res. 60(6):1461–1476.Google Scholar
• [23] Dubins LE, Spanier EH (1961) How to cut a cake fairly. Amer. Math. Monthly 68(1):1–17.Google Scholar
• [24] Hill TP (1983) Determining a fair border. Amer. Math. Monthly 90(7):438–442.Google Scholar
• [25] Hüsseinov F (2011) A theory of a heterogeneous divisible commodity exchange economy. J. Math. Econom. 47(1):54–59.Google Scholar
• [26] Hüsseinov F, Sagara N (2013) Existence of efficient envy-free allocations of a heterogeneous divisible commodity with nonadditive utilities. Soc. Welfare 41(4):923–940.Google Scholar
• [27] Ichiishi T, Idzik A (1999) Equitable allocation of divisible goods. J. Math. Econom. 32(4):389–400.Google Scholar
• [28] Iyer K, Huhns MN (2009) A procedure for the allocation of two-dimensional resources in a multiagent system. Internat. J. Cooperative Inform. Systems 18(3–4):381–422.Google Scholar
• [29] Katz MJ (1997) 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects. Comput. Geometry 8(6):299–316.Google Scholar
• [30] Kurokawa D, Lai JK, Procaccia AD (2013) How to cut a cake before the party ends. Proc. 27th AAAI Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 555–561.Google Scholar
• [31] Legut J, Potters JAM, Tijs SH (1994) Economies with Land—A game theoretical approach. Games Econom. Behav. 6(3):416–430.Google Scholar
• [32] LiCalzi M, Nicolò A (2009) Efficient egalitarian equivalent allocations over a single good. Econom. Theory 40(1):27–45.Google Scholar
• [33] Maccheroni F, Marinacci M (2003) How to cut a pizza fairly: Fair division with decreasing marginal evaluations. Soc. Choice Welfare 20(3):457–465.Google Scholar
• [34] Manabe Y, Okamoto T (2010) Meta-envy-free cake-cutting protocols. Hliněný P, Kučera A, eds. Mathematical Foundations of Computer Science 2010, Lecture Notes in Computer Science, vol. 6281 (Springer, Berlin, Heidelberg), 501–512.Crossref, Google Scholar
• [35] Mirchandani RS (2013) Superadditivity and subadditivity in fair division. J. Math. Res. 5(3):78–91.Google Scholar
• [36] Nicolò A, Yu Y (2008) Strategic divide and choose. Games Econom. Behav. 64(1):268–289.Google Scholar
• [37] Nicolò A, Perea y Monsuwe A, Roberti P (2012) Equal opportunity equivalence in land division. SERIES J. Spanish Econom. Assoc. 3(1–2):133–142.Google Scholar
• [38] Procaccia AD (2015) Cake cutting algorithms. Brandt F, Conitzer V, Endriss U, Lang J, Procaccia AD, eds. Handbook of Computational Social Choice (Cambridge University Press, New York), 261–283.Google Scholar
• [39] Reijnierse JH, Potters JAM (1998) On finding an envy-free Pareto-optimal division. Math. Programming 83(1–3):291–311.Google Scholar
• [40] Robertson JM, Webb WA (1998) Cake-Cutting Algorithms: Be Fair if You Can, 1st ed. (A K Peters/CRC Press, Natick, MA).Google Scholar
• [41] Saberi A, Wang Y (2009) Cutting a cake for five people. Goldberg AV, Zhou Y, eds. Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, vol. 5564 (Springer, Berlin, Heidelberg), 292–300.Crossref, Google Scholar
• [42] Sagara N, Vlach M (2009) Representation of preference relations on sigma-algebras of nonatomic measure spaces: Convexity and continuity. Fuzzy Sets Systems 160(5):624–634.Crossref, Google Scholar
• [43] Segal-Halevi E (2018) Redividing the cake. Proc. 27th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 498–504.Google Scholar
• [44] Segal-Halevi E, Sziklai BR (2018) Monotonicity and competitive equilibrium in cake-cutting. Econom. Theory 68(2):363–401.Google Scholar
• [45] Segal-Halevi E, Hassidim A, Aumann Y (2015) Envy-free cake-cutting in two dimensions. Proc. 29th AAAI Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 1021–1028.Google Scholar
• [46] Segal-Halevi E, Hassidim A, Aumann Y (2016) Waste makes haste: Bounded time algorithms for envy-free cake cutting with free disposal. ACM Trans. Algorithms (TALG) 13(1):12:1–12:32.Google Scholar
• [47] Segal-Halevi E, Nitzan S, Hassidim A, Aumann Y (2017) Fair and square: Cake-cutting in two dimensions. J. Math. Econom. 70:1–28.Google Scholar
• [48] Steinhaus H (1948) The problem of fair division. Econometrica 16(1):101–104.Google Scholar
• [49] Stromquist W (1980) How to cut a cake fairly. Amer. Math. Monthly 87(8):640–644.Google Scholar
• [50] Stromquist W (2008) Envy-free cake divisions cannot be found by finite protocols. Electr. J. Combinatorics 15(1):#R11.Google Scholar
• [51] Su FE (1999) Rental harmony: Sperner’s lemma in fair division. Amer. Math. Monthly 106(10):930–942.Google Scholar
• [52] Thomson W (2007) Children crying at birthday parties. Why? Econom. Theory 31(3):501–521.Google Scholar
• [53] Webb WA (1990) A combinatorial algorithm to establish a fair border. Eur. J. Combinatorics 11(3):301–304.Google Scholar
• [54] Weller D (1985) Fair division of a measurable space. J. Math. Econom. 14(1):5–17.Google Scholar