| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649557 | Discrete Mathematics | 2009 | 8 Pages |
Abstract
In this work we analyze consistency for allocation rules in communication situations. More precisely we characterize the rules proposed by Myerson [R.B. Myerson, Graphs and cooperation in games, Math. Oper. Res. 2, 1977, 225–229; R.B. Myerson, Conference structures and fair allocation rules, Internat J. Game Theory 9 (1980) 169–182] by means of this property.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
M.J. Albizuri, J.M. Zarzuelo,