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

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 characterizati...

Full description

Bibliographic Details
Main Author: Hezarkhni, Behzad
Format: Article
Language:English
Published: Elsevier 2016
Subjects:
Online Access:https://eprints.nottingham.ac.uk/39121/
_version_ 1848795767646453760
author Hezarkhni, Behzad
author_facet Hezarkhni, Behzad
author_sort Hezarkhni, Behzad
building Nottingham Research Data Repository
collection Online Access
description 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.
first_indexed 2025-11-14T19:37:19Z
format Article
id nottingham-39121
institution University of Nottingham Malaysia Campus
institution_category Local University
language English
last_indexed 2025-11-14T19:37:19Z
publishDate 2016
publisher Elsevier
recordtype eprints
repository_type Digital Repository
spelling nottingham-391212018-04-17T14:26:48Z https://eprints.nottingham.ac.uk/39121/ Pairwise mergers in bipartite matching games with an application in collaborative logistics Hezarkhni, Behzad 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. Elsevier 2016-10-14 Article PeerReviewed application/pdf en cc_by_nc_nd https://eprints.nottingham.ac.uk/39121/1/pairwise%20mergers%20in%20bipartite.pdf 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 Cooperative game theory; Bipartite matching; Core; Logistics; Collaboration http://www.sciencedirect.com/science/article/pii/S0167637716301183 doi:10.1016/j.orl.2016.10.004 doi:10.1016/j.orl.2016.10.004
spellingShingle Cooperative game theory; Bipartite matching; Core; Logistics; Collaboration
Hezarkhni, Behzad
Pairwise mergers in bipartite matching games with an application in collaborative logistics
title Pairwise mergers in bipartite matching games with an application in collaborative logistics
title_full Pairwise mergers in bipartite matching games with an application in collaborative logistics
title_fullStr Pairwise mergers in bipartite matching games with an application in collaborative logistics
title_full_unstemmed Pairwise mergers in bipartite matching games with an application in collaborative logistics
title_short Pairwise mergers in bipartite matching games with an application in collaborative logistics
title_sort pairwise mergers in bipartite matching games with an application in collaborative logistics
topic Cooperative game theory; Bipartite matching; Core; Logistics; Collaboration
url https://eprints.nottingham.ac.uk/39121/
https://eprints.nottingham.ac.uk/39121/
https://eprints.nottingham.ac.uk/39121/