Open Access. Powered by Scholars. Published by Universities.®
Social and Behavioral Sciences Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Social and Behavioral Sciences
Local And Global Sd-Strategy-Proofness Of Ordinal Mechanisms On Block-Connected Domains, Peng Liu
Local And Global Sd-Strategy-Proofness Of Ordinal Mechanisms On Block-Connected Domains, Peng Liu
Research Collection School Of Economics
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 …
How To Describe Objects?, Liu Peng
How To Describe Objects?, Liu Peng
Research Collection School Of Economics
This paper addresses the problem of randomly allocating n indivisible objects to n agents where each object can be evaluated according to a set of characteristics. The planner chooses a subset of characteristics and a ranking of them. Then she describes each object as a list of values according to the ranking of those chosen characteristics. Being informed of such a description, each agent figures out her preference that is lexicographically separable according to the characteristics chosen and ranked by the planner. Hence a description of the objects induces a collection of admissible preferences. We call a description good if …
Strategy-Proofness Of The Probabilistic Serial Rule On Sequentially Dichotomous Domains, Peng Liu
Strategy-Proofness Of The Probabilistic Serial Rule On Sequentially Dichotomous Domains, Peng Liu
Research Collection School Of Economics
A class of preference domains is proposed: sequentially dichotomous domains. On any sequentially dichotomous domain, the probabilistic serial rule (Bogomolnaia and Moulin (2001)) is sd-strategy-proof. In addition, any sequentially dichotomous domain is maximal for the probabilistic serial rule to be sd-strategy-proof.