In a lab experiment, we analyze the benefits of increasing competition on auction platforms hosting multiple auctioneers of a homogeneous good. We find that increasing competition by merging separated individual auctions increases market efficiency and also buyers' payoffs, while there is no...

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

Combinatorial auctions, in particular core-selecting auctions, have increasingly attracted the attention of academics and practitioners. We experimentally analyze core-selecting auctions under incomplete information and find that they perform better than the Vickrey auction. The proportions of...

We investigate whether revenue-maximizing auctioneers selling heterogeneous items will allow for combinatorial bidding in the presence of auctioneer competition. We compare the choice of auction format by two competing auctioneers with that of a single auctioneer. Bidders are heterogeneous in...