This paper takes voting theory out of the realm of mechanism design and studies elections as tools for representing preferences: every preference relation on a set of n elements is the outcome of pairwise voting by approximately 2 log2n voters with transitive preferences. Results like this one...

In a two-market Bertrand duopoly,each of two firms chooses one of two markets and a price in that market. All four choices are made simultaneously. In a two-market Cournot duopoly, the firms choose quantities rather than prices.It is well known that in the one-market case the threat of price...

Under what conditions are lexicographically representable preferences continuously representable? This question is actually two questions, since there are two natural definitions of continuity for lexicographic representations. A complete answer is given for one of these questions, and the other...

A characterization of a property of binary relations is of finite type if it is stated in terms of ordered T-tuples of alternatives for some positive integer T. A characterization of finite type can be used to determine in polynomial time whether a binary relation over a finite set has the...

Variations of the Gale-Shapley algorithm have been used and studied extensively in real world markets. Examples include matching medical residents with residency programs, the kidney exchange program and matching college students with on-campus housing. The performance of the Gale-Shapley...

A single-issue spatial election is a voter preference profile derived from an arrangement of candidates and voters on a line, with each voter preferring the nearer of each pair of candidates. We provide a polynomial-time algorithm that determines whether a given preference profile is a...