Topological distance games
Theoretical Computer Science · 2024-01 · 981 · 114238
DOI: 10.1016/j.tcs.2023.114238 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2024-01. Verfasst von Martin Bullinger und 1 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Education - Singapore, Deutsche Forschungsgemeinschaft, National University of Singapore.
Abstract (Originalsprache)
We introduce a class of strategic games in which agents are assigned to nodes of a topology graph and the utility of an agent depends on both the agent's inherent utilities for other agents as well as her distance from these agents on the topology graph. This model of topological distance games (TDGs) offers an appealing combination of important aspects of several prominent settings in coalition formation, including (additively separable) hedonic games, social distance games, and Schelling games. We study the existence and complexity of stable outcomes in TDGs—for instance, while a jump stable assignment may not exist in general, we show that the existence is guaranteed in several special cases. We also investigate the dynamics induced by performing beneficial jumps.
Förderung
- Ministry of Education - Singapore
- Deutsche Forschungsgemeinschaft
- National University of Singapore
Zitieren
APA
Bullinger, M., & Suksompong, W. (2024). Topological distance games. Theoretical Computer Science, 981, 114238. https://doi.org/10.1016/j.tcs.2023.114238
Vancouver
Bullinger M, Suksompong W. Topological distance games. Theoretical Computer Science. 2024;981:114238. doi:10.1016/j.tcs.2023.114238
BibTeX
@article{Bullinger2024,
author = {Bullinger, Martin and Suksompong, Warut},
title = {Topological distance games},
journal = {Theoretical Computer Science},
year = {2024},
volume = {981},
pages = {114238},
doi = {10.1016/j.tcs.2023.114238}
}
EUVIMED