Pairwise mergers in bipartite matching games with an application in collaborative logistics
type: Item
instance of: scholarly article
title: Pairwise mergers in bipartite matching games with an application in collaborative logistics
zbMATH Open document ID: 1408.91056
author: Behzad Hezarkhani
published in: Operations Research Letters
publication date: 2019-01-15T00:00:00Z
full work available at URL: pairwise mergers in bipartite.pdf
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 91B68
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 7002357
zbMATH Keywords: cooperative game theory
zbMATH Keywords: bipartite matching
zbMATH Keywords: core
zbMATH Keywords: logistics
zbMATH Keywords: collaboration
MaRDI profile type: Publication
OpenAlex ID: W2537954979
cites work: Network models for vehicle and crew scheduling
cites work: Cost allocation in collaborative forest transportation
cites work: Merge-proofness in minimum cost spanning tree problems
cites work: On characterization of the core of lane covering games via dual solutions
cites work: A competitive solution for cooperative truckload delivery
cites work: Generalized Network Problems Yielding Totally Balanced Games
cites work: Merging and splitting in cooperative games: some (im)possibility results
cites work: Horizontal cooperation among freight carriers: request allocation and profit sharing
cites work: An axiomatization of the Banzhaf value
cites work: Cooperative game theory approach to allocating benefits of horizontal cooperation
cites work: On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs
cites work: Introduction to the Theory of Cooperative Games
cites work: The assignment game. I: The core
DOI: 10.1016/J.ORL.2016.10.004
description: scientific article; zbMATH DE number 7002357