On random social choice functions with the tops-only property
From MaRDI portal
Publication:1753301
DOI10.1016/J.GEB.2017.11.011zbMATH Open1390.91128OpenAlexW2187540458MaRDI QIDQ1753301FDOQ1753301
Authors: Shurojit Chatterji, Huaxia Zeng 
Publication date: 29 May 2018
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/soe_research/1777
Recommendations
- A unified characterization of the randomized strategy-proof rules
- The decomposition of strategy-proof random social choice functions on dichotomous domains
- A characterization of single-peaked preferences via random social choice functions
- Tops-only domains
- Random mechanism design on multidimensional domains
strategy-proofnessunanimityrandom social choice functionsexterior propertythe interior propertytops-only property
Cites Work
- Generalized median voter schemes and committees
- Single-peaked orders on a tree
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
- Domains, ranges and strategy-proofness: the case of single-dipped preferences
- When are local incentive constraints sufficient?
- Manipulation of Voting Schemes: A General Result
- Tops-only domains
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Strategy-proofness and ``median voters
- Voting by Committees
- The computational difficulty of manipulating an election
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- Comparing generalized median voter schemes according to their manipulability
- Strategy-proof allotment rules
- Majority and Positional Voting in a Probabilistic Framework
- Manipulation of Schemes that Mix Voting with Chance
- The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
- Strategy-proof cardinal decision schemes
- Strategy-proof voting schemes with continuous preferences
- Voting by committees under constraints
- Strategy-proof partitioning
- Separable Preferences, Strategyproofness, and Decomposability
- A characterization of strategy-proof social choice functions for economies with pure public goods
- Decomposing random mechanisms
- Dictatorial domains
- Title not available (Why is that?)
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case
- A new informational base for social choice
- Straightforward Elections, Unanimity and Phantom Voters
- Incentive properties for ordinal mechanisms
- Random dictatorship domains
- Probabilistic strategy-proof rules over single-peaked domains
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
- Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences
- Voting under constraints
- Impossibility of Strategy-Proof Mechanisms in Economies with Pure Public Goods
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness
- Strategy-proof probabilistic mechanisms in economies with pure public goods.
- A geometric proof of Gibbard's random dictatorship theorem
- Consistent probabilistic social choice
Cited In (20)
- A characterization of random min-max domains and its applications
- On the equivalence of strategy-proofness and upper contour strategy-proofness for randomized social choice functions
- A unified characterization of the randomized strategy-proof rules
- Tops-only domains
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case
- The structure of (local) ordinal Bayesian incentive compatible random rules
- On strategy-proofness and semilattice single-peakedness
- On single-peaked domains and min-max rules
- Probabilistic fixed ballot rules and hybrid domains
- Local global equivalence for unanimous social choice functions
- Recent Results on Strategy-Proofness of Random Social Choice Functions
- Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs
- Formation of committees through random voting rules
- Random mechanism design on multidimensional domains
- Uniform random dictatorship: a characterization without strategy-proofness
- The decomposition of strategy-proof random social choice functions on dichotomous domains
- Strategy-proofness of the randomized Condorcet voting system
- On mechanisms eliciting ordinal preferences
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
- Group strategy-proof probabilistic voting with single-peaked preferences
This page was built for publication: On random social choice functions with the tops-only property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753301)
