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.91506OpenAlexW2070033045MaRDI 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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Studies in Computational Aspects of Voting ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Minimal extending sets in tournaments ⋮ 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 ⋮ The Computational Complexity of Choice Sets ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ On the complexity of Slater's problems
This page was built for publication: A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
