Banks winners in tournaments are difficult to recognize

From MaRDI portal
Publication:2568818

DOI10.1007/s003550200197zbMath1073.05538OpenAlexW2074016826MaRDI QIDQ2568818

Gerhard J. Woeginger

Publication date: 19 October 2005

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

Full work available at URL: https://doi.org/10.1007/s003550200197




Related Items (24)

Possible winner problems on partial tournaments: a parameterized studyExtending tournament solutionsStudies in Computational Aspects of VotingA survey on the linear ordering problem for weighted or unweighted tournamentsThe complexity of computing minimal unidirectional covering setsMinimal extending sets in tournamentsComputing and visualizing Banks sets of dominance relations using relation algebra and RelViewImproved bounds for minimal feedback vertex sets in tournamentsComputing minimal extending sets by relation-algebraic modeling and developmentRevealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and AlgorithmsThe computational complexity of rationalizing boundedly rational choice behaviorMinimal stable sets in tournamentsMinimal retentive sets in tournamentsVoting Procedures, Complexity ofComputing the minimal covering setA computational analysis of the tournament equilibrium setA tournament of order 14 with disjoint Banks and Slater setsAn updated survey on the linear ordering problem for weighted or unweighted tournamentsThe Computational Complexity of Choice SetsMargin of victory for tournament solutions\(k\)-majority digraphs and the hardness of voting with a constant number of votersA survey on the complexity of tournament solutionsOn the complexity of Slater's problemsBounds on the disparity and separation of tournament solutions




This page was built for publication: Banks winners in tournaments are difficult to recognize