Shapley compensation scheme
We study a particular class of cost sharing games – "data games" – covering situations wheresome players own data which are useful for a project pursued by the set of all players. Theproblem is to set up compensations between players. Data games are subadditive butgenerally not concave, and have a nonempty core. We characterize the core and compute thecompensation scheme derived from the Shapley value. We then compare it to the nucleolus.Although we use the term "data" our analysis actually applies to any good characterized bynon rivalry and excludability.
|Date of creation:||01 Dec 2007|
|Date of revision:|
|Contact details of provider:|| Postal: |
Fax: +32 10474304
Web page: http://www.uclouvain.be/core
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2007094. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS)
If references are entirely missing, you can add them using this form.