Pairwise mergers in bipartite matching games with an application in collaborative logistics
From MaRDI portal
Publication:1709976
Recommendations
Cites work
- A competitive solution for cooperative truckload delivery
- An axiomatization of the Banzhaf value
- Cooperative game theory approach to allocating benefits of horizontal cooperation
- Cost allocation in collaborative forest transportation
- Generalized Network Problems Yielding Totally Balanced Games
- Horizontal cooperation among freight carriers: request allocation and profit sharing
- Introduction to the Theory of Cooperative Games
- Merge-proofness in minimum cost spanning tree problems
- Merging and splitting in cooperative games: some (im)possibility results
- Network models for vehicle and crew scheduling
- On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
- On characterization of the core of lane covering games via dual solutions
- The assignment game. I: The core
Cited in
(3)
This page was built for publication: Pairwise mergers in bipartite matching games with an application in collaborative logistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709976)