Sophisticated voting rules: the case of two tournaments
A voting rule maps voter preferences into outcomes, and is called sophisticated if there exists a voting tree whose sophisticated outcomes coincide with the voting rule for every voter preference. As yet, no complete characterization of such rules is available. In this paper, we provide an important step toward this characterization by completely solving the problem when there are two possible sets of voter preferences.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 13 (1996)
Issue (Month): 3 ()
|Note:||Received: 2 November 1993/Accepted: 18 April 1995|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:13:y:1996:i:3:p:275-289. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.