Studies in computational aspects of voting: open problems of downey and fellows

Authors:
Nadja Betzler;Robert Bredereck;Jiehua Chen;Rolf Niedermeier
Affiliations:
Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany;Institut für Softwaretechnik und Theoretische Informatik, TU Berlin, Germany
Venue:
The Multivariate Algorithmic Revolution and Beyond
Year:
2012

Citing 67
Cited 4

Color-coding

Journal of the ACM (JACM)
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP

Journal of the ACM (JACM)
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
A heuristic technique for multi-agent planning

Annals of Mathematics and Artificial Intelligence
Efficient similarity search and classification via rank aggregation

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Algorithm Design

Algorithm Design
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
The complexity of Kemeny elections

Theoretical Computer Science
Understanding and Using Linear Programming (Universitext)

Understanding and Using Linear Programming (Universitext)
Invitation to data reduction and problem kernelization

ACM SIGACT News
When are elections with few candidates hard to manipulate?

Journal of the ACM (JACM)
Anyone but him: The complexity of precluding an alternative

Artificial Intelligence
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG

Information Processing Letters
Consensus Genetic Maps as Median Orders from Inconsistent Sources

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Nonuniform bribery

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A Short Introduction to Computational Social Choice

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Parameterizing above or below guaranteed values

Journal of Computer and System Sciences
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
Parameterized computational complexity of control problems in voting systems

Theoretical Computer Science
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Fast FAST

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Incompressibility through Colors and IDs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing slater rankings using similarities among candidates

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Uncertainty in preference elicitation and aggregation

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science
On problems without polynomial kernels

Journal of Computer and System Sciences
Parameterized complexity of candidate control in elections and related digraph problems

Theoretical Computer Science
Llull and Copeland voting computationally resist bribery and constructive control

Journal of Artificial Intelligence Research
How hard is bribery in elections?

Journal of Artificial Intelligence Research
A multivariate complexity analysis of determining possible winners given incomplete votes

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Preference functions that score rankings and maximum likelihood estimation

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Making decisions based on the preferences of multiple agents

Communications of the ACM
The Complexity of Probabilistic Lobbying

ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Swap Bribery

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology

Combinatorial Algorithms
Kernelization: New Upper and Lower Bound Techniques

Parameterized and Exact Computation
Improved Parameterized Algorithms for the Kemeny Aggregation Problem

Parameterized and Exact Computation
Aggregation of Partial Rankings, p-Ratings and Top-m Lists

Algorithmica
Parameterized complexity of control problems in Maximin election

Information Processing Letters
On the role of distances in defining voting rules

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Using complexity to protect elections

Communications of the ACM
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules

Journal of Computer and System Sciences
Control complexity in fallback voting

CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
The Clarke tax as a consensus mechanism among automated agents

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
On problem kernels for possible winner determination under the k-approval protocol

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Infeasibility of instance compression and succinct PCPs for NP

Journal of Computer and System Sciences
Approximation algorithms for campaign management

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring

Journal of Discrete Algorithms
On making a distinguished vertex minimum degree by vertex deletion

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Average parameterization and partial kernelization for computing medians

Journal of Computer and System Sciences
Incompleteness and incomparability in preference aggregation: Complexity results

Artificial Intelligence
Ranking and drawing in subexponential time

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Kernel bounds for disjoint cycles and disjoint paths

Theoretical Computer Science
Multimode control attacks on elections

Journal of Artificial Intelligence Research
Determining possible and necessary winners under common voting rules given partial orders

Journal of Artificial Intelligence Research
On Bounded-Degree Vertex Deletion parameterized by treewidth

Discrete Applied Mathematics
How hard is it to control an election?

Mathematical and Computer Modelling: An International Journal
Unweighted coalitional manipulation under the Borda rule Is NP-hard

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
On the fixed-parameter tractability of composition-consistent tournament solutions

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
TreeMatrix: A Hybrid Visualization of Compound Graphs

Computer Graphics Forum
Lower bounds on kernelization

Discrete Optimization
Finding odd cycle transversals

Operations Research Letters
Multivariate Complexity Analysis of Swap Bribery

Algorithmica - Special Issue: Parameterized and Exact Computation, Part I
Parameterized Complexity

Parameterized Complexity

A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond
Parameterized enumeration of (locally-) optimal aggregations

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Kemeny elections with bounded single-peaked or single-crossing width

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We review NP-hard voting problems together with their status in terms of parameterized complexity results. In addition, we survey standard techniques for achieving fixed-parameter (in)tractability results in voting.