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.

MoreLess

Year of publication:	2000
Authors:	Mitra, Manipushpak
Publisher:	Bonn : University of Bonn, Bonn Graduate School of Economics (BGSE)
Subject:	Sequencing problems \| Dominant strategy incentive compatibility \| Efficiency \| Budget balancedness

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Bonn Econ Discussion Papers ; 11/2001
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	869248278 [GVK] hdl:10419/78375 [Handle] RePEc:zbw:bonedp:112001 [RePEc]
Classification:	C72 - Noncooperative Games ; C78 - Bargaining Theory; Matching Theory ; D82 - Asymmetric and Private Information
Source:	EconStor

Persistent link: https://www.econbiz.de/10010317633