Volume 53, Number 3, April-June 2019
|Page(s)||841 - 866|
|Published online||28 June 2019|
Convexity of graph-restricted games induced by minimum partitions
Université de Paris I, Centre d’Economie de la Sorbonne, 106-112 Bd de l’Hôpital, 75013 Paris, France
* Corresponding author: email@example.com
Accepted: 5 October 2017
We consider restricted games 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 corresponding to a minimum partition. This minimum partition 𝒫min is i nduced by the deletion of the minimum weight edges. We provide five necessary conditions on the graph edge-weights to have inheritance of convexity from the underlying game to the restricted game associated with 𝒫min. Then, we establish that these conditions are also sufficient for a weaker condition, called ℱ-convexity, obtained by restriction of convexity to connected subsets. Moreover, we prove that inheritance of convexity for Myerson restricted game associated with a given graph G is equivalent to inheritance of ℱ-convexity for the 𝒫min-restricted game associated with a particular weighted graph G′ built from G by adding a dominating vertex, and with only two different edge-weights. Then, we prove that G is cycle-complete if and only if a specific condition on adjacent cycles is satisfied on G′.
Mathematics Subject Classification: 91A12 / 91A43 / 90C27 / 05C75
Key words: Communication networks / cooperative game / convex game / restricted game / partitions
© EDP Sciences, ROADEF, SMAI 2019
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.