Date:

Sun, 21/01/201816:00-17:00

Location:

Elath Hall, 2nd floor, Feldman Building, Edmond Safra Campus

We study the revenue maximizing allocation of m units among n symmetric agents with unit demand that have convex preferences over the probability of receiving an object. Such preferences are naturally induced by a game where the agents take costly actions that affect their values before participating in the mechanism. Both the uniform m+1 price auction and the discriminatory pay-your-bid auction with reserve prices constitute symmetric revenue maximizing mechanisms. Contrasting the case with linear preferences, the optimal reserve price reacts to both demand and supply, i.e., it depends both on the number of objects m and on number of agents n. The main tool in our analysis is an integral inequality involving majorization, super-modularity and convexity due to Fan and Lorentz (1954).