We introduce a simple model of dynamic matching in networked markets, where agents arrive and depart stochastically, and the composition of the trade network depends endogenously on the matching algorithm. Varying the timing properties of matching algorithms can substantially affect their...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

I study the properties of optimal long-term contracts in an environment in which the agent.s type evolves stochastically over time. The model stylizes a buyer-seller relationship but the results apply quite naturally to many contractual situations including regulation and optimal...

We study relative performance of stochastic and deterministic mechanisms in a principal-agent model with hidden information and no monetary transfers. We present an example in which stochastic mechanisms perform strictly better than deterministic ones and can implement any outcome arbitrarily...

I study the properties of optimal long-term contracts in an environment in which the agent's type evolves stochastically over time. The model stylizes a buyer-seller relationship but the results apply quite naturally to many contractual situations including regulation and optimal...