Fair Division: From Cake-Cutting to Dispute Resolution www.amazon.com/Fair-Division-Cake-Cutting-Dispute-Resolution/dp/0521556449
Stable matchings are a related problem (sometimes called the stable marriage problem), where you want to match men and women to "marry", such that no two couples would want to swap partners. It is applied in real life to matching medical interns to hospital placements. One of my all time favorite technical books* is on this subject:
Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis http://www.amazon.com/Two-Sided-Matching-Game-Theoretic-Econ...
(* yes, that may make me weird)
http://www.amazon.com/Two-Sided-Matching-Game-Theoretic-Econ...
It is readable if you're interested in the problem. This book on the same subject is also good, although not by any Nobel prize winners:
http://www.amazon.com/Stable-Marriage-Problem-Algorithms-Fou...
http://www.amazon.com/Two-Sided-Matching-Game-Theoretic-Econ...
To be fair, it is also studied by computer scientists, as in the other main book on the stable marriage:
http://www.amazon.com/The-Stable-Marriage-Problem-Foundation...