Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
type: Item
instance of: scholarly article
title: Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
zbMATH Open document ID: 1190.91049
author: Dylan Shepardson
author: Craig A. Tovey
published in: Social Choice and Welfare
publication date: 2009-09-09T00:00:00Z
Mathematics Subject Classification ID: 91B12
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5602543
MaRDI profile type: Publication
full work available at URL: s00355-009-0375-7
OpenAlex ID: W2046313052
cites work: Voting paradoxes and digraphs realizations
cites work: A necessary but insufficient condition for the stochastic binary choice problem
cites work: Tournament solutions and majority voting
cites work: On \(\lambda\)-majority voting paradoxes
cites work: Choosing from a tournament
cites work: Q3993509
cites work: Scoring of web pages and tournaments-axiomatizations
DOI: 10.1007/S00355-009-0375-7
description: scientific article; zbMATH DE number 5602543