The computational difficulty of manipulating an election (Q1824524): Difference between revisions

@@ Property / cites work @@
+Voting schemes for which it can be difficult to tell who won the election
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+Manipulation of social choice functions
@@ Property / cites work: Manipulation of social choice functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+Choice and complexity
@@ Property / cites work: Choice and complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On effectively computable realizations of choice functions
+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 @@
+The Voting Problem
@@ Property / cites work: The Voting Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00295861
+Normal rank
@@ Property / OpenAlex ID @@
+W2003296459
@@ Property / OpenAlex ID: W2003296459 / rank @@
+Normal rank