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 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 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...

This paper analyzes the sequential admissions procedure for medical subjects at public universities in Germany. Complete information equilibrium outcomes are shown to be characterized by a \emph{stability} condition that is adapted to the \emph{institutional constraints} of the German system. I...

Ostrovsky [10] develops a theory of stability for a model of matching in exogenously given networks. For this model a generalization of pairwise stability, chain stability, can always be satisfied as long as agents’ preferences satisfy same side substitutability and cross side complementarity....

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...

Steady state equilibria in heterogeneous agent matching models with search frictions have been shown to exist in Shimer and Smith (2000) under the assumption of a quadratic search technology. We extend their analysis to the commonly investigated linear search technology.

We develop a model of assignment games with pairwise-identity-dependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

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 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...