We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders' independent signals. The optimal mechanism exhibits either neutral selection, wherein the object is randomly allocated at a price that all bidders are...

We study multiple-unit asymmetric procurement auctions wherein sellers from two classes draw costs from dierent distributions. When sellers are asymmetric, a cost-minimizing buyer discriminates among classes of sellers to enhance competition [1]. Establishing a quota|a limit on the number of...

For a repeated procurement problem, we compare two stylized negotiating cultures which differ in how the buyer uses an entrant to exert pressure on the incumbent resembling U.S. style and Japanese style procurement. In each period, the suppliers are privately informed about their production...

We consider the problem of mechanism design by a principal who has private information. We point out a simple condition under which the privacy of the principal's information is irrelevant in the sense that the mechanism implemented by the principal coincides with the mechanism that would be...