Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421202 | Discrete Applied Mathematics | 2012 | 8 Pages |
Abstract
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)/2n(n−1)/2, where nn 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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sylvain Béal, Eric Rémila, Philippe Solal,