Pages that link to "Item:Q2388738"
From MaRDI portal
The following pages link to Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized (Q2388738):
Displaying 50 items.
- The difference between manipulability indices in the IC and IANC models (Q284375) (← links)
- A unifying impossibility theorem (Q382333) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Tops-only domains (Q623445) (← links)
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness (Q647541) (← links)
- Social choice and individual values in the electronic republic (Q649143) (← links)
- Strategic manipulation in voting games when lotteries and ties are permitted (Q697934) (← links)
- On strategy-proof social choice correspondences: a comment (Q733769) (← links)
- Coalitionally strategy-proof social choice correspondences and the Pareto rule (Q734050) (← links)
- An extension of the Moulin no show paradox for voting correspondences (Q836920) (← links)
- Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems (Q844925) (← links)
- Strategy-proof voting on the full preference domain (Q859595) (← links)
- Strategic manipulations of multi-valued solutions in economies with indivisibilities (Q868214) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- Set-monotonicity implies Kelly-strategyproofness (Q904832) (← links)
- Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society (Q990505) (← links)
- On strategy-proof social choice correspondences (Q1024775) (← links)
- Expected utility consistent extensions of preferences (Q1036099) (← links)
- Choosers as extension axioms (Q1036106) (← links)
- Strategy-proof social choice correspondences. (Q1347821) (← links)
- A trade-off result for preference revelation (Q1576476) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- Optimal bounds for the no-show paradox via SAT solving (Q1680092) (← links)
- Strategic candidacy for multivalued voting procedures (Q1877156) (← links)
- On strategy-proofness and single-peakedness: median-voting over intervals (Q2021810) (← links)
- Merging epistemic states and manipulation (Q2146047) (← links)
- Stable preference aggregation with infinite population (Q2171855) (← links)
- A note on the complexity of manipulating weighted Schulze voting (Q2203580) (← links)
- On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences (Q2371435) (← links)
- On the manipulation of social choice correspondences (Q2385068) (← links)
- A general impossibility result on strategy-proof social choice hyperfunctions (Q2389312) (← links)
- Manipulability of consular election rules (Q2417407) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Monotonicity properties and their adaptation to irresolute social choice rules (Q2450081) (← links)
- Strategy-proof resolute social choice correspondences (Q2467525) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Computational Aspects of Approval Voting (Q2829683) (← links)
- (Q3384086) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control (Q3599137) (← links)
- (Q5018516) (← links)
- Further Results on the Manipulability of Social Choice Rules—A Comparison of Standard and Favardin–Lepelley Types of Individual Manipulation (Q5053694) (← links)
- On the Indecisiveness of Kelly-Strategyproof Social Choice Functions (Q5076342) (← links)
- Social Choice Theory (Q5150296) (← links)
- FUZZY VOTERS, CRISP VOTES (Q5294342) (← links)
- Vote swapping in irresolute two-tier voting procedures (Q6051887) (← links)
- Taxonomy of powerful voters and manipulation in the framework of social choice functions (Q6051889) (← links)
- Characterizing the top cycle via strategyproofness (Q6076911) (← links)
