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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 2 December 1999/Accepted: 9 May 2001
Rights and permissions
About this article
Cite this article
Mitra, M. Achieving the first best in sequencing problems. Rev Econ Design 7, 75–91 (2002). https://doi.org/10.1007/s100580200071
Issue Date:
DOI: https://doi.org/10.1007/s100580200071