Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
A single long-run player plays a fixed-stage game (simultaneous or sequential move) against an infinite sequence of short-run opponents that play only once but can observe all past realized actions. Assuming that the probability distributions over types of long- and short-run players have full support, we show that the long-run player can always establish a reputation for the Stackelberg strategy and is therefore guaranteed almost his Stackelberg payoff in all Nash equilibria of the repeated game.