Inheritance of Convexity for the P˜min-Restricted Game

Alexandre Skoda ()
Additional contact information
Alexandre Skoda: UP1 - Université Paris 1 Panthéon-Sorbonne, CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique

Post-Print from HAL

Abstract: We consider a restricted game on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the sub-components obtained with a specific partition P˜min. This partition relies on the same principle as the partition P˜min introduced by Grabisch and Skoda (2012) but restricted to connected coalitions. More precisely, this new partition P˜min is induced by the deletion of the minimum weight edges in each connected component associated with a coalition. We provide a characterization of the graphs satisfying inheritance of convexity from the underlying game to the restricted game associated with P˜min.

Keywords: graph-restricted game; convexity; cooperative game; graph partitions (search for similar items in EconPapers)
Date: 2020-09
Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-02967120v1
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Published in 2020

Downloads: (external link)
https://shs.hal.science/halshs-02967120v1/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:halshs-02967120

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().