A group of agents has to decide whether to accept or reject a proposal. Agents vote in favor or against the proposal and, if the number of agents in favor is greater to certain quota, the proposal is accepted. The \textit{socially optimal decision} is the one adopted when all agents vote...

We study a problem where a group of voters must decide which candidates are elected from a set of alternatives. The voters’ preferences on the combinations of elected candidates are represented by orderings. We propose a family of restrictions of the domain of separable preferences. These...

We concentrate on the problem of the provision of one pure public good whenever agents that form the society have either single-plateaued preferences or single-peaked preferences over the set of alternatives. We are interested in comparing the relationships between different nonmanipulability...

A high court has to decide whether a law is constitutional, un- constitutional, or interpretable. The voting system is runoff. Runoff voting systems can be interpreted both, as social choice functions or as mechanisms. It is known that, for universal domains of preferences, runoff voting systems...

We observe that many salient rules to allocate private goods are not only (partially) strategy-proof, but also (partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost sharing, house allocation and auctions, in spite of the...

We characterize the set of all individual and group strategy-proof rules on the domain of all single-dipped preferences on a line. For rules defined on this domain, and on several of its subdomains, we explore the implications of these strategy-proofness requirements on the maximum size of the...

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

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 the mand whose ranges...

When the members of a voting body exhibit single peaked preferences, majority winners exist. Moreover, the median(s) of the preferred alternatives of voters is (are) indeed the majority (Condorcet) winner(s). This important result of Duncan Black has been crucial in the development of public...

We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...