Pages that link to "Item:Q1824524"
From MaRDI portal
The following pages link to The computational difficulty of manipulating an election (Q1824524):
Displaying 50 items.
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- A quantitative Gobbard-Satterthwaite theorem without neutrality (Q343234) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Is it ever safe to vote strategically? (Q404772) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Frugal bribery in voting (Q527399) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Algorithms for gerrymandering over graphs (Q831130) (← links)
- Algorithms for the coalitional manipulation problem (Q835815) (← links)
- Vote trading in public elections (Q855754) (← links)
- Dichotomy for voting systems (Q859982) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Voting schemes for which it can be difficult to tell who won the election (Q1120433) (← links)
- How hard is it to control an election? (Q1200886) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- Complexity of manipulation with partial information in voting (Q1743720) (← links)
- On random social choice functions with the tops-only property (Q1753301) (← links)
- On the evaluation of election outcomes under uncertainty (Q1761297) (← links)
- On the difficulty of making social choices (Q1891667) (← links)
- Cognitive hierarchy and voting manipulation in \(k\)-approval voting (Q2019338) (← links)
- A brief history of social choice and welfare theory (Q2064124) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Resolute control: forbidding candidates from winning an election is hard (Q2143123) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Byzantine preferential voting (Q2190409) (← links)
- A note on the complexity of manipulating weighted Schulze voting (Q2203580) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Distance restricted manipulation in voting (Q2235758) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
