Showing 1 - 10 of 28
The division problem consists of allocating an amount M of a perfectly divisible good among a group of n agents. Sprumont (1991) showed that if agents have single-peaked preferences over their shares, the uniform rule is the unique strategy-proof, efficient, and anonymous rule. Ching and...
Persistent link: https://www.econbiz.de/10005247850
This paper is devoted to the analysis of all constitutions equipped with electoral systems involving two step procedures. First, one candidate is elected in every jurisdiction by the electors in that jurisdiction, according to some aggregation procedure. Second, another aggregation procedure...
Persistent link: https://www.econbiz.de/10005247853
We present a new domain of preferences under which the majority relation is always quasi-transitive and thus Condorcet winners always exist. We model situations where a set of individuals must choose one individual in the group. Agents are connected through some relationship that can be...
Persistent link: https://www.econbiz.de/10005247861
We identify in this paper two conditions that characterize the domain of single-peaked preferences on the line in the following sense: a preference profile satisfies these two properties if and only if there exists a linear order $L$ over the set of alternatives such that these preferences are...
Persistent link: https://www.econbiz.de/10005247862
For the many-to-one matching model in which firms have substitutable and quota q-separable preferences over subsets of workers we show that the workers-optimal stable mechanism is group strategy-proof for the workers. In order to prove this result, we also show that under this domain of...
Persistent link: https://www.econbiz.de/10005247863
A social choice function may or may not satisfy a desirable property depending on its domain of definition. For the same reason, different conditions may be equivalent for functions defined on some domains, while different in other cases. Understanding the role of domains is therefore a crucial...
Persistent link: https://www.econbiz.de/10009399120
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...
Persistent link: https://www.econbiz.de/10008592873
We define different concepts of group strategy-proofness for social choice functions. We discuss the connections between the defined concepts under different assumptions on their domains of definition. We characterize the social choice functions that satisfy each one of them and whose ranges...
Persistent link: https://www.econbiz.de/10008693511
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...
Persistent link: https://www.econbiz.de/10010836463
We study how to partition a set of agents in a stable way when each coalition in the partition has to share a unit of a perfectly divisible good, and each agent has symmetric single-peaked preferences on the unit interval of his potential shares. A rule on the set of preference profiles consists...
Persistent link: https://www.econbiz.de/10010836465