Strategic resource selection with homophilic agents
Article No.: 301, Pages 2701 - 2709
Abstract
The strategic selection of resources by selfish agents is a classic research direction, with Resource Selection Games and Congestion Games as prominent examples. In these games, agents select available resources and their utility then depends on the number of agents using the same resources. This implies that there is no distinction between the agents, i.e., they are anonymous.
We depart from this very general setting by proposing Resource Selection Games with heterogeneous agents that strive for joint resource usage with similar agents. So, instead of the number of other users of a given resource, our model considers agents with different types and the decisive feature is the fraction of same-type agents among the users. More precisely, similarly to Schelling Games, there is a tolerance threshold τ ∈ [0, 1] which specifies the agents' desired minimum fraction of sametype agents on a resource. Agents strive to select resources where at least a τ-fraction of those resources' users have the same type as themselves. For τ = 1, our model generalizes Hedonic Diversity Games with a peak at 1.
For our general model, we consider the existence and quality of equilibria and the complexity of maximizing social welfare. Additionally, we consider a bounded rationality model, where agents can only estimate the utility of a resource, since they only know the fraction of same-type agents on a given resource, but not the exact numbers. Thus, they cannot know the impact a strategy change would have on a target resource. Interestingly, we show that this type of bounded rationality yields favorable game-theoretic properties and specific equilibria closely approximate equilibria of the full knowledge setting.
References
[1]
Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, and Alexandros A. Voudouris. Schelling games on graphs. Artif. Intell., 301:103576, 2021.
[2]
Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Éva. Tardos, Tom Wexler, and Tim Roughgarden. The Price of Stability for Network Design with Fair Cost Allocation. In FOCS, pages 295-304, 2004.
[3]
Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor. Tolerance is necessary for stability: Single-peaked swap schelling games. In IJCAI, pages 81-87, 2022.
[4]
Davide Bilò, Vittorio Bilò, Pascal Lenzner, and Louise Molitor. Topological influence and locality in swap schelling games. AAMAS, 36(2):47, 2022.
[5]
Niclas Boehmer and Edith Elkind. Individual-based stability in hedonic diversity games. In AAAI, pages 1822-1829, 2020.
[6]
Robert Bredereck, Edith Elkind, and Ayumi Igarashi. Hedonic diversity games. In AAMAS, pages 565-573, 2019.
[7]
Martin Bullinger, Warut Suksompong, and Alexandros A. Voudouris. Welfare guarantees in schelling segregation. J. Artif. Intell. Res., 71:143-174, 2021.
[8]
Martin Bullinger, Pascal Lenzner, and Anna Melnichenko. Network creation with homophilic agents. In IJCAI, pages 151-157, 2022.
[9]
Simon Burgess, Deborah Wilson, and Ruth Lupton. Parallel lives? Ethnic segregation in schools and neighbourhoods. Urban studies, 42(7):1027-1056, 2005.
[10]
Bugra Çaskurlu, Fatih Erdem Kizilkaya, and Berkehan Ozen. Hedonic expertise games. In SAGT, pages 314-328, 2021.
[11]
Ankit Chauhan, Pascal Lenzner, and Louise Molitor. Schelling segregation with strategic agents. In SAGT, pages 137-149, 2018.
[12]
Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Gerhard Woeginger. Group activity selection problem. In WINE, pages 156-169, 2012.
[13]
Andreas Darmann. Hedonic diversity games revisited. In ADT, pages 357-372, 2021.
[14]
Hagen Echzell, Tobias Friedrich, Pascal Lenzner, Louise Molitor, Marcus Pappik, Friedrich Schöne, Fabian Sommer, and David Stangl. Convergence and hardness of strategic schelling segregation. In WINE, pages 156-170, 2019.
[15]
Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.
[16]
Tobias Friedrich, Pascal Lenzner, Louise Molitor, and Lars Seifert. Single-peaked jump schelling games. CoRR, abs/2302.12107, 2023.
[17]
Jonathan Gadea Harder, Simon Krogmann, Pascal Lenzner, and Alexander Skopalik. Strategic resource selection with homophilic agents. CoRR, abs/2305.00843, 2023.
[18]
Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, and Ondrej Suchý. Hedonic diversity games: A complexity picture with more than two colors. In AAAI, pages 5034-5042, 2022.
[19]
Chantal A. Hailey. Racial preferences for schools: Evidence from an experiment with white, black, latinx, and asian parents and students. Sociology of Education, 95(2):110-132, 2022.
[20]
John E. Hopcroft and Richard M. Karp. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225- 231, 1973.
[21]
Ayumi Igarashi, Dominik Peters, and Edith Elkind. Group activity selection on social networks. In AAAI, 2017.
[22]
Panagiotis Kanellopoulos, Maria Kyropoulou, and Alexandros A. Voudouris. Modified schelling games. Theor. Comput. Sci., 880:1-19, 2021.
[23]
Panagiotis Kanellopoulos, Maria Kyropoulou, and Alexandros A. Voudouris. Not all strangers are the same: The impact of tolerance in schelling games. In MFCS, pages 60:1-60:14, 2022.
[24]
Elon Kohlberg. Equilibrium Store Locations When Consumers Minimize Travel Time Plus Waiting Time. Economics Letters, 11(3):211-216, 1983.
[25]
Simon Krogmann, Pascal Lenzner, Louise Molitor, and Alexander Skopalik. Two-stage facility location games with strategic clients and facilities. In IJCAI, pages 292-298, 2021.
[26]
Simon Krogmann, Pascal Lenzner, and Alexander Skopalik. Strategic facility location with clients that minimize total waiting time. In AAAI, 2023.
[27]
Douglas S Massey and Nancy A Denton. The dimensions of residential segregation. Social forces, 67(2):281-315, 1988.
[28]
Igal Milchtaich. Congestion games with player-specific payoff functions. Games and economic behavior, 13(1):111-124, 1996.
[29]
Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial optimization: algorithms and complexity. Courier Corporation, 1998.
[30]
Hans Peters, Marc Schröder, and Dries Vermeulen. Hotelling's location model with negative network externalities. Int. J. Game Theory, 47:811-837, 2018.
[31]
Robert W. Rosenthal. A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory, 2(1):65-67, 12 1973.
[32]
Tim Roughgarden and Éva Tardos. How bad is selfish routing? J. ACM, 49(2):236- 259, 2002.
[33]
Thomas C. Schelling. Dynamic models of segregation. The Journal of Mathematical Sociology, 1(2):143-186, 1971.
[34]
Adrian Vetta. Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions. FOCS, pages 416-425, 2002.
[35]
Berthold Vöcking. Selfish load balancing. Algorithmic game theory, 20:517-542, 2007.
Index Terms
- Strategic resource selection with homophilic agents
Index terms have been assigned to the content through auto-classification.
Recommendations
Strategic agents for multi-resource negotiation
In electronic commerce markets where selfish agents behave individually, agents often have to acquire multiple resources in order to accomplish a high level task with each resource acquisition requiring negotiations with multiple resource providers. ...
Nash Social Welfare Approximation for Strategic Agents
EC '17: Proceedings of the 2017 ACM Conference on Economics and ComputationThe fair division of resources among strategic agents is an important age-old problem that has led to a rich body of literature. At the center of this literature lies the question of whether there exist mechanisms that can implement fair outcomes, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2023 International Joint Conferences on Artificial Intelligence.
Sponsors
- International Joint Conferences on Artifical Intelligence (IJCAI)
Publisher
Unknown publishers
Publication History
Published: 19 August 2023
Qualifiers
- Research-article
- Research
- Refereed limited
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Nov 2024