Pairwise mergers in bipartite matching games with an application in collaborative logistics
暂无分享,去创建一个
[1] B. Peleg,et al. Introduction to the Theory of Cooperative Games , 1983 .
[2] Giorgio Gallo,et al. Network models for vehicle and crew scheduling , 1984 .
[3] Özlem Ergun,et al. Allocating Costs in a Collaborative Transportation Procurement Network , 2008, Transp. Sci..
[4] Juan J. Vidal-Puga,et al. Merge-proofness in minimum cost spanning tree problems , 2011, Int. J. Game Theory.
[5] Martin Shubik,et al. The Assignment Game , 1971 .
[6] Hervé Moulin,et al. On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs , 2007, Math. Oper. Res..
[7] Sebastián Lozano,et al. Cooperative game theory approach to allocating benefits of horizontal cooperation , 2013, Eur. J. Oper. Res..
[8] Tom Van Woensel,et al. On characterization of the core of lane covering games via dual solutions , 2014, Oper. Res. Lett..
[9] Tom Van Woensel,et al. A competitive solution for cooperative truckload delivery , 2016, OR Spectr..
[10] L. Shapley,et al. The assignment game I: The core , 1971 .
[11] Mikael Rönnqvist,et al. Cost Allocation in Collaborative Forest Transportation , 2006, Eur. J. Oper. Res..
[12] Lars Peter Østerdal,et al. Merging and splitting in cooperative games: some (im)possibility results , 2012, Int. J. Game Theory.
[13] Gilbert Laporte,et al. Horizontal cooperation among freight carriers: request allocation and profit sharing , 2008, J. Oper. Res. Soc..
[14] Eitan Zemel,et al. Generalized Network Problems Yielding Totally Balanced Games , 1982, Oper. Res..