Pages that link to "Item:Q342714"
From MaRDI portal
The following pages link to Prices matter for the parameterized complexity of shift bribery (Q342714):
Displaying 15 items.
- The complexity of priced control in elections (Q314424) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Frugal bribery in voting (Q527399) (← links)
- Kernelization complexity of possible winner and coalitional manipulation problems in voting (Q906403) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- Large-scale election campaigns: combinatorial shift bribery (Q2800947) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- (Q5018515) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)
- How hard is safe bribery? (Q6057829) (← links)
- Hardness and algorithms for electoral manipulation under media influence (Q6113911) (← links)