About: Implicit utilitarian voting     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, 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%2FImplicit_utilitarian_voting&invfp=IFP_OFF&sas=SAME_AS_OFF

Implicit utilitarian voting (IUV) is a voting system in which the agents express their preferences by ranking the alternatives (like in ranked voting), and the system tries to select an alternative which maximizes the sum of utilities, as in the utilitarian social choice rule and utilitarian voting. Since a voting-rule that can only access the rankings cannot find the max-sum alternative in all cases, IUV aims to find a voting-rule that approximates the max-sum alternative. The quality of an approximation can be measured in several ways. Some achievements in the theory of IUV are:

AttributesValues
rdfs:label
  • Implicit utilitarian voting (en)
rdfs:comment
  • Implicit utilitarian voting (IUV) is a voting system in which the agents express their preferences by ranking the alternatives (like in ranked voting), and the system tries to select an alternative which maximizes the sum of utilities, as in the utilitarian social choice rule and utilitarian voting. Since a voting-rule that can only access the rankings cannot find the max-sum alternative in all cases, IUV aims to find a voting-rule that approximates the max-sum alternative. The quality of an approximation can be measured in several ways. Some achievements in the theory of IUV are: (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Implicit utilitarian voting (IUV) is a voting system in which the agents express their preferences by ranking the alternatives (like in ranked voting), and the system tries to select an alternative which maximizes the sum of utilities, as in the utilitarian social choice rule and utilitarian voting. The main challenge in IUV is that the rankings do not contain sufficient information to calculate the utilities. For example, if Alice ranks option 1 above option 2, we do not know whether Alice's utility from option 1 is much higher than from option 2, or only slightly higher. So if Bob ranks option 2 above option 1, we cannot know which of the two options maximizes the sum of utilities. Since a voting-rule that can only access the rankings cannot find the max-sum alternative in all cases, IUV aims to find a voting-rule that approximates the max-sum alternative. The quality of an approximation can be measured in several ways. 1. * The distortion of a voting-rule is the worst-case (over utility functions consistent with the reported profile of rankings) ratio between the maximum utility-sum and the utility-sum of the alternative selected by the rule. 2. * The regret of a voting-rule is the worst-case (over utility functions consistent with the reported profile of rankings) difference between the maximum utility-sum and the utility-sum of the alternative selected by the rule. Some achievements in the theory of IUV are: * Analyzing the distortion of various existing voting rules; * Designing voting rules that minimize the distortion in single-winner elections and in multi-winner elections; * Analyzing the distortion of various input formats for Preference elicitation in participatory budgeting. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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