Abstract
Agents connected in a network face a binary choice whether to contribute or to free-ride. The former action is costly but benefits the agent and her neighbors, while the latter is free, but does not provide any benefits. Who will contribute if agents are farsighted and not constrained by a fixed non-cooperative protocol? I adapt the concepts of consistent sets and farsightedly stable sets to answer this question. When benefits to an agent are linear in the number of her contributing neighbors, the decision to contribute depends on the cohesion of her neighborhood as captured by the graph-theoretical concept of k-cores.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.