Strategy-proofness on restricted separable domains
From MaRDI portal
(Redirected from Publication:483577)
Recommendations
- Separable Preferences, Strategyproofness, and Decomposability
- Power of voters and domain of preferences where voting by committees is strategy-proof
- On domains that admit well-behaved strategy-proof social choice functions
- A characterization of strategy-proof voting rules for separable weak orderings
- A characterization of possibility domains in strategic voting
Cites work
- Fair waste pricing: an axiomatic analysis to the NIMBY problem
- Manipulation of Voting Schemes: A General Result
- On the Measurement of Polarization
- Straightforward Elections, Unanimity and Phantom Voters
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- Voting by Committees
- Voting for voters: A model of electoral evolution
Cited in
(11)- Restricted Power - Computational Complexity Results for Strategic Defense Games
- Strategy-proofness of continuous aggregation maps
- On completeness of narrowing strategies
- Power of voters and domain of preferences where voting by committees is strategy-proof
- A unified characterization of the randomized strategy-proof rules
- Separable Preferences, Strategyproofness, and Decomposability
- Strategy-proof partitioning
- scientific article; zbMATH DE number 6125177 (Why is no real title available?)
- Tops-only domains
- Coding strategies, the Choquet game, and domain representability
- Strategy-proof improvements upon deferred acceptance: a maximal domain for possibility
This page was built for publication: Strategy-proofness on restricted separable domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483577)
