The Library
Optimal procurement mechanisms : bidding on price and damages for breach
Tools
Chillemi, Ottorino and Mezzetti, Claudio (2014) Optimal procurement mechanisms : bidding on price and damages for breach. Economic Theory, 55 (2). pp. 335-355. doi:10.1007/s00199-013-0751-5 ISSN 0938-2259.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1007/s00199-013-0751-5
Abstract
We study the optimal procurement mechanism when contract breach and abandoning a project may be efficient, either because of completion costs higher than anticipated or because of new and more lucrative opportunities for the contractor. When contractors have private information about their costs, the procurer finds it optimal to set damages above expectation damages. There is a lock-in effect, or status quo bias; the agent that has won the award will complete the project even in situations when it would be efficient to abandon it. If the cost types of all agents are above a threshold, the optimal bidding procedure assigns the project by lottery. The optimal mechanism cannot be implemented by standard auction formats. However, the larger the number of agents bidding for the project, the closer auctions with a liquidated damage clause approximate the optimal mechanism.
Item Type: | Journal Article | ||||||
---|---|---|---|---|---|---|---|
Divisions: | Faculty of Social Sciences > Economics | ||||||
Journal or Publication Title: | Economic Theory | ||||||
Publisher: | Springer | ||||||
ISSN: | 0938-2259 | ||||||
Official Date: | February 2014 | ||||||
Dates: |
|
||||||
Volume: | 55 | ||||||
Number: | 2 | ||||||
Page Range: | pp. 335-355 | ||||||
DOI: | 10.1007/s00199-013-0751-5 | ||||||
Status: | Peer Reviewed | ||||||
Publication Status: | Published | ||||||
Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |