Please use this identifier to cite or link to this item:
https://repository.iimb.ac.in/handle/2074/14002
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tripathi, Rajeev Ranjan | |
dc.date.accessioned | 2020-08-21T14:26:15Z | - |
dc.date.available | 2020-08-21T14:26:15Z | - |
dc.date.issued | 2019 | |
dc.identifier.uri | https://repository.iimb.ac.in/handle/2074/14002 | - |
dc.description.abstract | When a group of self-interested players plan to take joint action by cooperating with each other, a fundamental issue arises is to agree upon how to allocate the prospective gain from cooperation among the group members in a way that satisfies everyone involved. Players break away from the group if they are not satisfied with the allocation. In this paper, we propose a solution to this issue under a situation when the prospective gain is: (i) risky because participating players are uncertain or ignorant about whether every group member is capable of performing an action or will indeed take an action that benefits the group; and (ii) under externalities because the group can also benefit or lose from some external events or the activities of other players not in the group. To address this issue, we propose a cooperative game model in stochastic partition function form. We propose a solution concept called foresighted nucleolus which characterizes an equitable allocation of payoffs based on the notion of inequity aversion. Players do not break away from the group if the allocation lies in the foresighted nucleolus. We provide a computational method for determining the allocation. Results show that the foresighted nucleolus always exists, but it may not be unique. | |
dc.subject | Cooperation | |
dc.subject | Cooperative game | |
dc.title | Cooperative game under risk and externalities | |
dc.type | Presentation | |
dc.relation.conference | Workshop on Games on Networks and Queues, 18th January 2019, IIT Bombay | |
Appears in Collections: | 2010-2019 P |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.