When Are Operations Research Algorithms Useful in Fair Division Problems?

  • Christian TrudeauEmail author
Part of the Studies in Economic Design book series (DESI)


In many fair division problems, there is an underlying operations research problem to determine how to organize the coalition of agents and compute the value created or the cost generated by the various groups. Through examples, this chapter discusses the possibility of using the algorithms used in the underlying operations research problem to answer fair division questions.



Christian Trudeau acknowledges financial support by the Social Sciences and Humanities Research Council of Canada [grant number 435-2014-0140]. Marcelo Arbex, Gustavo Bergantinos, Jens Hougaard, Justin Leroux, Juan Moreno-Ternero, Sang-Chul Suh and Yuntong Wang provided helpful feedback.


  1. Bahel, E., & Trudeau, C. (2017). Minimum incoming cost rules for arborescences. Social Choice and Welfare,49, 287–314.Google Scholar
  2. Bergantinos, G., & Vidal-Puga, J. (2007). A fair rule in minimum cost spanning tree problems. Journal of Economic Theory,137, 326–352.Google Scholar
  3. Bergantinos, G., & Vidal-Puga, J. (2011). The folk solution and borukva’s algorithm in minimum cost spanning tree problems. Discrete Applied Mathematics,159, 1279–1283.Google Scholar
  4. Bird, C. (1976). On cost allocation for a spanning tree: A game theoretic approach. Networks,6, 335–350.CrossRefGoogle Scholar
  5. Boruvka, O. (1926). About a certain minimal problem. Praca Moravske Prirodovedecke Spolecnosti(in Czech) 3, 37–58.Google Scholar
  6. Dutta, B., & Mishra, D. (2012). Minimum cost arborescences. Games and Economic Behavior,74, 120–143.Google Scholar
  7. Feltkamp, V., Tijs, S., & Muto, S. (1994). On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. Discussion Paper 94106, Tilburg University Center.Google Scholar
  8. Kruskal, J. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society,7, 48–50.CrossRefGoogle Scholar
  9. Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal,36, 1389–1401.CrossRefGoogle Scholar
  10. Quant, M., Borm, P., & Reijnierse, H. (2006). Congestion network problems and related games. European Journal of Operational Research,172, 919–930.Google Scholar
  11. Tijs, S., Branzei, R., Moretti, S., & Norde, H. (2006). Obligation rules for msct situations and their monotonicity properties. European Journal of Operational Reearch,175, 121–134.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of EconomicsUniversity of WindsorWindsorCanada

Personalised recommendations