Playing Divide-and-Choose Given Uncertain Preferences

References

• Amanatidis G, Birmpas G, Fusco F, Lazos P, Leonardi S, Reiffenhäuser R (2021) Allocating indivisible goods to strategic agents: Pure Nash equilibria and fairness. Feldman M, Fu H, Talgam-Cohen I, eds. Proc. 17th Internat. Conf. Web and Internet Econom. (Springer, Cham, Switzerland), 149–166.Google Scholar
• Aziz H, Mackenzie S (2020) A bounded and envy-free cake cutting algorithm. Comm. ACM 63(4):119–126.Crossref, Google Scholar
• Barman S, Ghalme G, Jain S, Kulkarni P, Narang S (2019) Fair division of indivisible goods among strategic agents. Bazzan ALC, Huhns MN, Lomuscio A, Scerri P, eds. Proc. 18th Internat. Conf. Autonomous Agents MultiAgent Systems (International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC), 1811–1813.Google Scholar
• Bei X, Huzhang G, Suksompong W (2020) Truthful fair division without free disposal. Soc. Choice Welfare 55(3):523–545.Crossref, Google Scholar
• Bei X, Chen N, Huzhang G, Tao B, Wu J (2017) Cake cutting: Envy and truth. Sierra C, ed. Proc. 26th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 3625–3631.Google Scholar
• Bogomolnaia A, Moulin H, Sandomirskiy F (2022) On the fair division of a random object. Management Sci. 68(2):1174–1194.Link, Google Scholar
• Brams SJ, Merrill S III (1983) Equilibrium strategies for final-offer arbitration: There is no median convergence. Management Sci. 29(8):927–941.Link, Google Scholar
• Brams SJ, Taylor AD (1995) An envy-free cake division protocol. Amer. Math. Monthly 102(1):9–18.Crossref, Google Scholar
• Brânzei S, Caragiannis I, Kurokawa D, Procaccia AD (2016) An algorithmic framework for strategic fair division. Schuurmans D, Wellman MP, eds. Proc. 30th AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 418–424.Google Scholar
• Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. J. Political Econom. 119(6):1061–1103.Crossref, Google Scholar
• Chen Y, Lai JK, Parkes DC, Procaccia AD (2013) Truth, justice, and cake cutting. Games Econom. Behav. 77(1):284–297.Crossref, Google Scholar
• Cheung YK (2016) Better strategyproof mechanisms without payments or prior: An analytic approach. Kambhampati S, ed. Proc. 25th Internat. Joint Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 194–200.Google Scholar
• Cole R, Gkatzelis V, Goel G (2013) Mechanism design for fair division: Allocating divisible items without payments. Elkind E, Feldman M, Pogorelskiy KI, eds. Proc. 14th ACM Conf. Electronic Commerce (ACM, New York), 251–268.Google Scholar
• Conitzer V, Freeman R, Shah N (2017) Fair public decision making. Feldman M, Miltersen PB, Nisan N, eds. Proc. ACM Conf. Econom. Comput. (ACM, New York), 629–646.Google Scholar
• Delgosha P, Gohari A (2017) Information theoretic cutting of a cake. IEEE Trans. Inform. Theory 63(11):6950–6978.Crossref, Google Scholar
• Dyer ME, Frieze AM (1988) On the complexity of computing the volume of a polyhedron. SIAM J. Comput. 17(5):967–974.Crossref, Google Scholar
• Frank R, Riede H (2012) Hyperplane sections of the n-dimensional cube. Amer. Math. Monthly 119(10):868–872.Crossref, Google Scholar
• Gurobi Optimization LLC (2021) Gurobi optimizer reference manual. https://www.gurobi.com.Google Scholar
• Kuhn HW (1967) On games of fair division. Shubik M, ed. Essays in Mathematical Economics in Honor of Oskar Morgenstern (Princeton University Press, Princeton, NJ), 29–38.Google Scholar
• Kyropoulou M, Ortega J, Segal-Halevi E (2019) Fair cake-cutting in practice. Immorlica N, Lucier B, eds. Proc. ACM Conf. Econom. Comput. (ACM, New York), 547–548.Google Scholar
• Lovász L, Vempala S (2006) Hit-and-run from a corner. J. Comput. 35(4):985–1005.Google Scholar
• Meyer M, Reisner S (1991) Characterization of affinely-rotation-invariant log-concave measures by section-centroid location. Geometric Aspects Functional Analysis: Israel Seminar 1989–90 (Springer, Berlin, Heidelberg), 145–152.Crossref, Google Scholar
• Nicolò A, Yu Y (2008) Strategic divide and choose. Games Econom. Behav. 64(1):268–289.Crossref, Google Scholar
• Powers BR (2019) An analysis of dual-issue final-offer arbitration. Internat. J. Game Theory 48(1):81–108.Crossref, Google Scholar
• Procaccia AD (2013) Cake cutting: Not just child’s play. Comm. ACM 56(7):78–87.Crossref, Google Scholar
• Weinstein M, Zeckhauser R (1973) Critical ratios and efficient allocation. J. Public Econom. 2(2):147–157.Crossref, Google Scholar
• Young HP (1995) Equity: In Theory and Practice (Princeton University Press, Princeton, NJ).Crossref, Google Scholar