We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that...

Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004: We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a...

Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a...

We analyze the possibility of efficient trade with informationally interdependent valuations and with a dispersed ownership. A crucial role is played by the sign of the derivatives that measure how valuation functions depend on others’ signals. If valuations are increasing functions of other...

We study the possibility of efficient trade with informationally interdependent valuations. In a model based on the bilateral trade situation studied in Myerson and Satterthwaite (1983) efficient trade is only possible in trivial cases where the seller's valuation always exceeds the buyer's...

We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing time. They make bids upon arrival at a queue whose length is unobservable. We consider two bidding schemes that...