The Game of Pass the Buck and the Markov Chain Tree Theorem

We describe a new approach for calculating the winning probabilities in the game of Pass the Buck on arbitrary graphs. It is based on the Markov chain tree theorem, and reduces the problem to counting arborescences in directed graphs. We investigate the game on several classes of graphs, provide short derivations of existing results, and obtain several new ones.