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...

This paper proves stronger versions of the Gibbard random dictatorship theorem using induction on the number of voters. It shows that when there are at least three voters, every random social choice function defined on a domain satisfying a Free Triple at the Top property and satisfying a weak...