Banks winners in tournaments are difficult to recognize

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. Received: 22 February 2002/Accepted: 20 June 2002 Supported by the START program Y43-MAT of the Austrian Ministry of Science. I would like to thank two thank the referees for a careful reading of the paper, for helpful remarks, and for many suggestions how to improve the presentation.