The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...

This paper experimentally analyzes the effects if signatories to an international environmental agreement (IEA) apply different voting schemes to determine the terms of the agreement. To this end, unanimity, qualified majority voting, and simple majority voting are compared with respect to the...

We investigate whether the simple plurality rule aggregates information efficiently in a large election with three alternatives. The environment is the same as in the Condorcet Jury Theorem (Condorcet (1785)). Voters have common preferences that depend on the unknown state of nature, and they...

This paper experimentally analyzes the effects if signatories to an international environmental agreement (IEA) apply different voting schemes to determine the terms of the agreement. To this end, unanimity, qualified majority voting, and simple majority voting are compared with respect to the...

In this paper, we study the potential implications of a novel yet natural voting system: strategic sequential voting. Each voter has one vote and can choose when to cast his vote. After each voting period, the current count of votes is publicized enabling subsequent voters to use this...

It is proved that, among all restricted preference domains that guarantee consistency (i.e. transitivity) of pairwise majority voting, the single-peaked domain is the only minimally rich and connected domain that contains two completely reversed strict preference orders. It is argued that this...

Following Barbera, Sonnenschein, and Zhou (1991, Econometrica 59, 595-609), we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable...

We extend approval voting so as to elect multiple candidates, who may be either individuals or members of a political party, in rough proportion to their approval in the electorate. We analyze two divisor methods of apportionment, first proposed by Jefferson and Webster, that iteratively...

Approval voting allows voters to support as many candidates as they wish. One advantage of the method is that voters have weak or no incentives to vote insincerely. However, the exact meaning of this statement depends on how the voters' preferences over candidates are extended to sets. We show...

This paper considers the problem of allocating an amount of a perfectly divisible resource among agents. We are interested in rules eliminating the possibility that an agent can compensate another to misrepresent her preferences, making both agents strictly better off. Such rules are said to be...