We consider an environment with a single divisible good and two bidders. The valuations of the bidders are private information but one bidder has a commonly known budget constraint. For this environment we derive the revenue maximizing subsidy free incentive compatible auction. We also examine...

We examine the problem of allocating a resource repeatedly over time amongst a set of agents. The utility that each agent derives from consumption of the item is private information to that agent and, prior to consumption may be unknown to that agent. The problem is motivated by keyword...

Government procurement and allocation programs often use subsidies and setasides favoring small businesses and other target groups to address fairness concerns. These concerns are in addition to standard objectives such as efficiency and revenue. We study the design of the optimal mechanism for...