A Characterization of Single-Peaked Preferences via Random Social Choice Functions
The paper proves the following result: every path-connected domain of preferences that admits a strategy-proof, unanimous, tops-only random social choice function satisfying a compromise property, is single-peaked. Conversely, every single-peaked domain admits a random social choice function satisfy...
Saved in:
Main Authors: | CHATTERJI, Shurojit, SEN, Arunava, ZENG, Huaxia |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/soe_research/1597 https://ink.library.smu.edu.sg/context/soe_research/article/2596/viewcontent/13_2014.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A characterization of single‐peaked preferences via random social choice functions
by: CHATTERJI, Shurojit, et al.
Published: (2016) -
Random Dictatorship Domains
by: CHATTERJI, Shurojit, et al.
Published: (2012) -
Random dictatorship domains
by: CHATTERJI, Shurojit, et al.
Published: (2014) -
The Structure of Strategy-Proof Random Social Choice Functions over Product Domains and Lexicographically Separable Preferences
by: CHATTERJI, Shurojit, et al.
Published: (2012) -
Three essays on random mechanism design
by: ZENG, Huaxia
Published: (2016)