Single-plateaued preferences generalize single-peaked preferences by allowing for multiple best elements. These preferences have played an important role in areas such as voting, strategy-proofness and matching problems. We examine the notion of single-plateauedness in a choice-theoretic...

In a seminal contribution, Hansson (1976) demonstrates that the collection of decisive coalitions associated with an Arrovian social welfare function forms an ultrafilter. He goes on to show that if transitivity is weakened to quasi-transitivity as the coherence property imposed on a social...

A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent’s bundle. Under fairness, efficiency is equivalent to budget-balance...

We consider competitive and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In “small” economies, we identify under classical preferences each agent's maximal gain from manipulation. Using...

We provide a brief survey of some literature on intertemporal social choice theory in a multi-profile setting. As is well-known, Arrow’s impossibility result hinges on the assumption that the population is finite. For infinite populations, there exist nondictatorial social welfare functions...

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategyproof if misreporting one’s preference never produces a social ordering that is strictly between the original ordering...

This paper develops an extension of the recursive core to the setting of overlapping coalitions. We show that the cooperative game theoretical traditional way of separating a deviant coalition from the game played by the ones left behind is no more satisfactory. We therefore introduce a new...

Single-plateaued preferences generalize single-peaked preferences by allowing for multiple best elements. These preferences have played an important role in areas such as voting, strategy-proofness and matching problems. We examine the notion of singleplateauedness in a choice-theoretic setting....

We consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via...

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategyproof if misreporting one’s preference never produces a social ordering that is strictly between the original ordering...