Pages that link to "Item:Q859595"
From MaRDI portal
The following pages link to Strategy-proof voting on the full preference domain (Q859595):
Displaying 28 items.
- Efficient and strategy-proof social choice when preferences are single-dipped (Q403970) (← links)
- Group strategy-proofness and voting between two alternatives (Q433814) (← links)
- An extreme point characterization of strategy-proof and unanimous probabilistic rules over binary restricted domains (Q516060) (← links)
- A characterization of status quo rules in the binary social choice model (Q777682) (← links)
- Strategy-proof voting on compact ranges (Q1272626) (← links)
- Strategy-proofness on Euclidean spaces (Q1360946) (← links)
- Strategy-proofness and ``median voters'' (Q1376987) (← links)
- Strategy-proof voting schemes with continuous preferences (Q1824523) (← links)
- Threshold strategy-proofness: on manipulability in large voting problems (Q1886747) (← links)
- Power of voters and domain of preferences where voting by committees is strategy-proof (Q1906707) (← links)
- Group strategy-proof social choice functions with binary ranges and arbitrary domains: characterization results (Q1938825) (← links)
- On strategy-proof social choice between two alternatives (Q1986593) (← links)
- Upper set rules with binary ranges (Q1986598) (← links)
- The structure of two-valued coalitional strategy-proof social choice functions (Q2050988) (← links)
- Restricted environments and incentive compatibility in interdependent values models (Q2078029) (← links)
- Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
- Binary strategy-proof social choice functions with indifference (Q2143915) (← links)
- Preference reversal and group strategy-proofness (Q2209557) (← links)
- A characterization of possibility domains in strategic voting (Q2338654) (← links)
- Truthful implementation and preference aggregation in restricted domains (Q2447058) (← links)
- Domains, ranges and strategy-proofness: the case of single-dipped preferences (Q2450079) (← links)
- Voting by committees under constraints (Q2485953) (← links)
- Reaching consensus: solidarity and strategic properties in binary social choice (Q2516129) (← links)
- A characterization of strategy-proof voting rules for separable weak orderings (Q2568847) (← links)
- Anonymous, non-manipulable binary social choice (Q2673213) (← links)
- Range convexity, continuity, and strategy-proofness of voting schemes (Q3142161) (← links)
- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control (Q3599137) (← links)
- A note on binary strategy-proof social choice functions (Q6105153) (← links)