We generalize the traditional concept of single-peaked preference domains in two ways. First, we introduce the concept of a multiple single-peaked domain, where the set of alternatives is equipped with several underlying orderings with respect to which a preference can be single-peaked, and we...

We study a social choice model with partially honest agents, and we show that strategy-proofness is a necessary and sufficient condition to achieve secure implementation. This result provides a behavioral foundation for the rectangularity property; and it offers as a by-product a revelation...

I consider whether the agentsʼ reluctance to make a large lie is helpful for the rule designer to construct a nonmanipulable rule. For this purpose, I study an axiom, called AM-proofness, saying that manipulation cannot occur through preferences adjacent to the sincere one. Through examples, I...

In this paper, we investigate domains that 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,...

We show that in pure exchange economies there exists no Pareto-efficient and strategy-proof allocation mechanism that ensures positive consumption for all agents. We also show that a Pareto-efficient, strategy-proof, and non-bossy allocation mechanism is dictatorial. We further show that in...

We study allocation rules that are robust to coalitional manipulation by transferring, merging, or splitting individual characteristics among coalition partners (e.g. merging or splitting claims in bankruptcy problems). Coalition formation is restricted by an exogenous network (a non-directed...

We study problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...

In the present paper we consider the allocation of costs in connection networks. Agents have connection demands in form of pairs of locations they want to have connected. Connections between locations are costly to build. The problem is to allocate costs of networks satisfying all connection...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

We study efficiency and fairness properties of the equal cost sharing with maximal participation (ECSMP) mechanism in the provision of a binary and excludable public good. According to the maximal welfare loss criterion, the ECSMP is optimal within the class of strategyproof, individually...