Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Smith set
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Set preferred to any other by a majority}} {{Electoral systems sidebar|expanded=Paradox}} The '''Smith''' '''set''',{{notetag|Many authors reserve the term "Schwartz set" for the strict Smith set described below.}} sometimes called the '''top-cycle''' or '''Condorcet winning set''',<ref>{{Cite journal |last=Elkind |first=Edith |last2=Lang |first2=Jérôme |last3=Saffidine |first3=Abdallah |date=2015-03-01 |title=Condorcet winning sets |url=https://link.springer.com/article/10.1007/s00355-014-0853-4 |journal=Social Choice and Welfare |language=en |volume=44 |issue=3 |pages=493–517 |doi=10.1007/s00355-014-0853-4 |issn=1432-217X}}</ref> generalizes the idea of a [[Condorcet winner]] to cases where [[Condorcet paradox|no such winner exists]]. It does so by allowing cycles of candidates to be treated jointly, as if they were a single Condorcet winner.<ref>{{cite web|last=Soh|first=Leen-Kiat|title=Voting: Preference Aggregating & Social Choice [CSCE475/875 class handout]|date=2017-10-04|url=http://cse.unl.edu/~lksoh/Classes/CSCE475_875_Fall17/handouts/10VotingSocialChoice.pdf}}</ref> Voting systems that always elect a candidate from the Smith set pass the '''Smith criterion'''. The Smith set and Smith criterion are both named for mathematician [[John H. Smith (mathematician)|John H. Smith]]. The Smith set provides one standard of optimal choice for an election outcome. An alternative, stricter criterion is given by the [[Landau set]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)