Phase transition in a sequential assignment problem on graphs

Antal A. Járai

We study the following game on a finite graph $G=(V,E)$. At the start, each edge is assigned an integer $n_e\ge 0$, $n={\sum }_{e\in E}{n}_e$. In round $t$, $1\le t\le n$, a u…