Frank Ruskey, Carla D. Savage, and Stan Wagon
Generalizing the familiar pictures of two or three intersecting circles, a Venn diagram is a collection of simple closed curves that intersect in only finitely many points and such that the intersection of interiors of any subset of the curves is nonempty and connected. If there are n curves, and the diagram has n-fold rotational symmetry, n must be a prime. The authors show how these can be constructed.
(pp. 1304)
Email this
Steven J. Brams, Michael A. Jones, and Christian Klamler
A mathematical cake, as viewed by n persons participating in its division, is modeled by their n (covert) value functions on the unit interval. Each participant can cut the cake at a point by a vertical line at that point, and each is assumed to make their cut so as to maximize the value of the minimum size piece they might receive. The authors explore algorithms that allow this division to be fair to all.
(pp. 1314)
Email this
