A 16-vertex tournament for which Banks set and Slater set are disjoint

DOI10.1016/S0166-218X(97)88689-1MaRDI QIDQ1382278zbMATH OpenOpenAlexFDO

Authors Irène Charon, Olivier Hudry, Frédéric Woirgard

Publication date 2 June 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

Banks winnerSlater winnertournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Group preferences (91B10)

Review text

A Banks winner of a tournament \(T\) is the node of largest score in any maximal transitive subtournament of \(T\). A Slater winner of \(T\) is the node of largest score in any transitive tournament obtained from \(T\) by reversing the smallest possible number of arcs. The authors define a tournament with 16 nodes for which the Banks winners and the Slater winners are disjoint.

Recommendations

• A tournament of order 14 with disjoint Banks and Slater sets
• A smallest tournament for which the Banks set and the Copeland set are disjoint
• Banks winners in tournaments are difficult to recognize
• A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
• On the complexity of Slater's problems

Cites work

• Choosing from a tournament
• scientific article; zbMATH DE number 1022237 (Why is no real title available?)
• scientific article; zbMATH DE number 1022238 (Why is no real title available?)
• scientific article; zbMATH DE number 3378948 (Why is no real title available?)
• On Subtournaments of a Tournament
• Slater's winners of a tournament may not be in the Banks set
• Sophisticated voting outcomes and agenda control

Cited in

(9)

• A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
• Bounds on the disparity and separation of tournament solutions
• A smallest tournament for which the Banks set and the Copeland set are disjoint
• Banks winners in tournaments are difficult to recognize
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Maximum distance between Slater orders and Copeland orders of tournaments
• The banks set and the bipartisan set may be disjoint
• A tournament of order 14 with disjoint Banks and Slater sets
• An updated survey on the linear ordering problem for weighted or unweighted tournaments

This page was built for publication: A 16-vertex tournament for which Banks set and Slater set are disjoint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382278)