IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v23y2004i1p113-114.html
   My bibliography  Save this article

A note on “Banks winners in tournaments are difficult to recognize” by G. J. Woeginger

Author

Listed:
  • Olivier Hudry

Abstract

Given a tournament T, a Banks winner of T is the first vertex of any maximal (with respect to inclusion) transitive subtournament of T. While Woeginger shows that recognizing whether a given vertex of T is a Banks winner is NP-complete, the computation of a Banks winner of T is polynomial, and more precisely linear with respect to the size of T. Copyright Springer-Verlag 2004

Suggested Citation

  • Olivier Hudry, 2004. "A note on “Banks winners in tournaments are difficult to recognize” by G. J. Woeginger," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(1), pages 113-114, August.
    • Handle: RePEc:spr:sochwe:v:23:y:2004:i:1:p:113-114
    DOI: 10.1007/s00355-003-0241-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00355-003-0241-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00355-003-0241-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Olivier Hudry & Bernard Monjardet, 2010. "Consensus theories: An oriented survey," Documents de travail du Centre d'Economie de la Sorbonne 10057, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    2. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    3. Brandt, Felix & Harrenstein, Paul & Seedig, Hans Georg, 2017. "Minimal extending sets in tournaments," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 55-63.
    4. Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
    5. Scott Moser, 2015. "Majority rule and tournament solutions," Chapters, in: Jac C. Heckelman & Nicholas R. Miller (ed.), Handbook of Social Choice and Voting, chapter 6, pages 83-101, Edward Elgar Publishing.
    6. Hudry, Olivier, 2010. "On the complexity of Slater's problems," European Journal of Operational Research, Elsevier, vol. 203(1), pages 216-221, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:23:y:2004:i:1:p:113-114. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.