Smallest tournaments not realizable by 23-majority voting

DOI10.1007/S00355-009-0375-7MaRDI QIDQ836934zbMATH OpenOpenAlexFDO

Authors Dylan Shepardson, Craig A. Tovey

Publication date 9 September 2009

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00355-009-0375-7

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Linear programming (90C05) 2-person games (91A05) Voting theory (91B12)

Recommendations

• On -majority voting paradoxes
• Margin of victory for tournament solutions
• Tournament games and Condorcet voting
• A survey on the complexity of tournament solutions
• Tournament solutions and majority voting

Cites work

• A necessary but insufficient condition for the stochastic binary choice problem
• Choosing from a tournament
• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• On -majority voting paradoxes
• Scoring of web pages and tournaments-axiomatizations
• Tournament solutions and majority voting
• Voting paradoxes and digraphs realizations

Cited in

(6)

• On -majority voting paradoxes
• Tournament games and Condorcet voting
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• What shall we do with the cyclic profile?
• A conjecture on the construction of orderings by Borda's rule
• An extension of McGarvey's theorem from the perspective of the plurality collective choice mechanism

This page was built for publication: Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting

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