About: Schwartz set

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Schwartz set Goto Sponge NotDistinct Permalink

An Entity of Type : yago:SystemOfMeasurement113577171, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSchwartz_set&invfp=IFP_OFF&sas=SAME_AS_OFF

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 1. * Every candidate inside the set S is pairwise unbeaten by every candidate outside S; and 2. * 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.

Attributes	Values
rdf:type	yago:WikicatVotingSystemCriteria yago:Abstraction100002137 yago:Measure100033615 organisation yago:Standard107260623 yago:SystemOfMeasurement113577171
rdfs:label	Schwartz-Menge (de) Schwartz set (en)
rdfs:comment	Bei Wahlen ist die Schwartz-Menge die Vereinigung aller minimalen undominierten Mengen. Eine minimale undominierte Menge ist eine nicht leere Menge S von Bewerbern, für welche gilt: 1. * Jeder Bewerber innerhalb der Menge S ist paarweise ungeschlagen von jedem Bewerber außerhalb von S (d. h. eine undominierte Menge). 2. * Keine nicht-leere echte Teilmenge von S erfüllt die erste Eigenschaft (d. h. minimal). (de) 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 1. * Every candidate inside the set S is pairwise unbeaten by every candidate outside S; and 2. * 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. (en)
dcterms:subject	Voting theory
Wikipage page ID	273588 (xsd:integer)
Wikipage revision ID	966785567 (xsd:integer)
Link from a Wikipage to another Wikipage	Preorder Proper subset Schulze method Condorcet criterion Condorcet method Statistics Disjoint sets Floyd–Warshall algorithm Voting theory Big O notation Political science Kosaraju's algorithm Union (set theory) Electoral system Partial order Smith set Subset
Link from a Wikipage to an external page	http://wiki.electorama.com/wiki/Maximal_elements_algorithms
sameAs	Schwartz set Schwartz set Schwartz set Schwartz set Schwartz set
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Redirect
has abstract	Bei Wahlen ist die Schwartz-Menge die Vereinigung aller minimalen undominierten Mengen. Eine minimale undominierte Menge ist eine nicht leere Menge S von Bewerbern, für welche gilt: 1. * Jeder Bewerber innerhalb der Menge S ist paarweise ungeschlagen von jedem Bewerber außerhalb von S (d. h. eine undominierte Menge). 2. * Keine nicht-leere echte Teilmenge von S erfüllt die erste Eigenschaft (d. h. minimal). Eine Schwartz-Menge bietet eine Möglichkeit für ein optimales Wahlergebnis. Wahlverfahren, bei denen immer ein Bewerber aus der Schwartz-Menge gewinnt, erfüllen das Schwartz-Kriterium. Die Menge ist nach dem Politikwissenschaftler Thomas Schwartz benannt. (de) 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 1. * Every candidate inside the set S is pairwise unbeaten by every candidate outside S; and 2. * 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. (en)
gold:hypernym	Union
prov:wasDerivedFrom	wikipedia-en:Schwartz_set?oldid=966785567&ns=0
page length (characters) of wiki page	4494 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Schwartz_set
is Link from a Wikipage to another Wikipage of	Participatory budgeting algorithm Schulze method Tideman alternative method Condorcet method Kemeny–Young method Schwartz criterion Smith set Voting criteria Smith criterion
is Wikipage redirect of	Schwartz criterion
is foaf:primaryTopic of	wikipedia-en:Schwartz_set

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 57 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software