This paper explores the link between boundedly rational behaviour and incomplete contracts. The bounded rationality of the agents in our world is embodied in a constraint that the contracts they write must be algorithmic in nature. We start with a definition of contract incompleteness that seems both appealing and widely applicable. Our first task is then to show that, by itself, the algorithmic nature of contracts is not enough to generate genuinely incomplete contracts in equilibrium. As in Anderlini and Felli (1994), we call this the Approximation Result. We then consider contractual situations in which the complexity costs of a contract are explicitly taken into accoaunt. We consider a broad (axiomatically defined) class of complexity measures and in this framework we show that incomplete contracts obtain in equilibrium. We also extensively discuss some recent literature directly related to the results reported here
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Suntory and Toyota International Centres for Economics and Related Disciplines, LSE in its series STICERD - Theoretical Economics Paper Series with number
407.
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)