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 analyze an independent private values model where a number of objects are sold in sequential first- and second-price auctions. Bidders have unit demand and their valuation for an object is decreasing in the rank number of the auction in which it is sold. We derive efficient equilibria if...

We experimentally compare two partnership dissolution mechanisms, the widely-used buy–sell clause and the winner’s bid auction. While standard theory does well in organizing many laboratory patterns, it does not easily capture that many subjects bid valuations, especially in the buy–sell...

We investigate if and how revenue-maximizing auctioneers restrict combinatorial bidding in the presence of auctioneer competition. Two sellers offer the same set of two heterogeneous items to six bidders in a VCG mechanism. Each bidder desires either the first item, the second item, or the...