Threshold Protocol Game on Graphs with Magic Square-Generalization Labelings
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 bee...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-12-01
|
| Series: | Games |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-4336/15/6/42 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2073-4336 |