Optimal, Truthful, and Private Securities Lending

We consider a fundamental dynamic allocation problem motivated by the problem of textitsecurities lending in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource to n clients, each of whom has a private demand that is unknown to the lender. The lender would like to maximize the usage of the resource mbox--- avoiding allocating more to a client than her true demand mbox--- but is constrained to sell the resource at a pre-specified price per unit, and thus cannot use prices to incentivize truthful reporting. We first show that the Bayesian optimal algorithm for the one-shot problem mbox--- which maximizes the resource's expected usage according to the posterior expectation of demand, given reports mbox--- actually incentivizes truthful reporting as a dominant strategy. Because true demands in the securities lending problem are often sensitive information that the client would like to hide from competitors, we then consider the problem under the additional desideratum of (joint) differential privacy. We give an algorithm, based on simple dynamics for computing market equilibria, that is simultaneously private, approximately optimal, and approximately dominant-strategy truthful. Finally, we leverage this private algorithm to construct an approximately truthful, optimal mechanism for the extensive form multi-round auction where the lender does not have access to the true joint distributions between clients' requests and demands.