Volume 54, Number 1, January-February 2020
|Page(s)||143 - 161|
|Published online||15 January 2020|
Complexity of inheritance of ℱ-convexity for 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: firstname.lastname@example.org
Accepted: 31 December 2018
Let G = (N, E, w) be a weighted communication graph. For any subset A ⊆ N, we delete all minimum-weight edges in the subgraph induced by A. The connected components of the resultant subgraph constitute the partition 𝒫min(A) of A. Then, for every cooperative game (N, v), the 𝒫min-restricted game (N, v̅) is defined by v̅(A)=∑F∈𝒫min(A)v(F) for all A ⊆ N. We prove that we can decide in polynomial time if there is inheritance of ℱ-convexity, i.e., if for every ℱ-convex game the 𝒫min-restricted game is ℱ-convex, where ℱ-convexity is obtained by restricting convexity to connected subsets. This implies that we can also decide in polynomial time for any unweighted graph if there is inheritance of convexity for Myerson’s graph-restricted game.
Mathematics Subject Classification: 91A12 / 91A43 / 90C27 / 05C75 / 68Q25
Key words: Cooperative game / restricted game / graph partitions / convexity / complexity
© EDP Sciences, ROADEF, SMAI 2020
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.