Sequential Screening and Renegotiation
AbstractThis paper considers a sequential screening problem. A seller sells an object to a buyer who is privately informed about the object's value. The value has two components. The buyer knows the first component when he contracts with the seller and learns the second component only later. The optimal contract when there is no commitment problem is a sequential mechanism in form of a menu of fee-price pairs. Paying the initial fee gives the buyer the right to purchase the good later at the corresponding price. High initial buyer types pay a high fee for a low price later. Each buyer chooses a different fee-price pair. If commitment is not feasible, the structure of the optimal contract is simpler. The optimal contract is either no contract, a simple forcing contract, or a contract in which high types buy for sure and low types pay an initial fee to buy the good at a price later. The di¤erence to the setting with commitment is that all low buyer types obtain the same fee-price pair and all high buyer types buy for sure. There is no fine-tuning to specific buyer types. This might explain some simple real life sales agreements and why firms might find it optimal to group consumers into specific customer groups.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Faculty of Economics, University of Cambridge in its series Cambridge Working Papers in Economics with number 0820.
Date of creation: Apr 2008
Date of revision:
Contact details of provider:
Web page: http://www.econ.cam.ac.uk/index.htm
This paper has been announced in the following NEP Reports:
- NEP-ALL-2008-06-21 (All new papers)
- NEP-CTA-2008-06-21 (Contract Theory & Applications)
- NEP-IND-2008-06-21 (Industrial Organization)
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.:
- Pascal Courty & Li Hao, 1997.
Economics Working Papers
224, Department of Economics and Business, Universitat Pompeu Fabra.
- Oliver D. Hart & Jean Tirole, 1987.
"Contract Renegotiation and Coasian Dynamics,"
442, Massachusetts Institute of Technology (MIT), Department of Economics.
- Daniel Kr�mer & Roland Strausz, 2009.
"Optimal Procurement Contracts with Pre--Project Planning,"
036, Departmental Working Papers.
- Daniel Krähmer & Roland Strausz, 2011. "Optimal Procurement Contracts with Pre-Project Planning," Review of Economic Studies, Oxford University Press, vol. 78(3), pages 1015-1041.
- Andreas Blume, 1998. "Contract Renegotiation with Time-Varying Valuations," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 7(3), pages 397-433, 09.
- Baron, David P. & Besanko, David, 1984. "Regulation and information in a continuing relationship," Information Economics and Policy, Elsevier, vol. 1(3), pages 267-302.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Howard Cobb).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.