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. Copyright Springer-Verlag Berlin Heidelberg 2003
Volume (Year): 20 (2003)
Issue (Month): 3 (06)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:20:y:2003:i:3:p:523-528. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.