Asset Details
Do you wish to reserve the book?
Envy-freeness in 3D hedonic games
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Envy-freeness in 3D hedonic games
Do you wish to request the book?
Envy-freeness in 3D hedonic games
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Envy-freeness in 3D hedonic games
2024
Overview
We study the problem of fairly partitioning a set of agents into coalitions based on the agents’ additively separable preferences, which can also be viewed as a hedonic game. We study three successively weaker solution concepts, related to envy, weakly justified envy, and justified envy. In a model in which coalitions may have any size, trivial solutions exist for these concepts, which provides a strong motivation for placing restrictions on coalition size. In this paper, we require feasible coalitions to have size three. We study the existence of partitions that are envy-free, weakly justified envy-free, and justified envy-free, and the computational complexity of finding such partitions, if they exist. We impose various restrictions on the agents’ preferences and present a complete complexity classification in terms of these restrictions.
Publisher
Springer US,Springer Nature B.V
