We study the inherent limitations of natural widely-used classes of ascending combinatorial auctions. Specifically, we show that ascending combinatorial auctions that do not use both non-linear prices and personalized prices cannot achieve social efficiency with general bidder valuations. We...

We study a combinatorial variant of the classical principal-agent model. In our setting a principal wishes to incentivize a team of strategic agents to exert costly effort on his behalf. Agentsʼ actions are hidden and the principal observes only the outcome of the team, which depends...

We study environments with m homogenous items and two bidders, where the private information of each bidder consists of a monotone valuation (multi-unit auctions). We analyze ex-post implementable social choice functions where the dominant strategy of a bidder is to reveal his valuation.

We consider dynamic auction mechanisms for the allocation of multiple items. Items are identical, but have different expiration times, and each item must be allocated before it expires. Buyers are of dynamic nature, and arrive and depart over time. Our goal is to design mechanisms that maximize...