1. Aumann, Y., & Dombb, Y. (2010). The efficiency of fair division with connected pieces. Internet and network economics (pp. 26–37). Berlin: Springer.
2. Bei, X., Chen, N., Hua, X., Tao, B., & Yang, E. (2012). Optimal proportional cake cutting with connected pieces. In Proceedings of the 26th AAAI conference on artificial intelligence (AAAI 2012) (pp. 1263–1269).
3. Bellman, R. (1957). A Markovian decision process. Indiana University Mathematics Journal, 6(4), 679–684.
4. Bernstein, D., Givan, D., Immerman, N., & Zilberstein, S. (2002). The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4), 819–840.
5. Brams, S. J., Feldman, M., Lai, J. K., Morgenstern, J., & Procaccia, A. D. (2012). On maxsum fair cake divisions. In Proceedings of the 26th AAAI conference on artificial intelligence (AAAI 2012) (pp. 1285–1291).