| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10523889 | Operations Research Letters | 2016 | 5 Pages |
Abstract
An NTU-game consists of payoff sets for every coalition of players. We introduce the concept of supermodularity of a game to guarantee that all its marginal vectors are in the core. As solution we propose a set of payoff vectors that is determined by the average of all marginal vectors, the Shapley set. Conditions are given under which the Shapley set is in the core of the game or is a set of bargaining solutions of a well-defined bargaining problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gleb Koshevoy, Takamasa Suzuki, Dolf Talman,