Graduate School of Economics and Management, Tohoku University

We study the problem of allocating a single indivisible good to at most one of n agents when the preferences of agents’ are quasilinear, monetary transfers are allowed and strategy-proof mechanism is needed. In this paper, we consider the possibility of constructing feasible allocation mechanisms which satisfy strategy-proofness, anonymity, budget balance and no wastage. In two and three agents cases, we show an impossibility result.