On Maximizing Egalitarian Value in K-coalitional Hedonic Games

01/29/2020
by   Naftali Waxman, et al.
0

This paper considers the problem of dividing agents among coalitions. We concentrate on Additively Separable Hedonic Games (ASHG's), in which each agent has a non-negative value for every other agent and her utility is the sum of the values she assigns to the members of her coalition. Unlike previous work, we analyze a model where exactly k coalitions must be formed, and the goal is to maximize the utility of the agent which is worst off, i.e., the egalitarian social welfare. We show that this problem is hard, even when the number of agents should be equally divided among the coalitions. We thus propose a heuristic that maximizes the egalitarian social welfare and maximizes the average utility of each agent as a secondary goal. Using extensive simulations, both on synthetic and real data, we demonstrate the effectiveness of our approach. Specifically, our heuristic provides solutions that are much fairer than the solutions that maximize the average social welfare, while still providing a relatively high average social welfare.

READ FULL TEXT
research
05/16/2018

On Fair Division of Indivisible Items

We consider the task of assigning indivisible goods to a set of agents i...
research
01/11/2022

A Negotiating Strategy for a Hybrid Goal Function in Multilateral Negotiation

In various multi-agent negotiation settings, a negotiator's utility depe...
research
05/20/2021

Manipulation of k-Coalitional Games on Social Networks

In many coalition formation games the utility of the agents depends on a...
research
07/11/2023

Maximizing Social Welfare in Score-Based Social Distance Games

Social distance games have been extensively studied as a coalition forma...
research
03/31/2020

A Note on the Provision of a Public Service of Different Quality

We study how the quality dimension affects the social optimum in a model...
research
06/21/2018

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance

This paper is devoted to the two-opposite-facility location games with a...
research
04/14/2023

QuACS: Variational Quantum Algorithm for Coalition Structure Generation in Induced Subgraph Games

Coalition Structure Generation (CSG) is an NP-Hard problem in which agen...

Please sign up or login with your details

Forgot password? Click here to reset