BRAMS, S. J., and A. D. TAYLOR. An envy-free cake division protocol. American Mathematical Monthly, 102 (1995): 9–18. Brams and Taylor describe in detail the finite version of their envy-free procedure for ; in addition, they review earlier work on “protocols” (step-by-step procedures) that led up to their constructive solution of the envy-freeness problem for .

BRAMS, S. J., and A. D. TAYLOR. Fair Division: From Cake-Cutting to Dispute Resolution, Cambridge University Press, Cambridge, MA, 1996. Brams and Taylor provide a book-length treatment of the kinds of topics introduced in this chapter, as well as divide-and-choose in the political arena, moving-knife procedures for cake cutting, and fairness as it applies to different auction and election procedures.

BRAMS, S. J., and A. D. TAYLOR. The Win-Win Solution: Guaranteeing Fair Shares to Everybody, Norton, New York, NY, 1999. Brams and Taylor further discuss the adjusted winner procedure, as well as divide-and-choose and taking turns.

ROBERTSON, J., and W. WEBB. Cake-Cutting Algorithms: Be Fair If You Can, A. K. Peters, Wellesley, MA, 1998. Robertson and Webb cover a great deal of cake-cutting ground in a text that includes exercises.

YOUNG, P. Equity in Theory and Practice, Princeton University Press, Princeton, NJ, 1994. Contains considerably more on fair division in real-world situations, such as the organ transplant example in Section 13.3 on page 546.