Abstract

This paper presents protocols and strategies for coalition formation with incomplete information under time constraints. It focuses on strategies for coalition members to distribute revenues amongst themselves. Such strategies should preferably be stable, lead to a fair distribution, and maximize the social welfare of the agents. These properties are only partially supported by existing coalition formation mechanisms. In particular, stability and the maximization of social welfare are supported only in the case of complete information, and only at a high computational complexity. Recent studies on coalition formation with incomplete and uncertain information address revenue distribution in a naive manner. In this study we specifically refer to environments with limited computational resources and incomplete information. We propose a variety of strategies for revenue distribution, including the strategy in which the agents attempt to distribute the estimated net value of a coalition equally. A variation of the equal distribution strategy in which agents compromise and agree to a payoff lower than their estimated equal share, was specifically examined. Our experimental results show that, under time constraints, the compromise strategy is stable and increases the social welfare compared to non-compromise strategies.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.