Bonabeau Model on Fully Occupied Site Graphs

The Bonabeau model describes agents competing for positions through random moves and fights. Originally studied on a finite lattice, an agent moves if a neighboring site is vacant; otherwise, a fight determines the outcome. We analyze the model on fully occupied site graphs, deriving a stability bound for the egalitarian state. Additionally, we propose a variant where all fights end in finite time on any site graph.