Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
From MaRDI portal
Publication:836934
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
Linear programming (90C05) 2-person games (91A05) Voting theory (91B12) Directed graphs (digraphs), tournaments (05C20)
Related Items
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