Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
From MaRDI portal
Publication:6912795
Cites work
- Approximating the product knapsack problem
- Bi-criteria path problem with minimum length and maximum survival probability
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Fixing knockout tournaments with seeds
- Fundamentals of parameterized complexity
- How hard is bribery in elections?
- How hard is safe bribery?
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Knockout tournaments
- Large-scale election campaigns: combinatorial shift bribery
- Linear Inequalities and Related Systems. (AM-38)
- Losing weight by gaining edges
- Manipulating Tournaments in Cup and Round Robin Competitions
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Parameterized algorithms
- Parameterizing by the number of numbers
- Robustness of participatory budgeting outcomes: complexity and experiments
- Round robin scheduling -- a survey
- Strategic manipulations in round-robin tournaments
- Swap bribery
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity?
- Tournament solutions and majority voting
This page was built for publication: Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912795)
