Small Binary Voting Trees.pdf.pdf' (118.89 kB)

Small Binary Voting Trees

Download (118.89 kB)
journal contribution
posted on 01.07.2009 by Michael Trick
Sophisticated voting on a binary tree is a common form of voting structure, as exemplified by, for example, amendment procedures. The problem of characterizing voting rules that can be the outcome of this procedure has been a longstanding problem in social choice. We explore rules over a small number of candidates, and discuss existence and nonexistence properties of rules implementable over trees.

History

Publisher Statement

All Rights Reserved

Date

01/07/2009

Exports

Exports