An optimal bound to access the core in TU-games - HAL Accéder directement au contenu
Article dans une revue Games and Economic Behavior Année : 2013

An optimal bound to access the core in TU-games

Résumé

We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−1n−1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n−1n−1.
Loading...

Dates et versions

halshs-00795480, version 1 (28-02-2013)

Identifiants

Citer

Sylvain Béal, Éric Rémila, Philippe Solal. An optimal bound to access the core in TU-games. Games and Economic Behavior, 2013, 80, pp.1-9. ⟨10.1016/j.geb.2013.02.008⟩. ⟨halshs-00795480⟩
110 Consultations
0 Téléchargements
Dernière date de mise à jour le 20/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus