Approximation and hardness of shift-bribery
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- A birthday repetition theorem and complexity of approximating dense CSPs
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- An Exploration in the Theory of Optimum Income Taxation
- Approximating weighted and priced bribery in scoring rules
- Barriers to manipulation in voting
- Campaign management under approval-driven voting rules
- Combinatorial \(n\)-fold integer programming and applications
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Control and bribery in voting
- Determining possible and necessary winners given partial orders
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
- How hard is bribery in elections?
- Independence and irredundance in \(k\)-regular graphs
- Iterative methods in combinatorial optimization.
- Large-scale election campaigns: combinatorial shift bribery
- Multivariate complexity analysis of Swap Bribery
- On complexity of lobbying in multiple referenda
- On the Parameterized Complexity of Approximating Dominating Set
- On the complexity of k-SAT
- On the efficiency of polynomial time approximation schemes
- Parameterized algorithms
- Polynomial integrality gaps for strong SDP relaxations of densest k-subgraph
- Prices matter for the parameterized complexity of shift bribery
- Robustness among multiwinner voting rules
- Some simplified NP-complete graph problems
- Swap bribery
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
- The complexity of probabilistic lobbying
- The constant inapproximability of the parameterized dominating set problem
- Which problems have strongly exponential complexity?
Cited in
(10)- Approximating weighted and priced bribery in scoring rules
- Large-scale election campaigns: combinatorial shift bribery
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Complexity of shift bribery in committee elections
- Complexity of shift bribery for iterative voting rules
- Prices matter for the parameterized complexity of shift bribery
- Possible and necessary winner problems in iterative elections with multiple rules
- Multivariate complexity analysis of Swap Bribery
- Voting and bribing in single-exponential time
- How hard is bribery with distance restrictions?
This page was built for publication: Approximation and hardness of shift-bribery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238694)
