Achieving the first best in sequencing problems
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.
Volume (Year): 7 (2002)
Issue (Month): 1 ()
|Note:||Received: 2 December 1999/Accepted: 9 May 2001|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/10058/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:reecde:v:7:y:2002:i:1:p:75-91. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.