Pairwise mergers in bipartite matching games with an application in collaborative logistics

Tools

Hezarkhni, Behzad (2016) Pairwise mergers in bipartite matching games with an application in collaborative logistics. Operations Research Letters, 44 (6). pp. 818-822. ISSN 0167-6377

[thumbnail of pairwise mergers in bipartite.pdf]
Preview
 PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Available under Licence Creative Commons Attribution Non-commercial No Derivatives.
Download (292kB) | Preview

Abstract

Merging among players in a cooperative game can alter the structure of the core. This paper shows that in bipartite matching games, if pairs of players from different sides merge, the structure of the core remains unchanged. This allows us to extend the well-known result regarding the characterization of the core with dual solutions for simple games to their associated pairwise merger games. We introduce the class of vehicle scheduling games as an area of application for our result.

Item Type: Article
Keywords: Cooperative game theory; Bipartite matching; Core; Logistics; Collaboration
Schools/Departments: University of Nottingham, UK > Faculty of Social Sciences > Nottingham University Business School
Identification Number: 10.1016/j.orl.2016.10.004
Depositing User: Fuller, Stella
Date Deposited: 02 Dec 2016 09:44
Last Modified: 17 Apr 2018 14:26
URI: https://eprints.nottingham.ac.uk/id/eprint/39121

Actions (Archive Staff Only)

Edit View Edit View