Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability.
Yongjie YangJianxin WangPublished in: CoRR (2021)
Keyphrases
- parameterized complexity
- fixed parameter tractable
- winner determination
- np hard
- computational problems
- combinatorial auctions
- np complete
- global constraints
- conjunctive queries
- abstract argumentation
- approximation algorithms
- bounded treewidth
- optimal solution
- integer programming
- objective function
- knapsack problem
- linear programming
- multi agent