This article establishes versions of Moulin's (Public Choice 35:437-455, 1980) characterizations of various classes of strategy-proof social choice functions when the domain consists of all profiles of single-peaked preferences on an arbitrary subset of the real line. Two results are established...

In a moneyless market, a non storable, non transferable homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary...

We consider the problem of fairly reallocating the individual endowments of a perfectly divisible good among agents with single-peaked preferences. We provide a new concept of fairness, called position-wise envy-freeness, that is compatible with individual rationality. This new concept requires...

The division problem consists of allocating a given amount of an homogeneous and perfectly divisible good among a group of agents with singlepeaked preferences on the set of their potential shares. A rule proposes a vector of shares for each division problem. Most of the literature has...

We study dominant strategy implementation especially in economic environments. We first showthat in general environments, strategy-proofness and quasi-strong-non-bossiness together are necessary and sufficient for dominant strategy implementation via the associated direct revelationmechanism. We...

Die vorliegende Arbeit untersucht die Aufteilung eines Budgets auf mehrere öffentliche Güter mittels einer Abstimmung. Hierzu betrachten wir Abstimmungsregeln, unter denen jeder Agent eine Budgetaufteilung vorschlägt und dann aus diesen Vorschlägen eine Budgetaufteilung (Allokation) bestimmt...

This paper studies the strategic foundations of the Representative Voter Theorem (Rothstein, 1991), also called the second version of the Median Voter Theorem. As a by-product, it also considers the existence of non-trivial strategy-proof social choice functions over the domain of...

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one-to-one matching model. We pursue the possibility of strategy-proof...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...