Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We explore a sequential offers model of n-person coalitional bargaining with transferable utility and with time discounting. Our focus is on the efficiency properties of stationary equilibria of strictly superadditive games, when the discount factor δ is sufficiently large; we do, however, consider examples of other games where subgame perfectness alone is employed. It is shown that delay and the formation of inefficient subcoalitions can occur in equilibrium, the latter for some or all orders of proposer. However, efficient stationary equilibrium payoffs converge to a point in the core, as δ → 1. Strict convexity is a sufficient condition for there to exist an efficient stationary equilibrium payoff vector for sufficiently high δ. This vector converges as δ → 1 to the egalitarian allocation of Dutta and Ray (1989).