We consider the problem of choosing one point in a set of alternatives when monetary transfers are possible. In this context, Schummer (2000) shows that a social choice function must be a constant function if manipulation through bribes is ruled out. But he requires two kinds of domain-richness...

In the theory of judgment aggregation on connected propositions, an important question remains open: Which aggregation rules are manipulable and which are strategy-proof? We define manipulability and strategy- proofness in judgment aggregation, characterize all strategy-proof aggregation rules,...

The division problem consists of allocating an amount of a perfectly divisible good among a group of n agents with single-peaked preferences. A rule maps preference profiles into n shares of the amount to be allocated. A rule is bribe-proof if no group of agents can compensate another agent to...

In this paper, we consider a relationship between equity and efficiency in queueing problems. We show that under strategy-proofness, anonymity in welfare implies queue-efficiency. Furthermore, we also give a characterization of the equally distributed pairwise pivotal rule, as the only rule that...

In this paper, we consider dominant strategy implementation in classical pure exchange economies with free disposal. We show that quasi-strong-non-bossiness and strategy-proofness together are necessary and sufficient for dominant strategy implementation via the direct revelation mechanism....

We investigate the structure of fuzzy aggregation rules which, for every permissible profile of fuzzy individual preferences, specify a fuzzy social preference. We show that all fuzzy aggregation rules which are strategyproof and satisfy a minimal range condition are dictatorial. In other words,...

The Muller-Satterthwaite Theorem (Muller and Satterthwaite, 1977) establishes the equivalence between Maskin monotonicity and strategy-proofness, two cornerstone conditions for the decentralization of social choice rules. We consider a general model that covers public goods economies as in...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

In this paper, we investigate domains which admit "well-behaved", strategy-proof social choice functions. We show that if the number of voters is even, then every domain that satisfies a richness condition and admits an anonymous, tops-only, unanimous and strategy-proof social choice function,...

This paper analyzes collective choices in a society with strategic voters and single-crossing preferences. It shows that, in addition to single-peakedness, single-crossingness is another meaningful domain which guarantees the existence of non-manipulable social choice functions. A social choice...