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

An agent is said to be partially honest if he or she weakly prefers an outcome at a strategy profile with his truthful strategy than an outcome at a strategy profile with his false strategy, then this player must prefer strictly the \true" strategy profille to the \false" strategy profile. In...

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

In this paper we introduce a new concept of solidarity in terms of reciprocity and characterize the set of social choice functions that are reciprocate (in both a strong and a weak sense), anonymous and efficient in a standard public good provision model when the agents have single-peaked...

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

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

This article establishes versions of Moulin's [On strategy-proofness and single peakedness, Public Choice 35 (1980), 31--38] characterizations of various classes of strategy-proof social choice functions when the domain consists of all profiles of single-peaked preferences on an arbitrary subset...