Distance restricted manipulation in voting (Q2235758): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2021.08.034
@@ Property / DOI: 10.1016/j.tcs.2021.08.034 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W3197554753
@@ Property / OpenAlex ID: W3197554753 / rank @@
+Normal rank
@@ Property / cites work @@
+Single transferable vote resists strategic voting
@@ Property / cites work: Single transferable vote resists strategic voting / rank @@
+Normal rank
@@ Property / cites work @@
+The computational difficulty of manipulating an election
+Normal rank
@@ Property / cites work @@
+When are elections with few candidates hard to manipulate?
+Normal rank
@@ Property / cites work @@
+Barriers to Manipulation in Voting
@@ Property / cites work: Barriers to Manipulation in Voting / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
+Normal rank
@@ Property / cites work @@
+Complexity of manipulation with partial information in voting
+Normal rank
@@ Property / cites work @@
+A Quantitative Version of the Gibbard–Satterthwaite Theorem for Three Alternatives
+Normal rank
@@ Property / cites work @@
+Control and Bribery in Voting
@@ Property / cites work: Control and Bribery in Voting / rank @@
+Normal rank
@@ Property / cites work @@
+Manipulation of Voting Schemes: A General Result
@@ Property / cites work: Manipulation of Voting Schemes: A General Result / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A quantitative Gobbard-Satterthwaite theorem without neutrality
+Normal rank
@@ Property / cites work @@
+Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
+Normal rank
@@ Property / cites work @@
+Is it ever safe to vote strategically?
@@ Property / cites work: Is it ever safe to vote strategically? / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2021.08.034
@@ Property / DOI: 10.1016/J.TCS.2021.08.034 / rank @@
+Normal rank