Corpus ID: 218502564

Multistage Committee Election

  title={Multistage Committee Election},
  author={Robert Bredereck and Till Fluschnik and A. Kaczmarczyk},
Electing a single committee of a small size is a classical and well-understood voting situation. Being interested in a sequence of committees, we introduce and study two time-dependent multistage models based on simple Plurality voting. Therein, we are given a sequence of voting profiles (stages) over the same set of agents and candidates, and our task is to find a small committee for each stage of high score. In the conservative model we additionally require that any two consecutive committees… Expand
Parameterized Algorithms for Diverse Multistage Problems
This work introduces a framework allowing it to prove that a number of diverse multistage problems are fixed-parameter tractable by diversity, namely Perfect Matching, s-t Path, Matroid Independent Set, and Plurality Voting. Expand
Multistage Problems on a Global Budget
This work studies the different (time) layers of a temporal graph, and finds that sometimes the global multistage versions of NP-hard problems such as Vertex Cover turn out to be computationally easier than the ones of polynomial-time solvable problemssuch as Matching. Expand
A General Approach to Approximate Multistage Subgraph Problems
This work presents a framework that provides a (1/ √ 2χ)-approximation algorithm for the 2-stage restriction of an MSP if the similarity of subsequent solutions is measured as the intersection cardinality and said MSP is preficient, i.e., the authors can efficiently find a single-stage solution that prefers some given subset. Expand
Broadening the Research Agenda for Computational Social Choice: Multiple Preference Profiles and Multiple Solutions
This work systematically review different types of arising settings, point out how classical problems and solution concepts can be generalized, and identify several research challenges. Expand
A Multistage View on 2-Satisfiability
It is proved that Multistage 2-SAT is NP-hard even in quite restricted cases and parameterized algorithms for Multistages are presented and proved to be asymptotically optimal. Expand
Multistage s-t Path: Confronting Similarity with Dissimilarity
It is proved that dissimilarity allows for fixed-parameter tractability for the parameter solution size, contrasting the W[1]-hardness proof of the corresponding similarity case. Expand


Electing Successive Committees: Complexity and Algorithms
The point is that this new model additionally takes into account that “committee members” shall have a short term of office possibly over a consecutive time period, to find a “best possible” series of committees representing the electorate. Expand
Sub-committee Approval Voting and Generalized Justified Representation Axioms
A general model of social choice called sub-committee voting called SCV is studied that simultaneously generalizes these settings and proposes extensions of the justified representation axioms that have been considered for proportional representation in approval-based committee voting. Expand
Fair and Efficient Social Choice in Dynamic Settings
This work presents and analyzes two greedy algorithms for the dynamic social choice problem, including the classic Proportional Fair algorithm, and provides an axiomatization of PF. Expand
Multistage Knapsack
A PTAS is proposed for the Multistage Knapsack problem and it is proved that there is no FPTAS for the problem even in the case where T=2, unless P=NP, and a pseudopolynomial time algorithm is given for the cases where the number of steps is bounded by a fixed constant. Expand
Multistage Matchings
14 We consider a multistage version of the Perfect Matching problem which models the 15 scenario where the costs of edges change over time and we seek to obtain a solution that achieves 16 low totalExpand
Multistage Vertex Cover
The goal is to find for each layer of the temporal graph a small vertex cover and to guarantee that two vertex cover sets of every two consecutive layers differ not too much (specified by a given parameter). Expand
Dynamic Social Choice with Evolving Preferences
This paper model the problem via Markov decision processes (MDP), where the states of the MDP coincide with preference profiles and a (deterministic, stationary) policy corresponds to a social choice function, and presents tractable algorithms that compute optimal policies under different prominent social choice constraints. Expand
On the parameterized complexity of multiple-interval graph problems
A useful technique for showing W[1]-hardness via a reduction from the k-Multicolored Clique problem, a variant of k-Clique, is developed, which should help in simplifying W-hardness results which are notoriously hard to construct and technically tedious. Expand
Facility Location in Evolving Metrics
This work introduces a time-dependent, dynamic version of the facility location problem, which includes a switching cost when a client’s assignment changes from one facility to another, to provide a better representation of an evolving network. Expand
Changing Bases: Multistage Optimization for Matroids and Matchings
This paper is motivated by the fact that many systems need to be maintained continually while the underlying costs change over time, and model this as a multistage combinatorial optimization problem where the input is a sequence of cost functions. Expand