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....