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

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

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

We impose the axiom Independence of Irrelevant Alternatives on division rules for the conflicting claims problem. With the addition of Consistency and Resource Monotonicity, this characterizes a family of rules which can be described in three different but intuitive ways. First, a rule is...

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

We consider implementation of a deterministic allocation rule using transfers in quasi-linear private values environments. We show that in multidimensional single peaked type spaces, an allocation rule is implementable if and only if it satisfies a familiar and simple condition called 2-cycle...

Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

We analyze the preference aggregation problem without the assumption that individuals and society have fully determined and observable preferences. More precisely, we endow individuals and society with sets of possible von Neumann–Morgenstern utility functions over lotteries. We generalize the...

We provide an axiomatization of expected equally-distributed equivalent-utility social welfare functions in the context of Harsanyiʼs impartial observer theorem. For this family of social welfare functions, we show what additional axiom is necessary and sufficient for the observer to exhibit...