1992
DOI: 10.2307/2526982
|View full text |Cite
|
Sign up to set email alerts
|

Efficiency and Mechanisms with no Regret

Abstract: We address the following question: given a domain of asymmetric information economies, is it always possible to design a mechanism so that all of its equilibrium outcomes are either interim individually rational-efficient or interim envy-free-efficient in the domain? We show that if the solution concept were that of Bayesian equilibrium, the answer is no.It is known that in complete information economies such games can always be constructed.Can this gap be filled by "mechanisms with no regret" : games that l… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

1993
1993
2010
2010

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…We leave this question for future work. In asymmetric information domains, the results have been largely negative (Palfrey and Srivastava, 1987;Chakravorti, 1992Chakravorti, , 1993 to begin with. However, given the satisfaction of an incentive compatibility requirement, positive results emerge.…”
Section: Discussionmentioning
confidence: 96%
See 1 more Smart Citation
“…We leave this question for future work. In asymmetric information domains, the results have been largely negative (Palfrey and Srivastava, 1987;Chakravorti, 1992Chakravorti, , 1993 to begin with. However, given the satisfaction of an incentive compatibility requirement, positive results emerge.…”
Section: Discussionmentioning
confidence: 96%
“…We are interested in "global" implementability as in Palfrey and Srivastava (1987) and Chakravorti (1992Chakravorti ( , 1993, i.e. the implementability of ϕ in every planning problem.…”
Section: A U T H O R ' S P E R S O N a L C O P Ymentioning
confidence: 99%
“…41 Variants of this example were developed in Palfrey and Srivastava (1987), Chakravorti (1992) and Serrano and Vohra (2001 …”
Section: Note First That Incentive Compatibility Is Not a Constraint mentioning
confidence: 99%
“…3 However, when one considers multivalued sets, mixed Bayesian monotonicity is more restrictive: it only reduces to Bayesian monotonicity when the set satisfies a convex range property over the set of pure deceptions. It is well-known that Bayesian monotonicity can sometimes be extremely restrictive (e.g., Palfrey and Srivastava, 1987;Chakravorti, 1992), and hence so will be its mixed counterpart. On the other hand, in environments in which Bayesian monotonicity is permissive (e.g., Matsushima, 1993), mixed Bayesian monotonicity will rule out those social choice sets that do not have a convex range.…”
Section: Introductionmentioning
confidence: 99%