We construct an elementary mechanism (Dutta, Sen and Vohra (1995)) that Nash implements the Constrained Walrasian correspondence. We extend it to incomplete and non-exclusive information economies by enlarging the message space of agents. We characterize the set of Bayesian equilibrium outcomes of the mechanism, and thus characterize an extension of the Constrained Walrasian correspondence when one switches from complete to incomplete information. First, measurability restrictions on allocations do not emerge from the strategic behavior of agents: there exist simple economies for which the set of Constrained Rational Expectations equilibrium allocations is not contained in the set of equilibrium outcomes of the mechanism. Next, by imposing ...
In this thesis, two most fundamental problems in economic theory, namely the existence and the optim...
This paper consideres the problem of designing better mechanisms whose Nash allocations coincide wit...
We relax the assumption that priors are common knowledge, in the stan-dard model of games of incompl...
ABSTRACT:We construct an elementary mechanism (Dutta-Sen-Vohra (1995)) that Nash implements the Cons...
Using an implementation approach, we investigate the connec-tions between Walrasian and Rational Exp...
A game of incomplete information can be decomposed into a basic game and an information structure. T...
I consider the implementation problem under complete information and employ Nash equilibrium as a so...
The field of algorithmic mechanism design is concerned with the design of computationally efficient ...
We are the first to introduce incomplete information to centralized many-to-one matching markets suc...
This paper shows that all perfect Bayesian equilibria of a dynamic matching game with two-sided inco...
We consider a variant of the Tullock lottery contest. Each player’s constant marginal cost of effort...
In this paper, we analyze the problem of designing incentive compatible mechanisms in pure exchange ...
Bayesian equilibrium constitutes the prevailing solution concept for games with incomplete informati...
Studying games in the complete information model makes them analytically tractable. How-ever, large ...
A game of incomplete information can be decomposed into a basic game and an information structure. T...
In this thesis, two most fundamental problems in economic theory, namely the existence and the optim...
This paper consideres the problem of designing better mechanisms whose Nash allocations coincide wit...
We relax the assumption that priors are common knowledge, in the stan-dard model of games of incompl...
ABSTRACT:We construct an elementary mechanism (Dutta-Sen-Vohra (1995)) that Nash implements the Cons...
Using an implementation approach, we investigate the connec-tions between Walrasian and Rational Exp...
A game of incomplete information can be decomposed into a basic game and an information structure. T...
I consider the implementation problem under complete information and employ Nash equilibrium as a so...
The field of algorithmic mechanism design is concerned with the design of computationally efficient ...
We are the first to introduce incomplete information to centralized many-to-one matching markets suc...
This paper shows that all perfect Bayesian equilibria of a dynamic matching game with two-sided inco...
We consider a variant of the Tullock lottery contest. Each player’s constant marginal cost of effort...
In this paper, we analyze the problem of designing incentive compatible mechanisms in pure exchange ...
Bayesian equilibrium constitutes the prevailing solution concept for games with incomplete informati...
Studying games in the complete information model makes them analytically tractable. How-ever, large ...
A game of incomplete information can be decomposed into a basic game and an information structure. T...
In this thesis, two most fundamental problems in economic theory, namely the existence and the optim...
This paper consideres the problem of designing better mechanisms whose Nash allocations coincide wit...
We relax the assumption that priors are common knowledge, in the stan-dard model of games of incompl...