Abstract
We consider cost allocation for set covering problems. We allocate as much cost to the elements (players) as possible without violating the group rationality condition, and so that the excess vector is lexicographically maximized. This happy nucleolus has several nice properties. In particular, we show that it can be computed considering a small subset of “simple” coalitions only. While computing the nucleolus for set covering is NP-hard, our results imply that the happy nucleolus can be computed in polynomial time.
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 callDisclaimer: 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.
