Complexity of inheritance of F-convexity for restricted games induced by minimum partitions - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Autre Publication Scientifique Année : 2016

Complexity of inheritance of F-convexity for restricted games induced by minimum partitions

Résumé

Let G = (N,E,w ) be a weighted communication graph (with weight function w on E ). For every subset A ⊆ N, we delete in the subset E (A ) of edges with ends in A, all edges of minimum weight in E (A ). Then the connected components of the corresponding induced subgraph constitue a partition of A that we Pmin(A ). For every game (N , v ), we define the Pmin-restricted game (N , v ) by v (A = ∑F∈ Pmin (A) v(F ) for all A ⊆ N. We prove that we can decide in polynomial time if there is inheritance of F-convexity from N , v ) to the Pmin-restricted game (N , v ) where F-convexity is obtained by restricting convexity to connected subsets
Fichier principal
Vignette du fichier
16055.pdf (590.09 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-01382502 , version 1 (17-10-2016)

Identifiants

  • HAL Id : halshs-01382502 , version 1

Citer

Alexandre Skoda. Complexity of inheritance of F-convexity for restricted games induced by minimum partitions. 2016. ⟨halshs-01382502⟩
117 Consultations
81 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More