Pairwise mergers in bipartite matching games with an application in collaborative logistics
From MaRDI portal
Publication:1709976
DOI10.1016/j.orl.2016.10.004zbMath1408.91056OpenAlexW2537954979MaRDI QIDQ1709976
Publication date: 15 January 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/39121/1/pairwise%20mergers%20in%20bipartite.pdf
Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06) Matching models (91B68)
Related Items
A survey on obstacles and difficulties of practical implementation of horizontal collaboration in logistics ⋮ Gain-sharing in urban consolidation centers
Cites Work
- Merge-proofness in minimum cost spanning tree problems
- Network models for vehicle and crew scheduling
- Cost allocation in collaborative forest transportation
- An axiomatization of the Banzhaf value
- On characterization of the core of lane covering games via dual solutions
- Merging and splitting in cooperative games: some (im)possibility results
- Cooperative game theory approach to allocating benefits of horizontal cooperation
- The assignment game. I: The core
- Horizontal cooperation among freight carriers: request allocation and profit sharing
- Generalized Network Problems Yielding Totally Balanced Games
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- Introduction to the Theory of Cooperative Games
- A competitive solution for cooperative truckload delivery
