Achieving the first best in sequencing problems |
| |
Authors: | Manipushpak Mitra |
| |
Affiliation: | (1) Department of Economics, University of Bonn, Adenauerallee 24–26, 53113 Bonn, Germany (e-mail: m.mitra@wiwi.uni-bonn.de) , DE |
| |
Abstract: | 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. Received: 2 December 1999/Accepted: 9 May 2001 |
| |
Keywords: | JEL classification:C72 C78 D82 |
本文献已被 SpringerLink 等数据库收录! |
|