When information asymmetries exist between lenders, an uninformed outside bank that competes with an informed inside bank faces a winner’s curse. This paper examines a benchmark model’s prediction for interest rates. Although the outside bank wins more bad firms, the inside bank extracts...

Consider a contest for a prize in which each player knows his/her own ability, but may or may not know those of his/her rivals (the complete or incomplete information regimes). Our main result is that, if the value of the prize is high, more effort and output are engendered under incomplete...

No trade theorems represent a class of results showing that, under certain conditions, trade in asset markets between rational agents cannot be explained on the basis of differences in information alone. They pose a challenge to provide a theoretical justification of the high trade volumes...

We derive several implications of incentive compatibility in general (i.e., not necessarily quasilinear) environments. Building on Kos and Messner (2013), we provide a (partial) characterization of incentive compatible mechanisms.

This paper studies asymmetric first-price menu auctions in the procurement environment where the buyer does not commit to a decision rule and asymmetric sellers have interdependent costs and statistically affiliated signals. Sellers compete in bidding a menu of contracts, where a contract...

In many contests, a subset of contestants is granted preferential treatment which is presumably intended to be advantageous. Examples include affirmative action and biased procurement policies. In this paper, however, I show that some of the supposed beneficiaries may in fact become worse off...

This paper studies the symmetric equilibria of a two-buyer, two-seller model of directed search in which sellers commit to information provision. More informed buyers have better differentiated private valuations and extract higher rents from trade. When sellers cannot commit to sale mechanisms,...

We prove that the maximal bid in asymmetric first-price and all-pay auctions is the same for all bidders. Our proof is elementary, and does not require that bidders are risk neutral, or that the distribution functions of their valuations are independent or smooth.

Every agent reports his willingness to pay for one unit of a good. A mechanism allocates goods and cost shares to some agents. We characterize the group strategyproof (GSP) mechanisms under two alternative continuity conditions interpreted as tie-breaking rules. With the maximalist rule (MAX) an...

This paper describes a nearly optimal auction mechanism that does not require previous knowledge of the distribution of values of potential buyers. The mechanism we propose builds on the new literature on the elicitation of information from experts. We extend the latter to the case where the...