Pages that link to "Item:Q5133005"

The following pages link to Introduction to the Theory of Voting (Q5133005):

Displaying 39 items.

• Variable-population voting rules (Q386060) (← links)
• Undominated candidate strategies under alternative voting rules (Q583067) (← links)
• Social choice and individual values in the electronic republic (Q649143) (← links)
• A characterization of the maximin rule in the context of voting (Q656886) (← links)
• Voting by eliminating quantifiers (Q1037605) (← links)
• Complete independence of clones in the ranked pairs rule (Q1121147) (← links)
• Iterative voting and acyclic games (Q1677436) (← links)
• Strategy-proofness of scoring allocation correspondences for indivisible goods (Q1707112) (← links)
• Choice by multirelations and the approval voting rule (Q1878762) (← links)
• Local voting models. A review of the axiomatic methods (Q1882021) (← links)
• Robust winner determination in positional scoring rules with uncertain weights (Q1986068) (← links)
• The Borda class. An axiomatic study of the Borda rule on top-truncated preferences (Q1996173) (← links)
• Anonymous, neutral, and resolute social choice revisited (Q2058841) (← links)
• Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem (Q2072062) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• A foundation for Pareto optimality (Q2178580) (← links)
• Tournament solutions based on cooperative game theory (Q2178642) (← links)
• Positionalist voting rules: a general definition and axiomatic characterizations (Q2217350) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Characterizing best-worst voting systems in the scoring context (Q2268897) (← links)
• Optimizing positional scoring rules for rank aggregation (Q2321258) (← links)
• Strategyproof judgment aggregation under partial information (Q2325667) (← links)
• Consistency without neutrality in voting rules: When is a vote an average? (Q2389767) (← links)
• Qualified voting systems (Q2409717) (← links)
• Proxy selection in transitive proxy voting (Q2667573) (← links)
• Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
• Do we really need numerous observations to select candidates? (The \(d\)-day theorem) (Q2739365) (← links)
• An algorithmic view of voting (Q2827491) (← links)
• Para-Disagreement Logics and Their Implementation Through Embedding in Coq and SMT (Q3305339) (← links)
• (Q3384086) (← links)
• Multi-winner Election Control via Social Influence (Q5100968) (← links)
• Exact methods for the oven scheduling problem (Q6049438) (← links)
• Bivariate scoring rules: unifying the characterizations of positional scoring rules and Kemeny's rule (Q6564045) (← links)
• A practical multi-candidate voting protocol on quantum blockchain adapted for various Tally principles (Q6575056) (← links)
• Iterative voting with partial preferences (Q6579295) (← links)
• A solution for abstract decision problems based on maximum flow value (Q6589395) (← links)
• Collective decision making (Q6602233) (← links)
• Multi-winner approval voting with grouped voters (Q6606238) (← links)
• Measuring violations of positive involvement in voting (Q6642575) (← links)