The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
From MaRDI portal
Publication:690970
DOI10.1016/J.JMATECO.2012.08.001zbMATH Open1263.91013OpenAlexW2130212269MaRDI QIDQ690970FDOQ690970
Authors: Shurojit Chatterji, Souvik Roy, Arunava Sen 
Publication date: 29 November 2012
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmateco.2012.08.001
Recommendations
- Separable Preferences, Strategyproofness, and Decomposability
- Random mechanism design on multidimensional domains
- On random social choice functions with the tops-only property
- The decomposition of strategy-proof random social choice functions on dichotomous domains
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case
Cites Work
- Collective choice under dichotomous preferences
- Generalized median voter schemes and committees
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Mechanism Design by an Informed Principal
- Manipulation of Voting Schemes: A General Result
- Fair Queuing and Other Probabilistic Allocation Methods
- A new solution to the random assignment problem.
- Voting by Committees
- Random Matching Under Dichotomous Preferences
- Manipulation of Schemes that Mix Voting with Chance
- Strategy-proof allocation of multiple public goods
- Voting by committees under constraints
- Separable Preferences, Strategyproofness, and Decomposability
- Preference aggregation with randomized social orderings
- Voting under constraints
Cited In (14)
- Formation of Committees Through Random Voting Rules
- Decomposing random mechanisms
- Random dictatorship domains
- On random social choice functions with the tops-only property
- Probabilistic strategy-proof rules over single-peaked domains
- Recent Results on Strategy-Proofness of Random Social Choice Functions
- Random mechanism design on multidimensional domains
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
- Impossibilities for strategy-proof committee selection mechanisms with vetoers
- The decomposition of strategy-proof random social choice functions on dichotomous domains
- Separable Preferences, Strategyproofness, and Decomposability
- Continuity and incentive compatibility in cardinal mechanisms
- Stochastic same-sidedness in the random voting model
- An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains
This page was built for publication: The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690970)
