Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bahel, E., & Trudeau, C. (2017). Minimum incoming cost rules for arborescences. Social Choice and Welfare,49, 287–314.
Bergantinos, G., & Vidal-Puga, J. (2007). A fair rule in minimum cost spanning tree problems. Journal of Economic Theory,137, 326–352.
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.
Bird, C. (1976). On cost allocation for a spanning tree: A game theoretic approach. Networks,6, 335–350.
Boruvka, O. (1926). About a certain minimal problem. Praca Moravske Prirodovedecke Spolecnosti(in Czech) 3, 37–58.
Dutta, B., & Mishra, D. (2012). Minimum cost arborescences. Games and Economic Behavior,74, 120–143.
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.
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.
Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal,36, 1389–1401.
Quant, M., Borm, P., & Reijnierse, H. (2006). Congestion network problems and related games. European Journal of Operational Research,172, 919–930.
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.
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Trudeau, C. (2019). When Are Operations Research Algorithms Useful in Fair Division Problems?. In: Laslier, JF., Moulin, H., Sanver, M., Zwicker, W. (eds) The Future of Economic Design. Studies in Economic Design. Springer, Cham. https://doi.org/10.1007/978-3-030-18050-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-030-18050-8_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18049-2
Online ISBN: 978-3-030-18050-8
eBook Packages: Economics and FinanceEconomics and Finance (R0)