The following pages link to (Q4681553):
Displaying 50 items.
- First-order logic formalisation of impossibility theorems in preference aggregation (Q373021) (← links)
- A fundamental structure of strategy-proof social choice correspondences with restricted preferences over alternatives (Q404746) (← links)
- Choosing the best among peers (Q441881) (← links)
- Voting with rubber bands, weights, and strings (Q449038) (← links)
- Condorcet's principle and the strong no-show paradoxes (Q490062) (← links)
- One-way monotonicity as a form of strategy-proofness (Q532698) (← links)
- Aggregating expert judgement (Q542075) (← links)
- Set-rationalizable choice and self-stability (Q634537) (← links)
- An extension of the Moulin no show paradox for voting correspondences (Q836920) (← links)
- A method for eliciting utilities and its application to collective choice (Q850479) (← 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)
- The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience) (Q990626) (← links)
- On the computability of quasi-transitive binary social choice rules in an infinite society and the halting problem (Q1022421) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Expected utility consistent extensions of preferences (Q1036099) (← links)
- Formalizing Arrow's theorem (Q1040010) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- Impossibility in belief merging (Q1680693) (← links)
- Ontological query answering under many-valued group preferences in Datalog\(+/-\) (Q1726403) (← links)
- Sincerity and manipulation under approval voting (Q1945667) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- New transitivity of Atanassov's intuitionistic fuzzy sets in a decision making model (Q2115907) (← links)
- Merging epistemic states and manipulation (Q2146047) (← links)
- An integrated data envelopment analysis and simulation method for group consensus ranking (Q2228719) (← links)
- Manipulating an aggregation rule under ordinally fuzzy preferences (Q2268892) (← links)
- Strongly sincere best responses under approval voting and arbitrary preferences (Q2273959) (← links)
- Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks (Q2321270) (← links)
- Consistency without neutrality in voting rules: When is a vote an average? (Q2389767) (← links)
- Monotonicity properties and their adaptation to irresolute social choice rules (Q2450081) (← links)
- The Efron dice voting system (Q2450154) (← links)
- On the computability of binary social choice rules in an infinite society and the halting problem (Q2479229) (← links)
- Continuity of social choice functions with restricted coalition algebras (Q2642552) (← links)
- Social choice theory in HOL. Arrow and Gibbard-Satterthwaite (Q2655324) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Obvious manipulability of voting rules (Q2695439) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Representation theory of the symmetric group in voting theory and game theory (Q2979648) (← links)
- A Geometric Look at Manipulation (Q3092296) (← links)
- (Q3384086) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- (Q5018516) (← links)
- On the Indecisiveness of Kelly-Strategyproof Social Choice Functions (Q5076342) (← links)
- Social Choice Theory (Q5150296) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Condorcet’s Paradox and Ultrafilters (Q5208790) (← links)
- Dependence and Independence in Social Choice: Arrow’s Theorem (Q5213648) (← links)
- Strategy-Proof Location Functions on Finite Graphs (Q5270615) (← links)
- Taxonomy of powerful voters and manipulation in the framework of social choice functions (Q6051889) (← links)
- Characterizing the top cycle via strategyproofness (Q6076911) (← links)
