The following pages link to Dictatorial domains (Q1407770):
Displaying 50 items.
- A fundamental structure of strategy-proof social choice correspondences with restricted preferences over alternatives (Q404746) (← links)
- Two necessary conditions for strategy-proofness: on what domains are they also sufficient? (Q423715) (← links)
- On strategy-proof social choice under categorization (Q427520) (← links)
- Automated reasoning in social choice theory: some remarks (Q475377) (← links)
- Tops-only domains (Q623445) (← links)
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness (Q647541) (← links)
- Circular domains (Q707698) (← links)
- Dictatorial domains in preference aggregation (Q866931) (← links)
- Further results on dictatorial domains (Q892849) (← links)
- Strategy-proof social choice on multiple and multi-dimensional single-peaked domains (Q894024) (← links)
- Abstract Arrowian aggregation (Q969114) (← links)
- Strategy-proof social choice with exogenous indifference classes (Q1005762) (← links)
- Strategy-proofness of the plurality rule over restricted domains (Q1014329) (← links)
- A dictatorial domain for monotone social choice functions (Q1046242) (← links)
- Another induction proof of the Gibbard-Satterthwaite theorem (Q1046284) (← links)
- Dictatorship on top-circular domains (Q1620949) (← links)
- Which dictatorial domains are superdictatorial? A complete characterization for the Gibbard-Satterthwaite impossibility (Q1645204) (← links)
- On random social choice functions with the tops-only property (Q1753301) (← links)
- The single-peaked domain revisited: a simple global characterization (Q1757559) (← links)
- On the alternating use of ``unanimity'' and ``surjectivity'' in the Gibbard-Satterthwaite theorem (Q1934106) (← links)
- Superdictatorial domains for monotonic social choice functions (Q1934165) (← links)
- Random dictatorship domains (Q2016232) (← links)
- Manipulation of social choice functions under incomplete information (Q2049488) (← links)
- Strategy-proofness of the unanimity with status-quo rule over restricted domains (Q2069957) (← links)
- Restricted environments and incentive compatibility in interdependent values models (Q2078029) (← links)
- Collective choice rules on restricted domains based on a priori information (Q2093824) (← links)
- Arrow on domain conditions: a fruitful road to travel (Q2179463) (← links)
- Necessary and sufficient conditions for pairwise majority decisions on path-connected domains (Q2243536) (← links)
- A characterization of possibility domains under Pareto optimality and group strategy-proofness (Q2324698) (← links)
- A characterization of possibility domains in strategic voting (Q2338654) (← links)
- A quest for fundamental theorems of social choice (Q2341125) (← links)
- On single-peaked domains and min-max rules (Q2417386) (← links)
- Manipulability of consular election rules (Q2417407) (← links)
- Random mechanism design on multidimensional domains (Q2419590) (← links)
- Top-pair and top-triple monotonicity (Q2431836) (← links)
- On domains that admit well-behaved strategy-proof social choice functions (Q2447057) (← links)
- Social welfare functions that satisfy Pareto, anonymity, and neutrality, but not independence of irrelevant alternatives (Q2460080) (← links)
- A characterization of superdictatorial domains for strategy-proof social choice functions (Q2463577) (← links)
- Strategy-proof resolute social choice correspondences (Q2467525) (← links)
- Strategy-proof allocation of multiple public goods (Q2475986) (← links)
- Voting by committees under constraints (Q2485953) (← links)
- Separable discrete preferences (Q2486167) (← links)
- Social welfare functions generating social choice rules that are invulnerable to manipulation (Q2490939) (← links)
- A taxonomy of non-dictatorial unidimensional domains (Q2681509) (← links)
- Maximal Domains for Maskin Monotone Pareto Optimal and Anonymous Choice Rules (Q2787396) (← links)
- (Q3384086) (← links)
- Recent Results on Strategy-Proofness of Random Social Choice Functions (Q5022149) (← links)
- Formation of Committees Through Random Voting Rules (Q5111109) (← links)
- Another direct proof of the Gibbard-Satterthwaite theorem (Q5940810) (← links)
- Unanimity and local incentive compatibility in sparsely connected domains (Q6051893) (← links)