Enforcing Cooperation in Finitely Repeated Team Production: Theory and Experiments

This paper reexamines the Holmström’s moral hazard in teams for environments where team production problems are repeated a finite number of times. Motivated by the observation that many real-world team interactions are naturally repeated while much of the literature emphasizes static peer-evaluation rules or repeated-game constructions that rely on infinite horizons, we adapt a Galbraith Mechanism (GM)-style allocation mechanism to a finitely repeated principal–agent team production setting and evaluate its performance both analytically and in the laboratory. We construct a repeated GM allocation that mixes equal sharing with proportional rewards, characterize subgame-perfect equilibria that sustain higher aggregate effort than static equal-share benchmarks, and design credible finite-horizon history-dependent punishments to select efficient equilibria when multiplicity arises. A laboratory experiment on a twice-repeated game tests the mechanism’s static and dynamic predictions under alternative allocation treatments. Our results show that groups under the (repeated GM) proportional allocation exert significantly higher effort than under (one-shot GM) equal sharing, consistent with theoretical predictions. Observed behavior indicates increased cooperation with repeated interaction.