A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger

DOI10.1007/S00355-003-0241-YMaRDI QIDQ1767293zbMATH OpenOpenAlexFDO

Authors Olivier Hudry

Publication date 8 March 2005

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00355-003-0241-y

zbMATH Keywords

NP-complete

Mathematics Subject Classification ID

Recommendations

• Banks winners in tournaments are difficult to recognize
• A smallest tournament for which the Banks set and the Copeland set are disjoint
• A 16-vertex tournament for which Banks set and Slater set are disjoint
• A computational analysis of the tournament equilibrium set
• A survey on the complexity of tournament solutions

Cited in

(13)

• Banks winners in tournaments are difficult to recognize
• On the complexity of Slater's problems
• Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
• Computing the minimal covering set
• A tournament of order 14 with disjoint Banks and Slater sets
• Collective decision making
• A smallest tournament for which the Banks set and the Copeland set are disjoint
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• Minimal extending sets in tournaments
• The Computational Complexity of Choice Sets
• Studies in Computational Aspects of Voting
• A survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger

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