Three Person-Two Cuts Problem
A mathematically rigorous fair-division study developing a maximin envy-free solution to a constrained cake-cutting problem.
This project develops a solution to the Three Person-Two Cuts problem, a constrained fair-division setting that asks whether limited partitioning can still support allocations with strong fairness guarantees. The work is rooted in mathematical optimization and theoretical reasoning, treating fair division not as a heuristic exercise but as a formal allocation problem with clear solution concepts.
The core contribution is a maximin envy-free algorithmic approach, formulated using linear-programming logic to identify allocations that preserve fairness under a restricted cutting structure. This makes the problem especially interesting, because the number of feasible partitions is sharply limited, yet the fairness requirement remains demanding.