Primitive periods in greedy chip-firing games

Source abstract

For a finite irreducible rational transition matrix $P=(P_{ij})$ on $n$ states, the hunger game introduced by Li and Propp is a greedy chip-firing process in which each state $i$ carries a real-valued hunger $h_i$. At each step, a state $i$ of maximal hunger is selected, with ties resolved by a fixed order on the states. Firing $i$ subtracts one from its hunger and then adds $P_{ij}$ to the hunger of each state $j$. Let $π$ be the stationary distribution of $P$, and let $T$ be the least positive integer such that $Tπ$ is integral. We prove that every periodic orbit has least period $T$, with state $i$ firing $Tπ_i$ times, and that the set of periodic states of total hunger zero tiles the corresponding hyperplane by lattice translations. These results settle two conjectures of Li and Propp. We also prove an analogous least-period theorem for nontrivial periodic orbits of fixed-priority chip-firing on finite strongly connected digraphs, another greedy chip-firing model. We then find a connection between the hunger game and the chairman assignment problem: the greedy rule that always chooses the state furthest below its proportional target is precisely a rank-one hunger game. Motivated by this application and related allocation rules, we generalize the hunger game by assigning each state a score that is a nondecreasing function of its hunger and firing a state of maximal score each time. For these monotone-score hunger games, we prove that every periodic orbit still has least period $T$ and give a sufficient condition for eventual periodicity from every initial state.