Conditions α and β are two well-known rationality conditions in the theory of rational choice. This paper examines the implications of weaker versions of these two rationality conditions in the context of solutions to nonconvex bargaining problems. It is shown that, together with the standard...

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

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

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

We study allocation rules that are robust to coalitional manipulation by transferring, merging, or splitting individual characteristics among coalition partners (e.g. merging or splitting claims in bankruptcy problems). Coalition formation is restricted by an exogenous network (a non-directed...

By generalizing the standard solution for 2-person games into n-person cases, this paper develops a new solution concept for cooperative games: the consensus value.We characterize the consensus value as the unique function that satisfies efficiency, symmetry, the quasi dummy property and...

We consider an abstract model of division problems where each agent is identi- fied by a characteristic vector. Agents are situated on a network (a non-directed graph) and any connected coalition can reallocate members¡¯ characteristics (e.g. reallocation of claims in bankruptcy problems). A...

Consider a problem in which the cost of building an irrigation canal has to be divided among a set of people. Each person has different needs. When the needs of two or more people overlap, there is congestion. In problems without congestion, a unique canal serves all the people and it is enough...

The most important rule to determine payments in real-life bankruptcy problems is the proportional rule. Many bankruptcy problems are characterized by network aspects and default may occur as a result of contagion. Indeed, in financial networks with defaulting agents, the values of the agents'...