Complexity of inheritance of $\mathcal{F}$-convexity for restricted games induced by minimum partitions

Alexandre Skoda

Let $G=(N,E,w)$ be a weighted communication graph (with weight function $w$ on $E$). For every subset $A\subseteq N$, we delete in the subset $E(A)$ of edges with ends in $A$, a…