Payoff Polarization and Garbage Concentration in a Stochastic Garbage Disposal Game

Source abstract

We study a stochastic garbage disposal game on a finite graph in which agents transfer garbage through pairwise interactions governed by payoff-dependent Fermi probabilities. We investigate the long-term behavior of both payoffs and garbage distributions. We prove that payoff dispersion grows at least linearly in time almost surely, leading to payoff polarization, with the maximum and minimum payoffs diverging to positive and negative infinity, respectively. Moreover, the payoff range grows at least on the order of the square root of time. For garbage dynamics, we establish almost-sure concentration on a single agent in the two-agent case for any positive disposal efficiency. When disposal is complete and the underlying graph is connected, we further prove that all garbage becomes concentrated on a single agent after a finite random time, although the agent holding the garbage may change over time. These results characterize the emergence of payoff inequality and garbage concentration in stochastic competitive interactions on networks.