Sequential Bargaining, Land Assembly, and the Holdout Problem
AbstractAlthough the holdout problem is a well-established part of legal and economic lore, the exact source of the problem is not well understood. The problem is usually attributed to high transaction costs or excessive bargaining power on the part of sellers once they recognize the scope of the project. In an effort to isolate the essential features of the problem, this paper considers the simplest possible setting in which a buyer bargains sequentially with a series of sellers, each of whose land is necessary to realize the gain from a large-scale project. Using ordinary Nash bargaining and assuming complete information, we identify a minimum set of factors that give rise to a holdout problem, which highlight the importance of commitment and the inefficiency of partial assembly.
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 University of Connecticut, Department of Economics in its series Working papers with number 2011-13.
Length: 20 pages
Date of creation: Jun 2011
Date of revision: Jan 2012
Contact details of provider:
Postal: University of Connecticut 341 Mansfield Road, Unit 1063 Storrs, CT 06269-1063
Phone: (860) 486-4889
Fax: (860) 486-4463
Web page: http://www.econ.uconn.edu/
More information through EDIRC
Bargaining; holdout problem; land assembly;
Find related papers by JEL classification:
- D40 - Microeconomics - - Market Structure and Pricing - - - General
- K11 - Law and Economics - - Basic Areas of Law - - - Property Law
- L14 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Transactional Relationships; Contracts and Reputation
- R14 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General Regional Economics - - - Land Use Patterns
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Kasey Kniffin).
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.