Dokument: The complexity of verifying popularity and strict popularity in altruistic hedonic games
| Titel: | The complexity of verifying popularity and strict popularity in altruistic hedonic games | |||||||
| URL für Lesezeichen: | https://docserv.uni-duesseldorf.de/servlets/DocumentServlet?id=67905 | |||||||
| URN (NBN): | urn:nbn:de:hbz:061-20241206-091649-1 | |||||||
| Kollektion: | Publikationen | |||||||
| Sprache: | Englisch | |||||||
| Dokumententyp: | Wissenschaftliche Texte » Artikel, Aufsatz | |||||||
| Medientyp: | Text | |||||||
| Autoren: | Kerkmann, Anna Maria [Autor] Rothe, Jörg [Autor] | |||||||
| Dateien: |
| |||||||
| Stichwörter: | Coalition formation, Popularity, Cooperative game theory, Altruism, Hedonic game | |||||||
| Beschreibung: | We consider average- and min-based altruistic hedonic games and study the problem of verifying popular and strictly popular coalition structures. While strict popularity verification has been shown to be coNP-complete in min-based altruistic hedonic games, this problem has been open for equal- and altruistic-treatment average-based altruistic hedonic games. We solve these two open cases of strict popularity verification and then provide the first complexity results for popularity verification in (average- and min-based) altruistic hedonic games, where we cover all three degrees of altruism. | |||||||
| Rechtliche Vermerke: | Originalveröffentlichung:
Kerkmann, A. M., & Rothe, J. (2024). The complexity of verifying popularity and strict popularity in altruistic hedonic games. Autonomous Agents and Multi-Agent Systems , 38(2), Article 47. https://doi.org/10.1007/s10458-024-09679-0 | |||||||
| Lizenz: |  Dieses Werk ist lizenziert unter einer Creative Commons Namensnennung 4.0 International Lizenz | |||||||
| Fachbereich / Einrichtung: | Mathematisch- Naturwissenschaftliche Fakultät | |||||||
| Dokument erstellt am: | 06.12.2024 | |||||||
| Dateien geändert am: | 06.12.2024 |
