Incomplete Contracts and Complexity Costs

Theory and Decision 46 (1):23-50 (1999)
  Copy   BIBTEX

Abstract

This paper investigates, in a simple risk-sharing framework, the extent to which the incompleteness of contracts could be attributed to the complexity costs associated with the writing and the implementation of contracts. We show that, given any measure of complexity in a very general class, it is possible to find simple contracting problems such that, when complexity costs are explicitly taken into account, the contracting parties optimally choose an incomplete contract which coincides with the ‘default’ division of surplus. Optimal contracts with complexity costs are constrained efficient in our model. We therefore interpret our results as saying that, in the absence of a strategic role for complexity costs, their effect is entirely determined by their size relative to the size of payoffs

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-09-02

Downloads
97 (#175,561)

6 months
10 (#382,354)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

A. Tony De Luca
University of Manitoba

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computability. An Introduction to Recursive Function Theory.H. B. Enderton - 1987 - Journal of Symbolic Logic 52 (1):292-293.

Add more references