暂无分享,去创建一个
[1] Kent E. Morrison,et al. Cutting Cakes Carefully , 2010 .
[2] Jrg Rothe,et al. Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division , 2015, Economics and Computation.
[3] Walter Stromquist,et al. Cutting a Pie Is Not a Piece of Cake , 2008, Am. Math. Mon..
[4] F. Su. The Banach-Tarski Paradox , 1990 .
[5] Steven J. Brams,et al. Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm , 2010, SIAM Rev..
[6] Haris Aziz,et al. A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[7] Jihnhee Yu,et al. Measures, Integrals and Martingales , 2007, Technometrics.
[8] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[9] Ute Dreher,et al. Measure And Integration Theory , 2016 .
[10] K. Ciesielski. How good is lebesgue measure? , 1989 .
[11] Theodore P. Hill,et al. Counterexamples in the Theory of Fair Division , 2009, 0901.2360.