Recent Results on Strategy-Proofness of Random Social Choice Functions

DOI10.1007/978-981-16-4737-6_4zbMath1481.91075OpenAlexW4205626467MaRDI QIDQ5022149

Souvik Roy, Arunava Sen, Soumyarup Sadhukhan

Publication date: 18 January 2022

Published in: Indian Statistical Institute Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-16-4737-6_4

zbMATH Keywords

strategy-proofnesssocial choice functionallocation problem

Mathematics Subject Classification ID

Voting theory (91B12) Social choice (91B14)

Cites Work

• Unnamed Item
• Convex strategyproofness with an application to the probabilistic serial mechanism
• An extreme point characterization of random strategy-proof social choice functions: the two alternative case
• Securely implementable social choice rules with partially honest agents
• An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains
• Tops-only domains
• Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences
• Circular domains
• Strategy-proof cardinal decision schemes
• Further results on dictatorial domains
• Decomposing random mechanisms
• Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
• Existence of equilibria in economies with a local public good
• Intermediate preferences and stable coalition structures
• Generalized median voter schemes and committees
• Dictatorial domains
• On the tradeoff between efficiency and strategyproofness
• The decomposition of strategy-proof random social choice functions on dichotomous domains
• On random social choice functions with the tops-only property
• Strategy-proof probabilistic mechanisms in economies with pure public goods.
• A geometric proof of Gibbard's random dictatorship theorem
• Random dictatorship domains
• Continuity and incentive compatibility in cardinal mechanisms
• A unified characterization of the randomized strategy-proof rules
• A characterization of random min-max domains and its applications
• Probabilistic strategy-proof rules over single-peaked domains
• Collective choice under dichotomous preferences
• Majority and Positional Voting in a Probabilistic Framework
• Aggregation Procedure for Cardinal Preferences: A Comment
• Manipulation of Voting Schemes: A General Result
• Manipulation of Schemes that Mix Voting with Chance
• Equilibrium and Local Redistribution in an Urban Economy when Households Differ in both Preferences and Incomes
• Interjurisdictional Sorting and Majority Rule: An Empirical Analysis
• Straightforward Elections, Unanimity and Phantom Voters
• Unanimous and Strategy-Proof Probabilistic Rules for Single-Peaked Preference Profiles on Graphs
• Algorithmic Game Theory
• A new solution to the random assignment problem.

This page was built for publication: Recent Results on Strategy-Proofness of Random Social Choice Functions