Incentive Design in Hedonic Games with Permission Structures

Yuta Akahoshi, Yao Zhang, Kei Kimura, Taiki Todo, Makoto Yokoo

2025

Abstract

This paper investigates which coalition structure generation algorithms guarantee the incentive of agents to invite as many colleagues as possible in symmetric additively-separable hedonic games. We first clarify that, the incentive of invitation is not compatible with each of Nash stability and Pareto efficiency. Furthermore, we show that the worst-case ratio of social surplus achieved by any algorithm satisfying the incentive of invitation, compared to the best possible social surplus, is unboundedly small. We then introduce two problem restrictions to achieve somewhat positive results. More specifically, we showed that, when the utility graph of a hedonic game only contains three values, {−p,0, p}, for some positive number p, there exists a polynomial-time algorithm to achieve both the incentive of invitation and 1/n-approximation with respect to the social surplus.

Download


Paper Citation


in Harvard Style

Akahoshi Y., Zhang Y., Kimura K., Todo T. and Yokoo M. (2025). Incentive Design in Hedonic Games with Permission Structures. In Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-758-737-5, SciTePress, pages 184-195. DOI: 10.5220/0013320400003890


in Bibtex Style

@conference{icaart25,
author={Yuta Akahoshi and Yao Zhang and Kei Kimura and Taiki Todo and Makoto Yokoo},
title={Incentive Design in Hedonic Games with Permission Structures},
booktitle={Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2025},
pages={184-195},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013320400003890},
isbn={978-989-758-737-5},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 17th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - Incentive Design in Hedonic Games with Permission Structures
SN - 978-989-758-737-5
AU - Akahoshi Y.
AU - Zhang Y.
AU - Kimura K.
AU - Todo T.
AU - Yokoo M.
PY - 2025
SP - 184
EP - 195
DO - 10.5220/0013320400003890
PB - SciTePress