Achieving the First Best in Sequencing Problems
In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that among a more general and natural class of sequencing problems, sequencing problems with linear cost is the only class for which first best can be achieved.
|Date of creation:||Nov 2000|
|Contact details of provider:|| Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany|
Fax: +49 228 73 6884
Web page: http://www.bgse.uni-bonn.de
When requesting a correction, please mention this item's handle: RePEc:bon:bonedp:bgse11_2001. See general 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: (BGSE Office)
If references are entirely missing, you can add them using this form.