Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...

The assessment of income inequality can be investigated looking at the solution concepts of the cooperative game theory. We propose a multi-factorial decomposition of the Atkinson index by income sources and evaluate it as a cooperative game of the social cost of inequality. This framework...

Sprumont (1991) has established that the only allocation rule for the division problem that is strategy-proof, efficient, and anonymous is the uniform rule when the domain is the set of all possible profiles of continuous single-peaked preferences. Sprumont's characterization of the uniform rule...

The division problem consists of allocating a given amount of an homogeneous and perfectly divisible good among a group of agents with single-peaked preferences on the set of their potential shares. A rule proposes a vector of shares for each division problem. The literature has implicitly...

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single- peaked preferences on an exogenously given interval of feasible allotments. We char- acterize axiomatically the family of extended...

In this paper, we reexamine Eliaz's results (2002) of fault tolerant implementation on one hand and we extend theorems 1 and 2 of Doghmi and Ziad (2008a) to bounded rationality environments, on the other. We identify weak versions of the k-no veto power condition, in conjunction with unanimity...

Thomson (1995a) proved that the uniform allocation rule is the only allocation rule for allocation economies with single-peaked preferences that satisfies Pareto efficiency, no-envy,one-sided population-monotonicity, and replication-invariance on a restricted domain of single-peaked preferences....

A social choice function is group strategy-proof on a domain if no group of agents can manipulate its final outcome to their own benefit by declaring false preferences on that domain. Group strategy-proofness is a very attractive requirement of incentive compatibility. But in many cases it is...

I consider whether the agentsʼ reluctance to make a large lie is helpful for the rule designer to construct a nonmanipulable rule. For this purpose, I study an axiom, called AM-proofness, saying that manipulation cannot occur through preferences adjacent to the sincere one. Through examples, I...