A social choice hyperfunction picks a non-empty set of alternatives at each admissible preference profile over sets of alternatives. We analyze the manipulability of social choice hyperfunctions. We identify a domain D[lambda] of lexicographic orderings which exhibits an impossibility of the...

Suppose legislators represent districts of varying population, and their assembly's voting rule is intended to implement the principle of one person, one vote. How should legislators' voting weights appropriately reflect these population differences? An analysis requires an understanding of the...

Symmetric (3,2) simple games serve as models for anonymous voting systems in which each voter may vote "yes," abstain, or vote "no," the outcome is "yes" or "no," and all voters play interchangeable roles. The extension to symmetric (j,2) simple games, in which each voter chooses from among j...