Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

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

We study an adverse selection problem in which information that is imperfectly correlated with the agent's type becomes public ex post. Unbounded penalties are ruled out by assuming that the agent is wealth constrained. The following conclusions emerge. If the agent's utility is increasing in...

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 a laboratory experiment, we compare two auction mechanisms that determine the sequence of service to queued customers. In the server-initiated auction, the server, when idle, sells the right to be served next to the highest bidding customer in the queue and distributes the proceeds among the...