2 citations · 2 across the 1 of their papers we have counts for
1 paper
Michael Krivelevich, Nadav Trumer
For integers n,D,q we define a two player perfect information game with no chance moves called the Waiter-Client Maximum Degree game. In this game, two players (Waiter and Clie…