Participation constraint (mechanism design)
 | This article needs additional citations for verification. (March 2024) |
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.[1]
In terms of information structure, there are 3 types of Participation Constraints:[1]
1. Ex-post, this is the strongest form. Assuming every player knows all others' types and its own type, it makes the decision to participate the game.
2. Interim, this is in the middle. Assuming every player only knows its own type, it decides to participate the game given that its expected utility is greater than its outside option.
3. Ex-ante, this the weakest form. Assuming every player have no knowledge for neither others and itself, the player decide to participate based on the prior distribution of the players type (and then calculate its expected utility).
Unfortunately, it can frequently be shown that participation constraints are incompatible with other desirable properties of mechanisms for many purposes. One of the classic result is Gibbard-Satterthwaite Theorem.[2]
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.
See also
[edit]References
[edit]- ^ a b Jackson, Matthew O. (2014). "Mechanism Theory". SSRN Electronic Journal. doi:10.2139/ssrn.2542983. ISSN 1556-5068.
- ^ Gibbard, Allan (1973). "Manipulation of Voting Schemes: A General Result". Econometrica. 41 (4): 587–601. doi:10.2307/1914083. ISSN 0012-9682. JSTOR 1914083.
 | This game theory article is a stub. You can help Wikipedia by expanding it. |