Possible winner problems on partial tournaments: a parameterized study

DOI10.1007/s10878-016-0012-1zbMath1371.90123OpenAlexW2331297833MaRDI QIDQ2359793

Jiong Guo, Yongjie Yang

Publication date: 22 June 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0012-1

zbMATH Keywords

parameterized complexityuncovered setfixed-parameter tractableBanks settournament solution

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ Margin of victory for tournament solutions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterized algorithms for feedback set problems and their duals in tournaments
• On the parameterized complexity of multiple-interval graph problems
• A survey on the complexity of tournament solutions
• Sophisticated voting outcomes and agenda control
• Fixed-parameter tractability results for feedback set problems in tournaments
• Parameterized complexity of the induced subgraph problem in directed graphs
• Banks winners in tournaments are difficult to recognize
• The Computational Complexity of Choice Sets
• Possible and Necessary Winners of Partial Tournaments
• Incompressibility through Colors and IDs
• Kernelization: New Upper and Lower Bound Techniques
• Condorcet Social Choice Functions

This page was built for publication: Possible winner problems on partial tournaments: a parameterized study