Banks winners in tournaments are difficult to recognize

Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

50 Citations (Scopus)
1 Downloads (Pure)


Given a tournament T, a Banks winner of T is the top vertex of any maximal (with respect to inclusion) transitive subtournament of T. In this technical note, we show that the problem of deciding whether some fixed vertex v is a Banks winner for T is NP-complete.
Original languageEnglish
Pages (from-to)523-528
Number of pages6
JournalSocial choice and welfare
Issue number3
Publication statusPublished - 2003


  • IR-58670
  • METIS-213302


Dive into the research topics of 'Banks winners in tournaments are difficult to recognize'. Together they form a unique fingerprint.

Cite this