We propose a dynamic auction mechanism for efficiently allocating multiple heterogeneous indivisible goods. These goods can be split into two distinct sets so that items in each set are substitutes but complementary to items in the other set. The seller has a reserve value for each bundle of...

We study all-pay contests under incomplete information where the reward is a function of the contestant's type and also of his effort. We analyze the optimal reward for the designer when the reward is either multiplicatively separable or additively separable in effort and type. In the...

Abstract Public procurement data sets usually lack detailed data that are needed to implement existing methods of collusion detection. We design a method to identify and test for bid rigging in procurement auctions using limited information. The method can be applied to limited data sets using...

The present paper analyzes a general class of first-price all-pay auctions where two players have different "bidding technologies" and one bidder has a head start advantage over his/her opponent. Prize values are common knowledge and may be different between the players. Equilibria are...

If bidders are uncertain whether the auctioneer sticks to the announced reserve, some bidders respond by strategic non-participation, speculating that the auctioneer may revoke the reserve. However, the reserve inadvertently signals the auctioneer's type, which drives a unique separating and a...

We study the design of all-pay contests when the organizer's objective is to maximize the expected winner's effort and contestants have private information about their valuations for the prize. We identify sufficient conditions for every optimal contest to involve differential treatment of ex...

In this paper, we examine the optimal mechanism design of selling an indivisible object to one regular buyer and one publicly known buyer, where inter-buyer resale cannot be prohibited. The resale market is modeled as a stochastic ultimatum bargaining game between the two buyers. We fully...

This paper provides a general study of a contest modeled as a multiplayer incomplete-information, all-pay auction with sequential entry. The contest consists of multiple periods. Players arrive and exert efforts sequentially to compete for a prize. They observe the efforts made by their earlier...