Below 1 — down to 0, above 1 — up to 100
For any p < 1 the chain is the same, only the step differs: at p = 1/2 each step halves the number, at p = 0.9 it trims only a tenth. In Nagel's study the game with p = 1/2 had a first-round average of 27.05, with p = 2/3 it was 36.73.
At p = 1 the winner is whoever guesses the average itself: any common number is stable, and the game becomes a coordination game. At p > 1 the chain runs upwards and the equilibrium is 100. Nagel tested this too: at p = 4/3, 59% and 68% of players named 100 in the third and fourth rounds.
The average can be replaced by the median: the elimination logic is the same, and so is the equilibrium. For whole numbers, a multiplier closer to 1 gives more stable equilibria: at p = 0.9, "everyone says 0, 1, 2, 3 or 4" all qualify.