Aspiration-Based Learning in k-Hop Best-Shot Binary Networked Public Goods Games
Abstract
:1. Introduction
2. Model
2.1. Strategy
2.2. Utility
- If agent i chooses to invest (), it incurs an investment cost of c, but also receives benefits b from public goods and access costs r from agents who choose to access agent i within shared scope k. Generally, the investment cost c should be lower than benefits b [27,29,30]. Additionally, the investment cost c is supposed to be higher than access cost r [31], that is . Thus, the utility of agent i is:
- If agent i decides to take a free ride () and accesses another agent who chooses to invest (), then agent i must pay an access cost r to agent . Then he can enjoy the benefits b of the public goods. The utility of agent i is given by the following expression:
- If agent i decides to take a free ride () and accesses another agent who is also a free rider (), then agent i gains no utility from the public goods. The utility of agent i is given by the following expression:
2.3. Cluster
2.4. Updating Mechanism
2.5. Simulation Process
Algorithm 1: Algorithm of model |
Input: undirected graph ; Monte Carlo time steps T Output: network after evolution, utilities of all agents 1: for all agents do 2: Random initialization strategy 3: if then 4: Access to another agent j within shared scope k randomly; 5: end if 6: end for 7: for all agents do 8: Calculate utility according to Equation (4); 9: end for 10: for do 11: for do 12: Select agent i randomly, select a number p greater than 0 but less than 1 randomly; 13: Calculate the possibility P that agent i changes strategy according to Equation (6); 14: if then 15: if the strategy of agent i is investment then 16: agent i changes to take a free ride; 17: agent i access agent j randomly within k scope; 18: else if the strategy of agent i is non-investment then 19: agent i changes to invest; 20: agent i access himself; 21: end if 22: end if 23: end for 24: for all agents do 25: Calculate utility according to Equation (4); 26: end for 27: end for 28: return Outputs |
3. Experiments and Results
- Phenomenon I: As k increases, the color in each subgraph (Figure 2a–d) is lighter (the yellow and white areas in the center grow larger). It indicates that with fixed a and r, as k increases, the social invest level decreases.
- Phenomenon II: In each subgraph, with fixed r, as a ascends, the color also becomes lighter and then darker. It indicates that with fixed r and k, as a increases, the social invest level goes down and then up.
- Phenomenon III: In each subgraph, with fixed a, as r ascends, the color becomes lighter and then darker. It indicates that with fixed a and k, as r increases, the social invest level goes down and then up.
4. Analysis
4.1. Analysis of Phenomenon I
4.1.1. The Impact of K on Social Invest Level
4.1.2. The Relation between K and Association
4.2. Analysis of Phenomenon II
4.2.1. Aspiration Impact on Social Invest Level
4.2.2. The Impact of Varied Levels of Aspiration on Social Development
4.3. Analysis of Phenomenon III
4.3.1. Access Cost Impact on Social Invest Level
4.3.2. The Impact of Varied Levels of Access Cost on Social
- If r can still meet the condition that , investors keep their strategy with high possibility. So at this time, it is the strategy change by the free riders that contributes to the increase of social invest level. In Figure 15a, the number of successful free riders decreases with the increase of r, while the number of investors increases. This indicates that the surrounding free riders are gradually separating from the central investor due to the increasing access costs, and their strategy change to invest.
- As r increases, the number of free riders tends towards zero because of the high access cost. Then the utility of the central investors would be . So the central investors want to change their strategy to take a free ride. In addition, at this time, the surrounding free riders will most likely change their strategy, separating them from central investors. Therefore, Fluctuations occur, as depicted in Figure 15b.
5. Conclusions and Future Work
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
References
- Moyano, A.; Stępniak, M.; Moya-Gómez, B.; García-Palomares, J.C. Traffic congestion and economic context: Changes of spatiotemporal patterns of traffic travel times during crisis and post-crisis periods. Transportation 2021, 48, 3301–3324. [Google Scholar] [CrossRef] [PubMed]
- Honey-Rosés, J.; Anguelovski, I.; Chireh, V.K.; Daher, C.; Konijnendijk van den Bosch, C.; Litt, J.S.; Mawani, V.; McCall, M.K.; Orellana, A.; Oscilowicz, E.; et al. The impact of COVID-19 on public space: An early review of the emerging questions–design, perceptions and inequities. Cities Health 2021, 5, S263–S279. [Google Scholar] [CrossRef]
- Bradbury, J.C.; Coates, D.; Humphreys, B.R. The impact of professional sports franchises and venues on local economies: A comprehensive survey. J. Econ. Surv. 2022. [Google Scholar] [CrossRef]
- Yong, J.C.; Choy, B.K. Noncompliance with safety guidelines as a free-riding strategy: An evolutionary game-theoretic approach to cooperation during the COVID-19 pandemic. Front. Psychol. 2021, 12, 646892. [Google Scholar] [CrossRef]
- Ma, X.; Quan, J.; Wang, X. Effect of reputation-based heterogeneous investment on cooperation in spatial public goods game. Chaos Solitons Fractals 2021, 152, 111353. [Google Scholar] [CrossRef]
- Sigmund, K. The calculus of selfishness. In The Calculus of Selfishness; Princeton University Press: Princeton, NJ, USA, 2010. [Google Scholar]
- Lv, S.; Song, F. Particle swarm intelligence and the evolution of cooperation in the spatial public goods game with punishment. Appl. Math. Comput. 2022, 412, 126586. [Google Scholar] [CrossRef]
- Papadimitriou, C.; Peng, B. Public goods games in directed networks. In Proceedings of the 22nd ACM Conference on Economics and Computation, Budapest, Hungary, 18–23 July 2021; pp. 745–762. [Google Scholar]
- Galeotti, A.; Goyal, S.; Jackson, M.O.; Vega-Redondo, F.; Yariv, L. Network games. Rev. Econ. Stud. 2010, 77, 218–244. [Google Scholar] [CrossRef]
- Hirshleifer, J. From weakest-link to best-shot: The voluntary provision of public goods. Public Choice 1983, 41, 371–386. [Google Scholar] [CrossRef]
- Chowdhury, S.M.; Lee, D.; Sheremeta, R.M. Top guns may not fire: Best-shot group contests with group-specific public good prizes. J. Econ. Behav. Organ. 2013, 92, 94–103. [Google Scholar] [CrossRef]
- Chowdhury, S.M.; Topolyan, I. Best-shot versus weakest-link in political lobbying: An application of group all-pay auction. Soc. Choice Welf. 2016, 47, 959–971. [Google Scholar] [CrossRef]
- Boncinelli, L.; Pin, P. Stochastic stability in best shot network games. Games Econ. Behav. 2012, 75, 538–554. [Google Scholar] [CrossRef]
- Komarovsky, Z.; Levit, V.; Grinshpoun, T.; Meisels, A. Efficient equilibria in a public goods game. In Proceedings of the 2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT), Singapore, 6–9 December 2015; Volume 2, pp. 214–219. [Google Scholar]
- Levit, V.; Komarovsky, Z.; Grinshpoun, T.; Meisels, A. Incentive-based search for efficient equilibria of the public goods game. Artif. Intell. 2018, 262, 142–162. [Google Scholar] [CrossRef]
- Yu, S.; Zhou, K.; Brantingham, J.; Vorobeychik, Y. Computing equilibria in binary networked public goods games. Proc. AAAI Conf. Artif. Intell. 2020, 34, 2310–2317. [Google Scholar] [CrossRef]
- Roth, A.E.; Erev, I. Learning in extensive-form games: Experimental data and simple dynamic models in the intermediate term. Games Econ. Behav. 1995, 8, 164–212. [Google Scholar] [CrossRef]
- Duffy, J.; Feltovich, N. Does observation of others affect learning in strategic environments? An experimental study. Int. J. Game Theory 1999, 28, 131–152. [Google Scholar] [CrossRef] [Green Version]
- Wang, Z.; Li, C.; Jin, X.; Ding, H.; Cui, G.; Yu, L. Evolutionary dynamics of the interdependent security games on complex network. Appl. Math. Comput. 2021, 399, 126051. [Google Scholar] [CrossRef]
- Liu, L.; Wang, S.; Chen, X.; Perc, M. Evolutionary dynamics in the public goods games with switching between punishment and exclusion. Chaos Interdiscip. J. Nonlinear Sci. 2018, 28, 103105. [Google Scholar] [CrossRef] [PubMed] [Green Version]
- Cressman, R.; Song, J.W.; Zhang, B.Y.; Tao, Y. Cooperation and evolutionary dynamics in the public goods game with institutional incentives. J. Theor. Biol. 2012, 299, 144–151. [Google Scholar] [CrossRef] [PubMed]
- Zhang, H.F.; Liu, R.R.; Wang, Z.; Yang, H.X.; Wang, B.H. Aspiration-induced reconnection in spatial public-goods game. Europhys. Lett. 2011, 94, 18006. [Google Scholar] [CrossRef] [Green Version]
- Wang, C.; Wang, L.; Wang, J.; Sun, S.; Xia, C. Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices. Appl. Math. Comput. 2017, 293, 18–29. [Google Scholar] [CrossRef]
- Baitwababo, D. Interface Between Consumer Protection and Competition Law in Tanzania: Critical Areas of Cooperation and Conflict. East. Afr. Law Rev. 2022, 48, 2. [Google Scholar] [CrossRef]
- Goldfarb, A.; Que, V.F. The Economics of Digital Privacy. Annu. Rev. Econ. 2023. [Google Scholar] [CrossRef]
- Bucher, E.; Fieseler, C.; Lutz, C. What’s mine is yours (for a nominal fee)—Exploring the spectrum of utilitarian to altruistic motives for Internet-mediated sharing. Comput. Hum. Behav. 2016, 62, 316–326. [Google Scholar] [CrossRef]
- Shin, K.; Lee, E.; Eswaran, D.; Procaccia, A.D. Why you should charge your friends for borrowing your stuff. arXiv 2017, arXiv:1705.07343. [Google Scholar]
- Cai, L.; Meng, T.; He, T.; Chen, L.; Deng, Z. K-Hop Community Search Based on Local Distance Dynamics. In Proceedings of the Neural Information Processing; Liu, D., Xie, S., Li, Y., Zhao, D., El-Alfy, E.S.M., Eds.; Springer: Cham, Switzerland, 2017; pp. 24–34. [Google Scholar]
- Quan, J.; Li, X.; Wang, X. The evolution of cooperation in spatial public goods game with conditional peer exclusion. Chaos Interdiscip. J. Nonlinear Sci. 2019, 29, 103137. [Google Scholar] [CrossRef] [PubMed]
- Hilbe, C.; Šimsa, Š.; Chatterjee, K.; Nowak, M.A. Evolution of cooperation in stochastic games. Nature 2018, 559, 246–249. [Google Scholar] [CrossRef]
- McAvoy, A.; Fraiman, N.; Hauert, C.; Wakeley, J.; Nowak, M.A. Public goods games in populations with fluctuating size. Theor. Popul. Biol. 2018, 121, 72–84. [Google Scholar] [CrossRef] [Green Version]
- Wang, C.; Huang, C. Between local and global strategy updating in public goods game. Phys. A Stat. Mech. Its Appl. 2022, 606, 128097. [Google Scholar] [CrossRef]
- Quan, J.; Dong, X.; Wang, X. Rational conformity behavior in social learning promotes cooperation in spatial public goods game. Appl. Math. Comput. 2022, 425, 127097. [Google Scholar] [CrossRef]
- Quan, J.; Tang, C.; Zhou, Y.; Wang, X.; Yang, J.B. Reputation evaluation with tolerance and reputation-dependent imitation on cooperation in spatial public goods game. Chaos Solitons Fractals 2020, 131, 109517. [Google Scholar] [CrossRef]
- Ding, H.; Xu, J.H.; Wang, Z.; Ren, Y.Z.; Cui, G.H. Subsidy strategy based on history information can stimulate voluntary vaccination behaviors on seasonal diseases. Phys. A Stat. Mech. Its Appl. 2018, 503, 390–399. [Google Scholar] [CrossRef]
- Fu, F.; Rosenbloom, D.I.; Wang, L.; Nowak, M.A. Imitation dynamics of vaccination behaviour on social networks. Proc. R. Soc. B Biol. Sci. 2011, 278, 42–49. [Google Scholar] [CrossRef] [PubMed]
Low | |
Middle | |
High |
a | 0.5 | 0.6 | 0.7 | 0.8 | 0.9 | 1.0 |
2.64 | 3.55 | 5.76 | 8.7 | 11.1 | 11.4 |
a | 1.1 | 1.2 | 1.3 | 1.4 | 1.5 |
() | 1.5 | 4.3 | 15.9 | 48.2 | 82.9 |
Cheap | |
Expensive |
r | 0 | 0.05 | 0.1 | 0.15 | 0.2 |
() | 87.1 | 85.2 | 38.4 | 11.5 | 5.8 |
r | 0.2 | 0.3 | 0.4 | 0.5 | 0.6 | 0.7 |
4.545 | 3.185 | 2.434 | 1.947 | 1.701 | 1.477 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Chen, Z.; Dai, K.; Jin, X.; Hu, L.; Wang, Y. Aspiration-Based Learning in k-Hop Best-Shot Binary Networked Public Goods Games. Mathematics 2023, 11, 3037. https://doi.org/10.3390/math11143037
Chen Z, Dai K, Jin X, Hu L, Wang Y. Aspiration-Based Learning in k-Hop Best-Shot Binary Networked Public Goods Games. Mathematics. 2023; 11(14):3037. https://doi.org/10.3390/math11143037
Chicago/Turabian StyleChen, Ziyi, Kaiyan Dai, Xing Jin, Liqin Hu, and Yongheng Wang. 2023. "Aspiration-Based Learning in k-Hop Best-Shot Binary Networked Public Goods Games" Mathematics 11, no. 14: 3037. https://doi.org/10.3390/math11143037
APA StyleChen, Z., Dai, K., Jin, X., Hu, L., & Wang, Y. (2023). Aspiration-Based Learning in k-Hop Best-Shot Binary Networked Public Goods Games. Mathematics, 11(14), 3037. https://doi.org/10.3390/math11143037