We study identification of combinatorial valuations from aggregate demand. Each utility function takes as arguments subsets or, alternatively, quantities of the multiple goods. We exploit mathematical insights from auction theory to generically identify the distribution of utility functions. In...

We study a seller's optimal mechanism for maximizing revenue when the buyer may present evidence relevant to the buyer's value, or when different types of buyer have a differential ability to communicate. We introduce a dynamic bargaining protocol in which the buyer first makes a sequence of...

We study a variant of a random utility model that takes a probability distribution over preference relations as its primitive. We do not model products using a space of observed characteristics. The distribution of preferences is only partially identified using cross-sectional data on varying...

This paper studies shill bidding in the VCG mechanism applied to combinatorial auctions. Shill bidding is a strategy whereby a single decision-maker enters the auction under the guise of multiple identities (Sakurai, Yokoo, and Matsubara 1999). I formulate the problem of optimal shill bidding...

This paper studies optimal persuasion. A speaker must decide which arguments to present and a listener which arguments to accept. Communication is limited in that the arguments available to the speaker depend on her information. Optimality is assessed from the listener's perspective assuming...

A speaker attempts to persuade a listener to accept a request by presenting evidence. A persuasion rule specifies what evidence is persuasive. This paper compares static and dynamic rules. We present a single linear program (i) whose solution corresponds to the listener's optimal dynamic rule...

We study a seller's optimal mechanism for maximizing revenue when a buyer may present evidence relevant to her value. We show that a condition very close to transparency of buyer segments is necessary and sufficient for the optimal mechanism to be deterministic--hence akin to classic third...

We study the nonparametric identification of distributions of utility functions in a multiple purchase setting with a finite number of consumers. Each utility function takes as arguments subsets or, alternatively, quantities of the multiple goods. We exploit mathematical insights from auction...