Date of Original Version

12-7-2006

Type

Conference Proceeding

Abstract or Description

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.

Share

COinS
 

Published In

Proceedings of 1st International Workshop on Computational Social Choice Amsterdam.