Achieving the first best in sequencing problems

Manipushpak Mitra

Review of Economic Design, 2002, vol. 7, issue 1, 75-91

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: 2002-09-05
Note: Received: 2 December 1999/Accepted: 9 May 2001
References: Add references at CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://link.springer.de/link/service/journals/10058/papers/2007001/20070075.pdf (application/pdf)
Access to the full text of the articles in this series is restricted

Related works:
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:spr:reecde:v:7:y:2002:i:1:p:75-91

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10058

Access Statistics for this article

Review of Economic Design is currently edited by Atila Abdulkadiroglu, Fuhito Kojima and Tilman Börgers

More articles in Review of Economic Design from Springer, Society for Economic Design
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().