Name
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)/2, where n is the number of players. This number considerably improves the bounds found by Koczy (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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.dam.2011.12.022 | Discrete Applied Mathematics |
Keywords | Field | DocType |
davis-maschler reduced-games,altered version,transferable utility game,coalitional form,nonempty core,core imputation,upper bound,core,transferable utility | Discrete mathematics,Combinatorics,Transferable utility,Imputation (statistics),Mathematics | Journal |
Volume | Issue | ISSN |
160 | 7-8 | 0166-218X |
Citations | PageRank | References |
2 | 0.42 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sylvain Béal | 1 | 70 | 12.23 |
| Eric Rémila | 2 | 329 | 45.22 |
| Philippe Solal | 3 | 79 | 14.55 |