Pages that link to "Item:Q1120433"
From MaRDI portal
The following pages link to Voting schemes for which it can be difficult to tell who won the election (Q1120433):
Displaying 50 items.
- Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991) (← links)
- Ranking chain sum orders (Q290525) (← links)
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- The complexity of priced control in elections (Q314424) (← links)
- It is difficult to tell if there is a Condorcet spanning tree (Q328521) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Voting with rubber bands, weights, and strings (Q449038) (← links)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- How hard is it to tell which is a Condorcet committee? (Q459394) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- Kernels for feedback arc set in tournaments (Q657916) (← 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)
- The complexity of Kemeny elections (Q817813) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Vote trading in public elections (Q855754) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- A distance-based comparison of basic voting rules (Q882604) (← links)
- Distance rationalization of voting rules (Q892848) (← links)
- Optimal social choice functions: a utilitarian view (Q899165) (← links)
- Voting rules as error-correcting codes (Q899434) (← links)
- Computing the minimal covering set (Q943589) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Approximability of Dodgson's rule (Q1024774) (← links)
- Mining maximum consensus sequences from group ranking data (Q1027615) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Three practical criteria of comparison among ordinal preference aggregating rules (Q1127146) (← links)
- How hard is it to control an election? (Q1200886) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties (Q1679657) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
- The computational difficulty of manipulating an election (Q1824524) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- On the difficulty of making social choices (Q1891667) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem (Q2072062) (← links)
