REFERENCES
- A. Alkan, G. Demange, and D. Gale, Fair allocation of indivisible goods and criteria of justice, Econometrica 59 (1991) 1023–1039.
- S. J. Brams and A. D. Taylor, An enuy-free cake division algorithm, Economic Research Reports, C. V. Starr Center for Applied Economics, New York University, 1992.
- S. J. Brams and A. D. Taylor, Fair Division: from Cake-Cutting to Dispute Resolution, Cambridge University Press, Cambridge, 1996.
- S. J. Brams and A. D. Taylor, An envy-free cake division protocol, Amer. Math. Monthly 102 (1995) 9–18.
- D. I. A. Cohen, On the Sperner lemma, J. Combin. Theory 2 (1967) 585–587.
- M. Gardner, aha! Insight. W. F. Freeman and Co., New York, 1978.
- B. Knaster, C. Kuratowski, and S. Mazurkiewicz, Ein Beweis des Fixpunktsatzes für n-dimensionale Simplexe, Fund. Math. 14 (1929) 132–137.
- H. W. Kuhn, Simplicial Approximation of Fixed Points, Proc. Nat. Acad. Sci. U.S.A. 61 (1968) 1238–1242.
- R. Oskui, Dirty work problem, preprint.
- E. Peterson and F. E. Su, Exact procedures for envy-free chore division, preprint.
- J. M. Robertson and W. A. Webb, Cake-Cutting Algorithms: Be Fair If You Can, A K Peters Ltd., Natick, Mass., 1998.
- F. W. Simmons, private communication to Michael Starbird, 1980.
- E. Sperner, Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes, Abh. Math. Sem. Univ. Hamburg 6 (1928) 265–272.
- W. Stromquist, How to cut a cake fairly, Amer. Math. Monthly 87 (1980) 640–644.
- J. W. Vick, Homology Theory. Springer-Verlag, New York, 1994.
- H. Scarf, The Computation of Equilibrium Prices: An Exposition, Cowles Foundation Discussion Paper No. 473, Cowles Foundation for Research in Economics at Yale University, November, 1977.
- M. J. Todd, The Computation of Fixed Points and Applications, Lecture Notes in Economic and Mathematical Systems, New York, 1976.