Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting

DOI10.1007/s00355-009-0375-7zbMath1190.91049OpenAlexW2046313052MaRDI QIDQ836934

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

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

Related Items (4)

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 ⋮ What shall we do with the cyclic profile? ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters

Cites Work

• Unnamed Item
• Choosing from a tournament
• On \(\lambda\)-majority voting paradoxes
• Tournament solutions and majority voting
• A necessary but insufficient condition for the stochastic binary choice problem
• Voting paradoxes and digraphs realizations
• Scoring of web pages and tournaments-axiomatizations

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