Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Economics

2020

Strategy-proofness

Articles 1 - 3 of 3

Full-Text Articles in Social and Behavioral Sciences

On Strategy-Proofness And The Salience Of Single-Peakedness In A Private Goods Economy, Shurojit Chatterji, Masso Jordi, Serizawa Shigehiro Dec 2020

On Strategy-Proofness And The Salience Of Single-Peakedness In A Private Goods Economy, Shurojit Chatterji, Masso Jordi, Serizawa Shigehiro

Research Collection School Of Economics

We consider strategy-proof rules operating on a rich domain of preference profiles in a set up where multiple private goods have to be assigned to a set of agents with entitlements where preferences display satiation. We show that if the rule is in addition "desirable", in that it is tops-only, continuous, same-sided and individually rational with respect to the entitlements, then the preferences in the domain have to satisfy a variant of single-peakedness (referred to as smilattice single-peakedness). We also provide a converse of this main finding. It turns our that this domain coincides with the one already identified in …


A Taxonomy Of Non-Dictatorial Domains, Shurojit Chatterji, Huaxia Zeng Oct 2020

A Taxonomy Of Non-Dictatorial Domains, Shurojit Chatterji, Huaxia Zeng

Research Collection School Of Economics

We provide an exhaustive classification of all preference domains that allow the design of unanimous social choice functions (henceforth, rules) that are non-dictatorial and strategy-proof. This taxonomy is based on a richness assumption and employs a simple property of two-voter rules called invariance. The preference domains that form the classification are semi-single-peaked domains (introduced by Chatterji et al. (2013)) and semi-hybrid domains (introduced here) which are two appropriate weakenings of the single-peaked domains, and which, more importantly, are shown to allow strategy-proof rules to depend on non-peak information of voters’ preferences. As a refinement of the classification, single-peaked domains and …


Restricted Probabilistic Fixed Ballot Rules And Hybrid Domains, Shurojit Chatterji, Souvik Roy, Soumyarup Sadhukhan, Arunava Sen, Huaxia Zeng Jan 2020

Restricted Probabilistic Fixed Ballot Rules And Hybrid Domains, Shurojit Chatterji, Souvik Roy, Soumyarup Sadhukhan, Arunava Sen, Huaxia Zeng

Research Collection School Of Economics

We study Random Social Choice Functions (or RSCFs) in a standard ordinal mech-anism design model. We introduce a new preference domain called a hybrid domain which includes as special cases as the complete domain and the single-peaked domain. We characterize the class of unanimous and strategy-proof RSCFs on these domains and refer to them as Restricted Probabilistic Fixed Ballot Rules (or RPFBRs). These RSCFs are not necessarily decomposable, i.e., cannot be written as a convex combina-tion of their deterministic counterparts. We identify a necessary and sufficient condition under which decomposability holds for anonymous RPFBRs. Finally, we provide an axiomatic justification …