Approximability of Dodgson's rule (Q1024774)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximability of Dodgson's rule	scientific article

Statements

scholarly article

0 references

Approximability of Dodgson's rule (English)

0 references

Geoffrey Pritchard

0 references

John C. McCabe-Dansted

0 references

Arkadii M. Slinko

0 references

Social Choice and Welfare

0 references

publication date

17 June 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00355-007-0282-8

0 references

0 references

Voting schemes for which it can be difficult to tell who won the election

0 references

0 references

0 references

0 references

Exact analysis of Dodgson elections

0 references

Guarantees for the success frequency of an algorithm for finding Dodgson-election winners

0 references

The Dodgson ranking and the Borda count: a binary comparison

0 references

Tournament solutions and majority voting

0 references

A comparison of Dodgson's method and Kemeny's rule

0 references

A comparison of Dodgson's method and the Borda count

0 references

Independence of clones as a criterion for voting rules

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S00355-007-0282-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1024774

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1024774&oldid=38588272"