{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:38:12Z","timestamp":1760146692426,"version":"build-2065373602"},"reference-count":48,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Games"],"abstract":"<jats:p>Graphical games describe strategic interactions among a specified network of players. The threshold protocol game is a graphical game that models the adoption of a lesser-used product in a population when individuals benefit by using the same product. The threshold protocol game has historically been considered using infinite, simple graphs. In general, however, players might value some relationships more than others or may have different levels of influence in the graph. These traits are described by weights on graph edges or vertices, respectively. Relative comparisons on arbitrarily weighted graphs have been studied for a variety of graphical games. Alternatively, graph labelings are functions that assign values to the edges and vertices of graphs based on a particular set of rules. This work demonstrates that the outcome of the threshold protocol game can be characterized on a magic square-generalization labeled graph. There are a variety of graph labelings that generalize the concept of magic squares. In each, the labels on similar sets of graph elements sum to a constant. The constant sums of magic square-generalization labelings mean that each player experiences a constant level of influence without needing to specify the value of players relative to one another. The game outcome is compared across different types and features of labelings.<\/jats:p>","DOI":"10.3390\/g15060042","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T10:52:30Z","timestamp":1733223150000},"page":"42","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Threshold Protocol Game on Graphs with Magic Square-Generalization Labelings"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1949-2290","authenticated-orcid":false,"given":"Alexandra","family":"Fedrigo","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, University of Alabama in Huntsville, 301 Sparkman Drive, Huntsville, AL 35899, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Ba\u010da, M., Miller, M., Ryan, J., and Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1, A. (2019). Magic and Antimagic Graphs: Attributes, Observations and Challenges in Graph Labelings, Springer International Publishing.","DOI":"10.1007\/978-3-030-24582-5"},{"key":"ref_2","unstructured":"Vilfred, V. (1994). Sigma Labelled Graphs and Circulant Graphs. [Ph.D. Thesis, University of Kerala]."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1016\/j.disc.2008.02.038","article-title":"On sigma and sigma\u2019 labelled graphs","volume":"309","author":"Beena","year":"2009","journal-title":"Discret. Math."},{"key":"ref_4","first-page":"3","article-title":"Vertex-magic total labelings of graphs","volume":"61","author":"Macdougall","year":"2002","journal-title":"Util. Math."},{"key":"ref_5","first-page":"4","article-title":"A Dynamic Survey of Graph Labeling","volume":"6","author":"Gallian","year":"2022","journal-title":"Electron. J. Comb."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1817","DOI":"10.1016\/j.disc.2006.03.064","article-title":"Consecutive magic graphs","volume":"306","author":"Balbuena","year":"2006","journal-title":"Discret. Math."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"451","DOI":"10.4153\/CMB-1970-084-1","article-title":"Magic Valuations of Finite Graphs","volume":"13","author":"Kotzig","year":"1970","journal-title":"Can. Math. Bull."},{"key":"ref_8","unstructured":"Kearns, M., Littman, M.L., and Singh, S. (2001, January 2\u20135). Graphical models for game theory. Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, Seattle, WA, USA. UAI\u201901."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Smyrnakis, M., Freris, N.M., and Tembine, H. (2018). Consensus over evolutionary graphs. arXiv.","DOI":"10.23919\/ECC.2018.8550392"},{"key":"ref_10","unstructured":"Kearns, M., Littman, M.L., and Singh, S. (2015). Graphical Models for Game Theory. arXiv."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Mikkelsen, K.B., and Bach, L.A. (2016). Threshold Games and Cooperation on Multiplayer Graphs. PLoS ONE, 11.","DOI":"10.1371\/journal.pone.0152340"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.2307\/2951493","article-title":"Learning, Local Interaction, and Coordination","volume":"61","author":"Ellison","year":"1993","journal-title":"Econometrica"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"627","DOI":"10.3982\/ECTA10740","article-title":"Stochastic Learning Dynamics and Speed of Convergence in Population Games: Stochastic Learning Dynamics","volume":"84","author":"Arieli","year":"2016","journal-title":"Econometrica"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5690","DOI":"10.1109\/TIT.2015.2468584","article-title":"Consensus Over Random Graph Processes: Network Borel\u2013Cantelli Lemmas for Almost Sure Convergence","volume":"61","author":"Shi","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Zick, Y., Chalkiadakis, G., Elkind, E., and Markakis, E. (2014). Cooperative Games with Overlapping Coalitions: Charting the Tractability Frontier. arXiv.","DOI":"10.1613\/jair.4237"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.tcs.2010.11.002","article-title":"Equilibria of graphical games with symmetries","volume":"412","author":"Brandt","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref_17","unstructured":"Hirvonen, J., Schmid, L., Chatterjee, K., and Schmid, S. (2021). Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory. arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Kuo, Y.P., and Carja, O. (2024). Evolutionary graph theory beyond pairwise interactions: Higher-order network motifs shape times to fixation in structured populations. PLoS Comput. Biol., 20.","DOI":"10.1371\/journal.pcbi.1011905"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"20021002","DOI":"10.2202\/1534-5963.1044","article-title":"Local Conventions","volume":"2","author":"Ely","year":"2002","journal-title":"BE J. Theor. Econ."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Rahmani, A., and Mesbahi, M. (2006, January 14\u201316). On the controlled agreement problem. Proceedings of the 2006 American Control Conference, Minneapolis, MN, USA.","DOI":"10.1109\/ACC.2006.1656409"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Mesbahi, M., and Egerstedt, M. (2010). Graph Theoretic Methods in Multiagent Networks, Princeton University Press. [stu-student edition ed.].","DOI":"10.1515\/9781400835355"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2007.04.004","article-title":"Evolutionary games on graphs","volume":"446","year":"2007","journal-title":"Phys. Rep."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Goyal, S., and Kearns, M. (2012, January 19\u201322). Competitive contagion in networks. Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA.","DOI":"10.1145\/2213977.2214046"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"113018","DOI":"10.1088\/1367-2630\/ac3319","article-title":"The dual problems of coordination and anti-coordination on random bipartite graphs","volume":"23","author":"Jones","year":"2021","journal-title":"New J. Phys."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1560","DOI":"10.1126\/science.1133755","article-title":"Five Rules for the Evolution of Cooperation","volume":"314","author":"Nowak","year":"2006","journal-title":"Science"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Wang, Z., Szolnoki, A., and Perc, M. (2013). Optimal interdependence between networks for the evolution of cooperation. Sci. Rep., 3.","DOI":"10.1038\/srep02470"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/978-3-642-17572-5_48","article-title":"Threshold Models for Competitive Influence in Social Networks","volume":"Volume 6484","author":"Saberi","year":"2010","journal-title":"Internet and Network Economics"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Brandt, F. (2016). Handbook of Computational Social Choice, Cambridge University Press.","DOI":"10.1017\/CBO9781107446984.002"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Simko, G.I., and Csermely, P. (2013). Nodes Having a Major Influence to Break Cooperation Define a Novel Centrality Measure: Game Centrality. PLoS ONE, 8.","DOI":"10.1371\/journal.pone.0067159"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Ghosh, R., and Lerman, K. (2014). Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis. arXiv.","DOI":"10.3934\/dcdsb.2014.19.1355"},{"key":"ref_31","unstructured":"Gal, K., Nguyen, T.D., Zick, Y., and Tran, Q. (2020, January 9\u201313). Threshold Task Games: Theory, Platform and Experiments. Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2020), Auckland, New Zealand."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Easley, D., and Kleinberg, J. (2010). Networks, Crowds, and Markets: Reasoning About a Highly Connected World, Cambridge University Press.","DOI":"10.1017\/CBO9780511761942"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/978-3-030-83823-2_34","article-title":"Results on the Graceful Game and Range-Relaxed Graceful Game","volume":"Volume 14","author":"Perarnau","year":"2021","journal-title":"Extended Abstracts EuroComb 2021"},{"key":"ref_34","first-page":"135","article-title":"Edge-sum distinguishing labeling","volume":"62","author":"Jan","year":"2021","journal-title":"Comment. Math. Univ. Carol."},{"key":"ref_35","first-page":"67","article-title":"A game based on vertex-magic total labelings","volume":"29","author":"Boudreau","year":"2004","journal-title":"Australas. J. Comb."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1016\/j.disc.2012.07.002","article-title":"The game L (d,1) -labeling problem of graphs","volume":"312","author":"Chia","year":"2012","journal-title":"Discret. Math."},{"key":"ref_37","first-page":"163","article-title":"A vertex-magic edge labeling game","volume":"161","author":"Hartnell","year":"2003","journal-title":"Congr. Numer."},{"key":"ref_38","first-page":"423","article-title":"Graceful game on some graph classes","volume":"58","author":"Artigas","year":"2023","journal-title":"RAIRO-Oper. Res."},{"key":"ref_39","unstructured":"Frickes, L., Dantas, S., and Luiz, A.G. (2020). On the Graceful Game. arXiv."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2022.04.019","article-title":"The general position achievement game played on graphs","volume":"317","author":"Neethu","year":"2022","journal-title":"Discret. Appl. Math."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Jafari, S., and Navidi, H. (2018). A Game-Theoretic Approach for Modeling Competitive Diffusion over Social Networks. Games, 9.","DOI":"10.3390\/g9010008"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","article-title":"Maximizing the Spread of Influence through a Social Network","volume":"11","author":"Kempe","year":"2015","journal-title":"Theory Comput."},{"key":"ref_43","unstructured":"Kleinberg, J. (2011). Cascading Behavior in Networks: Algorithmic and Economic Issues. Algorithmic Game Theory, Cambridge University Press."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1111\/1467-937X.00121","article-title":"Contagion","volume":"67","author":"Morris","year":"2000","journal-title":"Rev. Econ. Stud."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0195-6698(88)80066-0","article-title":"Magic Graphs, a Characterization","volume":"9","author":"Jeurissen","year":"1988","journal-title":"Eur. J. Comb."},{"key":"ref_46","unstructured":"West, D.B. (2018). Introduction to Graph Theory, Pearson. [2nd ed.]. Pearson Modern Classic."},{"key":"ref_47","first-page":"68","article-title":"Vertex-magic total labelings of complete graphs","volume":"33","author":"Lin","year":"2001","journal-title":"Bull. Inst. Combin. Appl."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On Representatives of Subsets","volume":"s1\u201310","author":"Hall","year":"1935","journal-title":"J. Lond. Math. Soc."}],"container-title":["Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-4336\/15\/6\/42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:46:08Z","timestamp":1760114768000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-4336\/15\/6\/42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":48,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["g15060042"],"URL":"https:\/\/doi.org\/10.3390\/g15060042","relation":{},"ISSN":["2073-4336"],"issn-type":[{"type":"electronic","value":"2073-4336"}],"subject":[],"published":{"date-parts":[[2024,12,3]]}}}