Schwartz set

Schwartz set

In voting systems, the Schwartz set is the union of all Schwartz set components. A Schwartz set component is any non-empty set "S" of candidates such that
# Every candidate inside the set "S" is pairwise unbeaten by any candidate outside "S"; and
# No non-empty proper subset of "S" fulfills the first property.

A set of candidates that meets the first requirement is also known as an undominated set.

The Schwartz set provides one standard of optimal choice for an election outcome. Voting systems that always elect a candidate from the Schwartz set pass the Schwartz criterion. The Schwartz set is named for political scientist Thomas Schwartz.

Properties

*The Schwartz set is always non-empty—there is always at least one Schwartz set component.
*Any two distinct Schwartz set components are disjoint.
*If there is a Condorcet winner, it is the only member of the Schwartz set. If there is only one member in the Schwartz set, it is at least a weak Condorcet winner.
*If a Schwartz set component contains only a single candidate, that candidate is a weak Condorcet winner. If a Schwartz set component contains multiple candidates, they are all in a beatpath cycle with each other, a top cycle.
*Any two candidates that are in different Schwartz set components are pairwise tied with each other.

mith set comparison

The Schwartz set is closely related to and is always a subset of the Smith set. The Smith set is larger if and only if a candidate in the Schwartz set has a pairwise tie with a candidate that is not in the Schwartz set.For example, given:
* 3 voters preferring candidate A to B to C
* 1 voter preferring candidate B to C to A
* 1 voter preferring candidate C to A to B
* 1 voter preferring candidate C to B to Athen we have A pairwise beating B, B pairwise beating C, and A tying with C in their pairwise comparison, making A the only member of the Schwartz set, while the Smith set on the other hand consists of all the candidates.

Algorithms

The Schwartz set can be calculated with the Floyd-Warshall algorithm in time Θ("n"3) or with a version of Kosaraju's algorithm in time Θ("n"2).

Complying methods

The Schulze method always chooses from the Schwartz set.

References

*cite journal | author=Ward, Benjamin | title=Majority Rule and Allocation | journal=Journal of Conflict Resolution | year=1961 | volume=5 | pages=379–389 | doi=10.1177/002200276100500405 In an analysis of serial decision making based on majority rule, describes the Smith set and the Schwartz set, but apparently fails to recognize that the Schwartz set can have multiple components.
*cite journal | author=Schwartz, Thomas | title=On the Possibility of Rational Policy Evaluation | journal=Theory and Decision | year=1970 | volume=1 | pages=89–106 | doi=10.1007/BF00132454 Introduces the notion of the Schwartz set at the end of the paper as a possible alternative to maximization, in the presence of cyclic preferences, as a standard of rational choice.
*cite journal | author=Schwartz, Thomas | title=Rationality and the Myth of the Maximum | journal=Noûs | year=1972 | volume=6 | pages=97–117 | doi=10.2307/2216143 Gives an axiomatic characterization and justification of the Schwartz set as a possible standard for optimal, rational collective choice.
*cite journal | author=Deb, Rajat | title=On Schwart's Rule | journal=Journal of Economic Theory | year=1977 | volume=16 | pages=103–110 | doi=10.1016/0022-0531(77)90125-9 Proves that the Schwartz set is the set of undominated elements of the transitive closure of the pairwise preference relation.
*cite book | first=Thomas | last=Schwartz | year=1986 | title=The Logic of Collective Choice | publisher=Columbia University Press | location=New York Discusses the Smith set (named GETCHA) and the Schwartz set (named GOTCHA) as possible standards for optimal, rational collective choice.

ee also

*Smith set
*Condorcet criterion
*Condorcet method
*Preorder
*Partial order

External links

* [http://wiki.electorama.com/wiki/Maximal_elements_algorithms Example algorithms to calculate the Schwartz set]


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Schwartz-Menge — Bei Wahlen ist die Schwartz Menge die Vereinigung aller minimalen undominierten Mengen. Ein minimale undominierte Menge ist eine nicht leere Menge S von Bewerbern, so dass jeder Bewerber innerhalb der Menge S ist paarweise ungeschlagen von jedem… …   Deutsch Wikipedia

  • Schwartz space — In mathematics, Schwartz space is the function space of rapidly decreasing functions. This space has the important property that the Fourier transform is an endomorphism on this space. This property enables one, by duality, to define the Fourier… …   Wikipedia

  • Smith set — In voting systems, the Smith set is the smallest non empty set of candidates in a particular election such that each member beats every other candidate outside the set in a pairwise election. The Smith set provides one standard of optimal choice… …   Wikipedia

  • Zoom schwartz profigliano — or Figliano is a verbal tag game that has many variations. One player at a time is active ( it ). The active player states a command from a predefined set of words, which typically include zoom, schwartz, and profigliano. The command shifts… …   Wikipedia

  • F. A. Schwartz — Das Wassertor am Wassertorplatz 1865 Der Bau der Hallenkonstruktion des Anha …   Deutsch Wikipedia

  • Friedrich Albert Schwartz — Das Wassertor am Wassertorplatz 1865 Der Bau der Hallenkonstruktion des Anha …   Deutsch Wikipedia

  • Cylinder set measure — In mathematics, cylinder set measure (or promeasure, or premeasure, or quasi measure, or CSM) is a kind of prototype for a measure on an infinite dimensional vector space. An example is the Gaussian cylinder set measure on Hilbert space. Cylinder …   Wikipedia

  • Anna Schwartz — Infobox Scientist name = Anna Schwartz image size = caption = birth date = 1915 birth place = death date = death place = residence = nationality = field = Economics work institution = National Bureau of Economic Research occupation = Economist… …   Wikipedia

  • Duggan–Schwartz theorem — The Duggan–Schwartz theorem (named after John Duggan and Thomas Schwartz) is a result about voting systems designed to choose a nonempty set of winners from the preferences of certain individuals, where each individual ranks all candidates in… …   Wikipedia

  • Aloysius Schwartz — Infobox Saint name=Sg Aloysius Schwartz birth date=18 September 1930 death date=16 March 1992 feast day=16 March venerated in=Roman Catholic Church imagesize=150px birth place=Wahington D.C., U.S.A. flagicon|USA death place=Manila, Philippines… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”