In mechanism design problems under incomplete information, it is generally difficult to find decision problems that are first best implementable. A decision problem under incomplete information is first best implementable if there exists a mechanism that extracts the private information and...

In this paper we analyze sequencing situations under incomplete information where agents have interdependent costs. We first argue why Vickrey-Clarke-Groves (or VCG) mechanism fails to implement a simple sequencing problem in dominant strategies. Given this impossibility, we try to implement...

In this paper we analyze sequencing situations under incomplete information where agents have interdependent costs. We first argue why Vickrey-Clarke-Groves (or VCG) mechanism fails to implement a simple sequencing problem in dominant strategies. Given this impossibility, we try to implement...

In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that...

In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that...

We report an experiment that uses the strategy method (Selten 1967) to elicit subjects' general strategy for playing any 2-person 3x3-game with integer payoffs between 0 and 99. Each two subjects' strategies play 500000 games in each of the 5 tournaments. For games with pure strategy equilibria...

We report an experiment that uses the strategy method (Selten 1967) to elicit subjects' general strategy for playing any 2-person 3x3-game with integer payoffs between 0 and 99. Each two subjects' strategies play 500000 games in each of the 5 tournaments. For games with pure strategy equilibria...

We present a common value mechanism design model for an informed principal where only the principal has private information, but her one-dimensional private information is allowed to be distributed according to any probability measure. For this model we characterize the set of pure-strategy...

We consider the situation where the owner of some good wants to sell the good to one of several potential buyers. We assume that the owner possesses private information about the buyers' valuations of the good, and analyze this model as an informed principal mechanism design model. In an...

The standard state-spaces of asymmetric information preclude non- trivial forms of unawareness (Dekel, Lipman and Rustichini, 1998). We introduce a generalized state-space model that allows for non-trivial unawareness among several individuals, and which satisfies strong properties of knowledge...