On the number of blocks required to access the core - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2012

On the number of blocks required to access the core

Résumé

For any transferable utility game in coalitional form with nonempty core, we show that the number of blocks required to switch from an imputation out of the core to a core imputation is less than or equal to n(n−1)/2, where n is the number of players. This number considerably improves the bounds found by Kóczy (2006) [5] and Yang (2010) [11]. Our result relies on an altered version of the procedure proposed by Sengupta and Sengupta (1996) [9]. The use of the Davis-Maschler reduced-games is also pointed out.

Dates et versions

halshs-00662489 , version 1 (24-01-2012)

Identifiants

Citer

Sylvain Béal, Éric Rémila, Philippe Solal. On the number of blocks required to access the core. Discrete Applied Mathematics, 2012, 160 (7-8), pp.925-932. ⟨10.1016/j.dam.2011.12.022⟩. ⟨halshs-00662489⟩
101 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More