In an abstract model of division problems, we study division rules that are not manipulable through a reallocation of individual characteristic vectors within a coalition (e.g. reallocation of claims in bankruptcy problems). A coalition can be formed if members of the coalition are connected on...

How should scholarships be distributed among the (public) higher education students? We raise thissituation as a redistribution problem. Following the approach developed in Fleurbaey (1994) andBossert (1995), redistribution should be based on the notion of solidarity and it re-allocates...

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

We propose a new type of cooperative game - a game in transition function (TF) form - as a means of representing social decision making procedures that is suitable for the analysis of rights. The TF form is a generalisation of the effectivity function (EF) form, and in particular it tells us...

It is well known that, in distributions problems, "Fairness" rarely leads to a single viewpoint (see Young (1994) and Moulin (1988) among many others). This paper provides, in this context, interesting basis in defense of intermediate agreements when two prominent proposals, representing...

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. In this context, fairness is incompatible with...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rankenhancements of partners. One property requires that an agent who becomes...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rankenhancements of partners. One property requires that an agent who becomes...

A group of players in a cooperative game are partners (e.g., as in the form of a union or a joint ownership) if the prospects for cooperation are restricted such that cooperation with players outside the partnership requires the accept of all the partners. The formation of such partnerships...

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