Achieving the First Best in Sequencing Problems

Manipushpak Mitra

No 11/2001, Bonn Econ Discussion Papers from University of Bonn, Bonn Graduate School of Economics (BGSE)

Abstract: 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.

Keywords: Sequencing problems; Dominant strategy incentive compatibility; Efficiency; Budget balancedness (search for similar items in EconPapers)
JEL-codes: C72 C78 D82 (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.econstor.eu/bitstream/10419/78375/1/bgse11_2001.pdf (application/pdf)

Related works:
Journal Article: Achieving the first best in sequencing problems (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:zbw:bonedp:112001

Access Statistics for this paper

More papers in Bonn Econ Discussion Papers from University of Bonn, Bonn Graduate School of Economics (BGSE) Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().