Upper set rules with binary ranges
From MaRDI portal
Recommendations
- A strategy-proofness characterization of majority rule
- Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results
- On strategy-proof social choice between two alternatives
- Strategy-proof social choice correspondences.
- Domains, ranges and strategy-proofness: the case of single-dipped preferences
Cites work
- A characterization of strategy-proof social choice functions for economies with pure public goods
- Domains, ranges and strategy-proofness: the case of single-dipped preferences
- Efficient and strategy-proof social choice when preferences are single-dipped
- Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results
- Group strategy-proofness and voting between two alternatives
- Individual versus group strategy-proofness: when do they coincide?
- Mechanism design with two alternatives in quasi-linear environments
- On strategy-proofness and symmetric single-peakedness
- Reaching consensus: solidarity and strategic properties in binary social choice
- Strategy-Proof Exchange
- Strategy-proof location of public facilities
- Strategy-proof voting on the full preference domain
- Voting by Committees
This page was built for publication: Upper set rules with binary ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1986598)