The following pages link to The complexity of Kemeny elections (Q817813):
Displayed 50 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- 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)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Graph aggregation (Q514143) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
- Complexity of stability (Q2237893) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks (Q2321270) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- An Algorithmic View of Voting (Q2827491) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP (Q3374757) (← links)
- (Q3384062) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- The Computational Complexity of Choice Sets (Q3392310) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation (Q4989327) (← links)
- (Q5015388) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- The Network HHD: Quantifying Cyclic Competition in Trait-Performance Models of Tournaments (Q5075837) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- Finding Optimal Solutions With Neighborly Help. (Q5092442) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Robustness among multiwinner voting rules (Q5918366) (← links)
- Complexity of Stability. (Q6065416) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- On weakly and strongly popular rankings (Q6094721) (← links)
- Recognizing when a preference system is close to admitting a master list (Q6124592) (← links)
- The possible winner with uncertain weights problem (Q6133655) (← links)
- Stability, vertex stability, and unfrozenness for special graph classes (Q6151148) (← links)
- Beyond the worst case: semi-random complexity analysis of winner determination (Q6167260) (← links)