Local and global SD-strategy-proofness of ordinal mechanisms on block-connected domains
The adjacency by Monjardet (2009) is weakened to a flip between two adjacently ranked blocks and called block-adjacency. The connectedness defined accordingly, blockconnectedness, covers some interesting unconnected domains. An ordinal mechanism on a block-connected domain is block-adjacent sd-strat...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2017
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/soe_research/2219 https://ink.library.smu.edu.sg/context/soe_research/article/3218/viewcontent/Equivalence_Local_Global_sd_SP.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | The adjacency by Monjardet (2009) is weakened to a flip between two adjacently ranked blocks and called block-adjacency. The connectedness defined accordingly, blockconnectedness, covers some interesting unconnected domains. An ordinal mechanism on a block-connected domain is block-adjacent sd-strategy-proof if reporting the true preference always leads to a lottery that stochastically dominates the lottery delivered by reporting any preference block-adjacent to the sincere one.A condition on a block-connected domain called path-nestedness is proposed and shown sufficient for the equivalence between sd-strategy-proofness and block-adjacent sd-strategy-proofness. The sequentially dichotomous domain by Liu (2017) is an application. In addition, we systematically search for the path-nested domains and found a particular class of unions of sequentially dichotomous domains called braided unions. |
|---|