Pages that link to "Item:Q4208875"

The following pages link to Exact analysis of Dodgson elections (Q4208875):

Displaying 48 items.

• Manipulation complexity of same-system runoff elections (Q314418) (← links)
• The complexity of priced control in elections (Q314424) (← links)
• Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
• Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
• The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
• The computational complexity of weak saddles (Q647484) (← links)
• The complexity of Kemeny elections (Q817813) (← links)
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
• Dichotomy for voting systems (Q859982) (← links)
• Distance rationalization of voting rules (Q892848) (← links)
• Optimal social choice functions: a utilitarian view (Q899165) (← links)
• Frequency of correctness versus average polynomial time (Q989533) (← links)
• Approximability of Dodgson's rule (Q1024774) (← links)
• Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
• The complexity of probabilistic lobbying (Q1662102) (← links)
• On the complexity of bribery with distance restrictions (Q1713407) (← links)
• On the approximability of Dodgson and Young elections (Q1761290) (← links)
• Structural control in weighted voting games (Q2098945) (← links)
• On the graph Laplacian and the rankability of data (Q2174433) (← links)
• Complexity of stability (Q2237893) (← links)
• Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
• Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
• Isomorphic implication (Q2272203) (← links)
• On stable rules for selecting committees (Q2358564) (← links)
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
• A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
• Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
• On complexity of lobbying in multiple referenda (Q2463791) (← links)
• Computational Aspects of Approval Voting (Q2829683) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
• Deciding According to the Shortest Computations (Q3091456) (← links)
• Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
• Some Remarks on Dodgson's Voting Rule (Q3392311) (← links)
• Weighted Boolean Formula Games (Q3464467) (← links)
• Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
• Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP (Q4571954) (← links)
• (Q5015388) (← links)
• (Q5018515) (← links)
• Isomorphic Distances Among Elections (Q5042228) (← links)
• The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)
• Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
• Complexity of Stability. (Q6065416) (← links)
• Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)