Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/78375
Authors: 
Mitra, Manipushpak
Year of Publication: 
2000
Series/Report no.: 
Bonn Econ Discussion Papers 11/2001
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.
Subjects: 
Sequencing problems
Dominant strategy incentive compatibility
Efficiency
Budget balancedness
JEL: 
C72
C78
D82
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.