What is it about?
Imagine you have 10 runners who want to form 3 running groups. Everyone has a preferred running speed, and they want to form groups with others of similar speed, i.e. the differences between their own speed and the speeds of others should be as small as possible. To find a better group, players are allowed to move between, either by swapping with another person, or joining a new group. We introduce a game-theoretic model that models this scenario. To aggregate the distance values, we consider (1) taking the average over all distance values within a group, (2) taking the maximum distance, or (3) defining a threshold and considering the fraction of people above this threshold within a group. We analyze how players move between groups and how much better things get, if we plan these groups centrally instead.
Featured Image
Photo by Jed Villejo on Unsplash
Why is it important?
This work helps to bridge a gap between two research fields, Schelling Games (used for analyzing residential segregation) and Hedonic Games (used for analyzing group formation), by being a link between Continuous Schelling Games and Modified Fractional Hedonic Games.
Perspectives
As a runner at heart, I found it nice that this project not only provides foundational theoretic research, but that this model can also be used to capture an everyday-situation like forming running groups.
Merlin de la Haye
Read the Original
This page is a summary of: Metric Hedonic Games on the Line, International Foundation for Autonomous Agents and Multiagent Systems,
DOI: 10.65109/cjct2898.
You can read the full text:
Contributors
The following have contributed to this page
