Publication Type
Working Paper
Version
publishedVersion
Publication Date
3-2017
Abstract
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.
Keywords
ordinal mechanisms, block-adjacency, block-connected domains, local sd-strategy-proofness, sd-strategy-proofness
Discipline
Behavioral Economics | Growth and Development
Research Areas
Economic Theory
First Page
1
Last Page
16
Citation
LIU, Peng.
Local and global SD-strategy-proofness of ordinal mechanisms on block-connected domains. (2017). 1-16.
Available at: https://ink.library.smu.edu.sg/soe_research/2219
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.