Optimal Sharing Rules in Repeated Partnerships

We study a simple model of repeated partnerships with noisy outcomes. Two partners first choose a sharing rule, under which they start their repeated interaction. We characterize the sharing rule which supports the most efficient equilibrium, and show that it suffices to consider two particular sharing rules. One is an asymmetric sharing rule, which induces only a more productive partner to work. It is optimal for impatient or less productive partners. The other treats them more evenly, and prevails for more productive partnerships with patient partners. Those results indicate that the role of a more productive partner crucially depends on technological parameters and patience. If the partners become more productive or more patient, the productive partner ceases to be a residual claimant and sacrifices his own share, in order to foster teamwork. JEL Classification Numbers: C72, C73, L23, P13. ∗This project started when Ohta was a research fellow under the 21st Century COE Research Program at Kyoto University. Ohta and Sekiguchi thank the Program for support. We are grateful to audience at Yokohama National University, Hitotsubashi University, Shanghai Jiao Tong University, Otaru University of Commerce, Yonsei University, SWET 2007, the 13th Decentralization Conference in Japan, the 2008 spring meeting of Japanese Economic Association, and the 2008 European Meeting of the Econometric Society for helpful comments. We also thank financial support from the Grantsin-Aid for Scientific Research (17730129, 19730145, 19730174, 20530153) and the Inamori Foundation. †College of Economics, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai 599-8531, Japan; khajime@eco.osakafu-u.ac.jp. ‡Faculty of Economics, Wakayama University, 930 Sakaedani, Wakayama 640-8510, Japan; ohta@eco.wakayama-u.ac.jp. §Institute of Economic Research, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan; sekiguchi@kier.kyoto-u.ac.jp.

[1]  Jonathan Levin Relational Incentive Contracts , 2003 .

[2]  D. Fudenberg,et al.  Digitized by the Internet Archive in 2011 with Funding from Working Paper Department of Economics the Folk Theorem with Imperfect Public Information , 2022 .

[3]  R. Radner,et al.  An Example of a Repeated Partnership Game with Discounting and with Uniformly Inefficient Equilibria , 1986 .

[4]  David Pearce,et al.  Information and timing in repeated partnerships , 1991 .

[5]  Hitoshi Matsushima,et al.  Efficiency in partnerships , 1991 .

[6]  Michihiro Kandori,et al.  Randomization, Communication and Efficiency in Repeated Games with Imperfect Public Monitoring , 2001 .

[7]  Ichiro Obara,et al.  Efficiency in Repeated Games Revisited: The Role of Private Strategies (with M. Kandori) , 2004 .

[8]  E. Stacchetti,et al.  Towards a Theory of Discounted Repeated Games with Imperfect Monitoring , 1990 .

[9]  Yeon-Koo Che,et al.  Optimal Incentives for Teams , 2001 .

[10]  Michihiro Kandori,et al.  The Use of Information in Repeated Games with Imperfect Monitoring , 1992 .

[11]  Dilip Abreu On the Theory of Infinitely Repeated Games with Discounting , 1988 .

[12]  H. Demsetz,et al.  Production, Information Costs, and Economic Organization , 1975, IEEE Engineering Management Review.

[13]  H. Hansmann,et al.  The Ownership of Enterprise , 1996 .

[14]  Robert H. Frank,et al.  Are Workers Paid their Marginal Products , 1984 .

[15]  J. Harrington Collusion among asymmetric firms: The case of different discount factors , 1989 .

[16]  Ben R. Craig,et al.  The Behavior of Worker Cooperatives: The Plywood Companies of the Pacific Northwest , 1992 .

[17]  Hitoshi Matsushima,et al.  Efficiency in repeated games with imperfect monitoring , 1989 .

[18]  David Pearce,et al.  The Interaction of Implicit and Explicit Contracts in Repeated Agency , 1998 .

[19]  Bengt Holmstrom,et al.  Moral Hazard in Teams , 1982 .

[20]  M. Aoki THE CONTINGENT GOVERNANCE OF TEAMS: ANALYSIS OF INSTITUTIONAL COMPLEMENTARITY , 1994 .

[21]  Luis Rayo,et al.  Relational Incentives and Moral Hazard in Teams , 2007 .