Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/98305
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studiesen_US
dc.creatorLiu, Len_US
dc.creatorQi, Xen_US
dc.creatorXu, Zen_US
dc.date.accessioned2023-04-27T01:04:39Z-
dc.date.available2023-04-27T01:04:39Z-
dc.identifier.issn0030-364xen_US
dc.identifier.urihttp://hdl.handle.net/10397/98305-
dc.language.isoenen_US
dc.publisherInstitute for Operations Research and the Management Sciencesen_US
dc.rights© 2018 INFORMSen_US
dc.rightsThis is the accepted manuscript of the following article: Liu, L., Qi, X., & Xu, Z. (2018). Simultaneous penalization and subsidization for stabilizing grand cooperation. Operations Research, 66(5), 1362-1375, which has been published in final form at https://doi.org/10.1287/opre.2018.1723.en_US
dc.subjectCooperative gameen_US
dc.subjectGrand coalition stabilityen_US
dc.subjectParallel machine scheduling gameen_US
dc.subjectSimultaneous penalization and subsidizationen_US
dc.titleSimultaneous penalization and subsidization for stabilizing grand cooperationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1362en_US
dc.identifier.epage1375en_US
dc.identifier.volume66en_US
dc.identifier.issue5en_US
dc.identifier.doi10.1287/opre.2018.1723en_US
dcterms.abstractIn this paper we propose a new instrument, a simultaneous penalization and subsidization, for stabilizing the grand coalition and enabling cooperation among all players of an unbalanced cooperative game. The basic idea is to charge a penalty z from players who leave the grand coalition, and at the same time provide a subsidy ω to players who stay in the grand coalition. To formalize this idea, we establish a penalty-subsidy function ω(z) based on a linear programming model, which allows a decision maker to quantify the trade-off between the levels of penalty and subsidy. By studying function ω(z), we identify certain properties of the trade-off. To implement the new instrument, we design two algorithms to construct function ω(z) and its approximation. Both algorithms rely on solving the value of ω(z) for any given z, for which we propose two effective solution approaches. We apply the new instrument to a class of machine scheduling games, showing its wide applicability.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationOperations research, Sept.-Oct. 2018, v. 66, no. 5, p. 1362-1375en_US
dcterms.isPartOfOperations researchen_US
dcterms.issued2018-09-
dc.identifier.scopus2-s2.0-85064647696-
dc.identifier.eissn1526-5463en_US
dc.description.validate202304 bckwen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberLMS-0283-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextHong Kong Polytechnic Universityen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS24926435-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Xu_Simultaneous_Penalization_Subsidization.pdfPre-Published version1.13 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

84
Citations as of Apr 14, 2025

Downloads

149
Citations as of Apr 14, 2025

SCOPUSTM   
Citations

14
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

9
Citations as of Oct 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.