A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
From MaRDI portal
Publication:1767293
DOI10.1007/S00355-003-0241-YzbMATH Open1088.91506OpenAlexW2070033045MaRDI QIDQ1767293FDOQ1767293
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
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)
- Studies in Computational Aspects of Voting
- A smallest tournament for which the Banks set and the Copeland set are disjoint
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Minimal extending sets in tournaments
- On the complexity of Slater's problems
- Banks winners in tournaments are difficult to recognize
- Collective decision making
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- The Computational Complexity of Choice Sets
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Computing the minimal covering set
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A tournament of order 14 with disjoint Banks and Slater sets
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)
