Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
From MaRDI portal
Publication:836934
DOI10.1007/s00355-009-0375-7zbMath1190.91049MaRDI 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
90C05: Linear programming
91A05: 2-person games
91B12: Voting theory
05C20: Directed graphs (digraphs), tournaments
Related Items
An extension of McGarvey's theorem from the perspective of the plurality collective choice mechanism, \(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
Cites Work