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-yzbMath1088.91506MaRDI QIDQ1767293
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
Related Items
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, An updated survey on the linear ordering problem for weighted or unweighted tournaments, On the complexity of Slater's problems, A survey on the linear ordering problem for weighted or unweighted tournaments, Studies in Computational Aspects of Voting, The Computational Complexity of Choice Sets