OpenLink Software

About: Participation constraint (mechanism design)     Permalink

an Entity references as follows:

In game theory, and particularly mechanism design, participation constraints or individual rationality constraints are said to be satisfied if a mechanism leaves all participants at least as well-off as they would have been if they hadn't participated. Unfortunately, it can frequently be shown that participation constraints are incompatible with other desirable properties of mechanisms for many purposes. One kind of participation constraint is the participation criterion for voting systems. It requires that by voting, a voter should not decrease the odds of their preferred candidates winning.

QRcode icon
QRcode image
Graph IRICount
http://dbpedia.org34 triples
Faceted Search & Find service v1.17_git139

Alternative Linked Data Documents: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] This material is Open Knowledge Creative Commons License Valid XHTML + RDFa
This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.
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, 56 GB memory in use)
Copyright © 2009-2024 OpenLink Software