We consider online allocation problems with concave revenue functions and resource
constraints, which are central problems in revenue management and online advertising. In …

The field of optimal mechanism design enjoys a beautiful and well-developed theory, as well
as several killer applications. Rules of thumb produced by the field influence everything from …

Abstract The 2020 Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred
Nobel was awarded to Paul R. Milgrom and Robert B. Wilson for “improvements to auction …

We initiate the study of computing (near-) optimal contracts in succinctly representable
principal-agent settings. Here optimality means maximizing the principal's expected payoff …

We consider the sample complexity of revenue maximization for multiple bidders in
unrestricted multi-dimensional settings. Specifically, we study the standard model of additive …

A Bernoulli factory is a randomness manipulation routine that takes as input a Bernoulli
random variable, outputting another Bernoulli variable whose bias is a function of the input …

Designing an incentive compatible auction that maximizes expected revenue is a central
problem in Auction Design. While theoretical approaches to the problem have hit some …

In several applications of real-time matching of demand to supply in online marketplaces,
the platform allows for some latency to batch the demand and improve the efficiency of the …

We give a fast algorithm for sampling uniform solutions of general constraint satisfaction
problems (CSPs) in a local lemma regime. Ihe expected running time of our algorithm is …

Let Φ be a random k-CNF formula on n variables and m clauses, where each clause is a
disjunction of k literals chosen independently and uniformly. Our goal is, for most Φ, to …