We consider one-to-one matching markets in which agents can either be matched as pairs or remain single. In these so-called roommate markets agents are consumers and resources at the same time. Klaus (Games Econ Behav 72:172–186, <CitationRef CitationID="CR8">2011</CitationRef>) introduced two new “population sensitivity” properties...</citationref>

In this paper we characterize strategy-proof voting schemes on Euclidean spaces. A voting scheme is strategy-proof whenever it is optimal for every agent to report his best alternative. Here the individual preferences underlying these best choices are separable and quadratic. It turns out that a...

We consider collective choice problems where a group of agents has to decide on the location of a public facility in a Euclidean space. A well-known solution for such problems is the coordinatewise median of the reported votes and additional fixed ballots. Instead of adding ballots, we extend...

We consider the problem of (re)allocating the total endowment of an infinitely divisible commodity among agents with single-peaked preferences and individual endowments. We propose an extension of the so-called uniform rule and show that it is the unique rule satisfying Pareto optimality,...