The multilayer garbage disposal game
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929642570514432 |
|---|---|
| author | Li, Hsin-Lun |
| author_facet | Li, Hsin-Lun |
| contents | The multilayer garbage disposal game is an evolution of the garbage disposal game. Each layer represents a social relationship within a system of finitely many individuals and finitely many layers. An agent can redistribute their garbage and offload it onto their social neighbors in each layer at each time step. We study the game from a mathematical perspective rather than applying game theory. We investigate the scenario where all agents choose to average their garbage before offloading an equal proportion of it onto their social neighbors. It turns out that the garbage amounts of all agents in all layers converge to the initial average of all agents across all layers when all social graphs are connected and have order at least three. This implies that the winners are those agents whose initial total garbage exceeds the average total garbage across all agents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_15942 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The multilayer garbage disposal game Li, Hsin-Lun Dynamical Systems 91C20, 91D25, 94C15 The multilayer garbage disposal game is an evolution of the garbage disposal game. Each layer represents a social relationship within a system of finitely many individuals and finitely many layers. An agent can redistribute their garbage and offload it onto their social neighbors in each layer at each time step. We study the game from a mathematical perspective rather than applying game theory. We investigate the scenario where all agents choose to average their garbage before offloading an equal proportion of it onto their social neighbors. It turns out that the garbage amounts of all agents in all layers converge to the initial average of all agents across all layers when all social graphs are connected and have order at least three. This implies that the winners are those agents whose initial total garbage exceeds the average total garbage across all agents. |
| title | The multilayer garbage disposal game |
| topic | Dynamical Systems 91C20, 91D25, 94C15 |
| url | https://arxiv.org/abs/2412.15942 |