Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting (Q836934): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Voting paradoxes and digraphs realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary but insufficient condition for the stochastic binary choice problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\lambda\)-majority voting paradoxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing from a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scoring of web pages and tournaments-axiomatizations / rank
 
Normal rank

Latest revision as of 23:30, 1 July 2024

scientific article
Language Label Description Also known as
English
Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
scientific article

    Statements