Weighted Average-convexity and Cooperative Games
Résumé
We generalize the notion of convexity and average-convexity to the notion of weighted average-convexity. We show several results on the relation between weighted averageconvexity and cooperative games. First, we prove that if a game is weighted averageconvex, then the corresponding weighted Shapley value is in the core. Second, we exhibit necessary conditions for a communication TU-game to preserve the weighted averageconvexity. Finally, we provide a complete characterization when the underlying graph is a priority decreasing tree.
Origine : Fichiers produits par l'(les) auteur(s)