1. Ahuja R. K., Magnanti T. L., Orlin J. B. (1993) Network flows: Theory, algorithms, and applications. Prentice Hall, New Jersey
2. Barbera, S., Bossert, W., & Pattanaik, P. K. (2004). Ranking sets of objects. In Handbook of utility theory (Vol. 2, pp. 893–977). Berlin: Springer.
3. Bartholdi J. J., Tovey C. A., Trick M. A. (1989) Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6(2): 157–165
4. Bern, M. W., & Eppstein, D. (1993). Worst-case bounds for subadditive geometric graphs. In SCG ’93: Proceedings of the 9th Annual Symposium on Computational Geometry (pp. 183–188). San Diego, New York: ACM.
5. Black D. (1958) The theory of committees and elections. Cambridge University Press, Cambridge