Skip to main content
Springer Nature Link
Log in

Banks winners in tournaments are difficult to recognize

  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands (e-mail: g.j.woeginger@math.utwente.nl), , , , , , NL

    Gerhard J. Woeginger

Authors
  1. Gerhard J. Woeginger
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

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.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Woeginger, G. Banks winners in tournaments are difficult to recognize. Soc Choice Welfare 20, 523–528 (2003). https://doi.org/10.1007/s003550200197

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003550200197

Keywords