Topological distance games

DOI10.1016/j.tcs.2023.114238arXiv2211.11000OpenAlexW4387475908MaRDI QIDQ6118301

Warut Suksompong, Martin Bullinger

Publication date: 23 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.11000

zbMATH Keywords

stabilitydynamicsstrategic gamestopological distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Computing desirable partitions in additively separable hedonic games
• The stability of hedonic coalition structures
• Convergence and hardness of strategic Schelling segregation
• Individual and group stability in neutral restrictions of hedonic games
• Computational complexity in additive hedonic games
• Schelling segregation with strategic agents
• Schelling games on graphs
• The exchange-stable marriage problem
• Simple Local Search Problems that are Hard to Solve
• Topological sorting of large networks
• Reducibility among Combinatorial Problems
• Welfare Guarantees in Schelling Segregation
• Hedonic Games with Ordinal Preferences and Thresholds
• Hedonic Games
• College Admissions and the Stability of Marriage

This page was built for publication: Topological distance games