Inheritance of Convexity for the π«Μ_min-Restricted Game
share
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 π«Μ_min. This partition relies on the same principle as the partition π«_min introduced by Grabisch and Skoda (2012) but restricted to connected coalitions. More precisely, this new partition π«Μ_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 π«Μ_min.
READ FULL TEXT
