Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We axiomatize decreasing impatience (DI) in a discrete-time setting, as originally discussed by Prelec, and formulate a class of recursively-defined discounting functions that conform to DI. The recursive formulation is used to analyze the Ramsey growth problem using dynamic programming techniques.