References
- Bollobás, B. (2007). The Art of Mathematics: Coffee Time in Memphis. New York: Cambridge Univ. Press.
- Feller, W. (1950). An Introduction to Probability Theory and Its Applications, Vol. I. New York: John Wiley & Sons, Inc.
- Karp, R. M. (1972). Reducibility among Combinatorial Problems. In: Miller, R. E., Thatcher, J. W., Bohlinger, J. D., eds. Complexity of Computer Computations. The IBM Research Symposia Series. Boston, MA: Springer US, pp. 85–103. doi.org/10.1007/978-1-4684-2001-2_9
- Kokkala, J. (2017). MathOverflow: Looking for the name or reference regarding a bipartite graph parameter. mathoverflow.net/q/273909
- Mirzakhani, M., Vondrák, J. (2015). Sperner’s colorings, hypergraph labeling problems and fair division. In: Indyk, P., ed. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’15). Philadelphia, PA: Society for Industrial and Applied Mathematics, pp. 873–886.
- Nash, Jr., J. F. (1950). Equilibrium points in n-person games. Proc. Nat. Acad. Sci. USA. 36: 48–49.
- von Neumann, J., Morgenstern, O. (1944). Theory of Games and Economic Behavior. Princeton, NJ: Princeton Univ. Press.
- Rosen, J. (2015). Puzzing Stack Exchange: 100 Dwarves vs. the Evil Elf (Answer). puzzling.stackexchange.com/a/18557/2722
- Seacrest, T. (2015). Puzzling Stack Exchange: 100 Dwarves vs. the Evil Elf (Question). puzzling.stackexchange.com/q/18507/2722
- Su, F. E. (1999). Rental harmony: Sperner’s lemma in fair division. Amer. Math. Monthly. 106(10): 930–942. doi: 10.2307/2589747.
- Winkler, P. (2004). Mathematical Puzzles: A Connoisseur’s Collection. Natick, MA: A K Peters, Ltd.