Date of Submission
Academic Programs and Concentrations
Project Advisor 1
When dividing a valuable resource amongst a group of players, it is desirable to have each player believe that their allocation is at least as valuable as everyone else's allocation. This condition, where nobody is envious of anybody else's share in a division, is called envy-freeness. Fair division problems over continuous pools of resources are affectionately known as cake-cutting problems, as they resemble attempts to slice and distribute cake amongst guests as fairly as possible. Previous work in multi-cake fair division problems have attempted to prove that certain conditions do not allow for guaranteed envy-free divisions. In this paper, we examine and attempt to generalize a series of proofs by Cloutier, Nyman, and Su regarding the existence of envy-free divisions of multiple cakes amongst two players.
Open Access Agreement
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Shin, Justin J., "Envy-Free Fair Division With Two Players and Multiple Cakes" (2016). Senior Projects Fall 2016. 37.
This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.