Possible winner problems on partial tournaments: a parameterized study

DOI10.1007/978-3-642-41575-3_33MaRDI QIDQ2868574zbMATH OpenOpenAlexFDO

Authors Yongjie Yang, Jiong Guo

Publication date 17 December 2013

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41575-3_33

zbMATH Keywords

Banks setspartial tournamentspossible winner problems

Mathematics Subject Classification ID

Applications of graph theory (05C90) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Voting theory (91B12)

Recommendations

• Possible winner problems on partial tournaments: a parameterized study
• Possible and necessary winners of partial tournaments
• On problem kernels for possible winner determination under the k-approval protocol
• Kernelization complexity of possible winner and coalitional manipulation problems in voting
• Banks winners in tournaments are difficult to recognize

Cited in

(4)

• Possible winner problems on partial tournaments: a parameterized study
• Banks winners in tournaments are difficult to recognize
• Possible and necessary winners of partial tournaments
• Beyond the worst case: semi-random complexity analysis of winner determination

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868574)