On random social choice functions with the tops-only property
From MaRDI portal
Publication:1753301
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
Cites work
- scientific article; zbMATH DE number 5556709 (Why is no real title available?)
- A characterization of strategy-proof social choice functions for economies with pure public goods
- A geometric proof of Gibbard's random dictatorship theorem
- A new informational base for social choice
- A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case
- Comparing generalized median voter schemes according to their manipulability
- Consistent probabilistic social choice
- Decomposing random mechanisms
- Dictatorial domains
- Domains, ranges and strategy-proofness: the case of single-dipped preferences
- Generalized median voter schemes and committees
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness
- Impossibility of Strategy-Proof Mechanisms in Economies with Pure Public Goods
- Incentive properties for ordinal mechanisms
- Majority and Positional Voting in a Probabilistic Framework
- Manipulation of Schemes that Mix Voting with Chance
- Manipulation of Voting Schemes: A General Result
- Probabilistic strategy-proof rules over single-peaked domains
- Random dictatorship domains
- Separable Preferences, Strategyproofness, and Decomposability
- Single-peaked orders on a tree
- Straightforward Elections, Unanimity and Phantom Voters
- Strategy-proof allotment rules
- Strategy-proof cardinal decision schemes
- Strategy-proof partitioning
- Strategy-proof probabilistic decision schemes for one-dimensional single-peaked preferences
- Strategy-proof probabilistic mechanisms in economies with pure public goods.
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains
- Strategy-proof voting schemes with continuous preferences
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Strategy-proofness and ``median voters
- The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
- The computational difficulty of manipulating an election
- The structure of strategy-proof random social choice functions over product domains and lexicographically separable preferences
- The structure of strategy-proof social choice. I: General characterization and possibility results on median spaces
- Tops-only domains
- Voting by Committees
- Voting by committees under constraints
- Voting under constraints
- When are local incentive constraints sufficient?
Cited in
(21)- The structure of (local) ordinal Bayesian incentive compatible random rules
- Strategy-proofness of the randomized Condorcet voting system
- On strategy-proofness and semilattice single-peakedness
- An extreme point characterization of random strategy-proof social choice functions: the two alternative case
- Uniform random dictatorship: a characterization without strategy-proofness
- 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
- The decomposition of strategy-proof random social choice functions on dichotomous domains
- Probabilistic fixed ballot rules and hybrid domains
- Local global equivalence for unanimous social choice functions
- Stochastic same-sidedness in the random voting model
- Random mechanism design on multidimensional domains
- On mechanisms eliciting ordinal preferences
- Formation of committees through random voting rules
- On single-peaked domains and min-max rules
- Tops-only domains
- Recent Results on Strategy-Proofness of Random Social Choice Functions
- Unanimous and strategy-proof probabilistic rules for single-peaked preference profiles on graphs
- A characterization of random min-max domains and its applications
- 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)
