2002
DOI: 10.1016/s0165-4896(01)00095-6
|View full text |Cite
|
Sign up to set email alerts
|

Nash consistent representation of constitutions: a reaction to the Gibbard paradox

Abstract: People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the author… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2002
2002
2017
2017

Publication Types

Select...
4
2

Relationship

3
3

Authors

Journals

citations
Cited by 14 publications
(26 citation statements)
references
References 17 publications
0
26
0
Order By: Relevance
“…It is clear that if x ε ∩{B(h): h ε N}, then x satisfies (14) for R N. . Hence, we have proved one direction of the following important theorem, due to Peleg, Peters, and Storcken [20]. Theorem 8.…”
Section: Theoremmentioning
confidence: 92%
“…It is clear that if x ε ∩{B(h): h ε N}, then x satisfies (14) for R N. . Hence, we have proved one direction of the following important theorem, due to Peleg, Peters, and Storcken [20]. Theorem 8.…”
Section: Theoremmentioning
confidence: 92%
“…In the case n = 2 this condition is equivalent to at least one of the two players being a so-called singleton player: a singleton player is a player for whom all minimal sets for which this player is effective, are singletons. We also show that, if only one of the players has more than one type, then ex post Nash consistency imposes no additional restrictions compared to Nash consistency (as in Peleg et al 2002). In the final part of the paper we provide a short discussion on effectivity functions that have no ex post Nash consistent representation, but for which a representation exists if we restrict the number of types-a special case being the mentioned one where only one player has more than one type.…”
Section: Introductionmentioning
confidence: 87%
“…Specifically, if T = {T } with |T i | = 1 for every i ∈ N , then an ex post consistent game form is Nash consistent (cf. Peleg et al 2002). We say that effectivity function E has an ex post consistent representation for a collection T of information structures if there exists a game form such that is a representation of E and is ex post consistent for T .…”
Section: (S) So B Is Not Minimal In E(s)mentioning
confidence: 99%
See 2 more Smart Citations