We study the design of revenue-maximizing mechanisms for value-maximizing agents with budget constraints. Agents have return-on-spend constraints requiring a minimum amount of value per unit of payment made and budget constraints limiting their total payments. The agents' only private...

This article studies a principal-agent problem with discrete outcome and effort level spaces. The principal and the agent are risk neutral and the latter is subject to limited liability. We consider the ratio between the first-best social welfare and the social welfare arising from the...

This article studies a principal-agent problem with discrete outcome and effort space. The principal and the agent are risk neutral and the latter is subject to limited liability. For a given monitoring technology, we consider the maximum possible ratio between the first best social welfare to...

Online marketplaces, such as Amazon, Alibaba, or Google Shopping, allow sellers to promote their products by charging them for the right to be displayed on top of organic search results. In this paper, we study the problem of designing auctions for promoted products and highlight some new...

We consider a setting where online advertisers seek to acquire impressions from an advertising exchange through a multi-tier network of intermediaries, and study the mechanisms offered by the ad exchange and intermediaries when the advertisers' values are private. As opposed to traditional...

Many online platforms act as intermediaries between a seller and a set of buyers. Examples of such settings include online retailers (such as Ebay) selling items on behalf of sellers to buyers, or advertising exchanges (such as AdX) selling pageviews on behalf of publishers to advertisers. In...

Motivated by the increased adoption of autobidding algorithms in internet advertising markets, we study the design of optimal mechanisms for selling items to a value-maximizing buyer with a return-on-spend constraint. The buyer's values and target ratio in the return-on-spend constraint are...

Motivated by applications in shared vehicle systems, we study dynamic pricing of resources that relocate over a network of locations. Customers with private willingness-to-pay sequentially request to relocate a resource from one location to another, and a revenue-maximizing service provider sets...

We study the dynamic mechanism design problem of a seller who repeatedly sells independent items to a buyer with private values. In this setting, the seller could potentially extract the entire buyer surplus by running efficient auctions and charging an upfront participation fee at the beginning...