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

The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity. We describe the logical relationship between the different notions...

We reconsider the following cost-sharing problem: agent i = 1, ...,n demands a quantity xi of good i; the corresponding total cost C(x1, ..., xn) must be shared among the n agents. The Aumann-Shapley prices (p1, ..., pn) are given by the Shapley value of the game where each unit of each good is...

We consider a game of abatement of a transboundary pollutant. We use a time-consistent Shapley value allocation of the cost of pollution reduction, and study the sensitivity of such an allocation to countries' adaptation to pollution. A country's adaptation to pollution is captured by a change...

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