Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.15942

The multilayer garbage disposal game

Hsin-Lun Li
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hsin-Lun Li. 2024-12-20. The multilayer garbage disposal game. https://arxiv.org/abs/2412.15942

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Pivoting technique for the circle homeomorphism group

We adapt Gou{ë}zel's pivoting technique to the circle homeomorphism group. As an application, we give different proofs of Gilabert Vio's probabilistic Tits alternative and Malicet's exponential synchronization.

math.DS↗
arXiv2026

Optimal rates of uniform convergence for weighted Birkhoff averages via almost all rotations

In this paper, we investigate weighted Birkhoff averages for toral translations associated with compactly supported weighting functions. By introducing several new analytical techniques, we establish optimal uniform convergence rates for almost all rotations and specific (or even all) initial points. Unlike the $\mathcal{O}(N^{-1})$ rate best achieved in classical ergodic theory, we show that these weighted averages exhibit polynomial or even exponential convergence. We establish the optimality of these convergence rates in multiple aspects, particularly concerning regularity indices across four distinct cases: finite differentiability, the $C^\infty$ class, logarithmic $C^\infty$ classes, and Gevrey classes. Our results demonstrate that the regularity of the observable essentially dictates the convergence rate; furthermore, we prove that no admissible choice of weighting function can, in general, overcome the lower bounds imposed by this regularity. In contrast to the generically slow convergence of standard time averages, this work provides an optimal and nearly complete characterization of rapid convergence for weighted Birkhoff averages.

math.DS↗
arXiv2026

Spectral theory of frame flows on closed hyperbolic manifolds

We prove a resolvent estimate for the generator of the frame flow on hyperbolic manifolds away from vertical lines of resonances. A byproduct of the proof is an optimal essential spectral gap property for the generator, hence giving another proof of exponential mixing of frame flows with respect to the volume measure of the frame bundle. This extends the result of [https://arxiv.org/abs/2005.08387v2] in dimension 3 to any dimension. We make extensive use of the Borel-Weil calculus developed in [https://arxiv.org/abs/2405.14846] to overcome difficulties of this higher-dimensional case.

math.DS↗