Philipp Strack Publications

We use the tools of mechanism design combined with the theory of risk measures to analyze how a cash-constrained owner of an asset with known, stochastic returns raises capital from a population of investors who differ in their risk aversion and budget constraints. The issuer partitions the asset's cash flow into several asset-backed securities, one for each type of investor. The optimal partition conforms to the commonly observed practice of tranching into senior debt, junior debt, and equity. Tranching arises endogenously due to the differences in risk appetites among agents and in the budget constraints they face.

We study agents who are more likely to remember some experiences than others but update beliefs as if the experiences they remember are the only ones that occurred. To understand the long-run effects of selective memory, we propose selective-memory equilibrium. We show that if the agent’s behavior converges, their limit strategy is a selective-memory equilibrium, and we provide a sufficient condition for behavior to converge. We use this equilibrium concept to explore the consequences of several well-documented biases. We also show that there is a close connection between selective-memory equilibria and the outcomes of misspecified learning.

A signal is privacy‐preserving with respect to a collection of privacy sets if the posterior probability assigned to every privacy set remains unchanged conditional on any signal realization. We characterize the privacy‐preserving signals for arbitrary state space and arbitrary privacy sets. A signal is privacy‐preserving if and only if it is a garbling of a reordered quantile signal. Furthermore, distributions of posterior means induced by privacy‐preserving signals are exactly mean‐preserving contractions of that induced by the quantile signal. We discuss the economic implications of our characterization for statistical discrimination, the revelation of sensitive information in auctions and price discrimination.

The expectation is an example of a descriptive statistic that is monotone with respect to stochastic dominance, and additive for sums of independent random variables. We provide a complete characterization of such statistics, and explore a number of applications to models of individual and group decision-making. These include a representation of stationary monotone time preferences, extending the work of Fishburn and Rubinstein (1982) to time lotteries. This extension offers a new perspective on risk attitudes toward time, as well as on the aggregation of multiple discount factors. We also offer a novel class of non-expected utility preferences over gambles which satisfy invariance to background risk as well as betweenness, but are versatile enough to capture mixed risk attitudes.

Building on Pomatto, Strack, and Tamuz (2020), we identify a tight condition for when background risk can induce first-order stochastic dominance. Using this condition, we show that under plausible levels of background risk, no theory of choice under risk can simultaneously satisfy the following three economic postulates: (i) decision-makers are risk averse over small gambles, (ii) their preferences respect stochastic dominance, and (iii) they account for background risk. This impossibility result applies to expected utility theory, prospect theory, rank-dependent utility, and many other models.

We study how long-lived, rational agents learn in a social network. In every period, after observing the past actions of his neighbors, each agent receives a private signal, and chooses an action whose payoff depends only on the state. Since equilibrium actions depend on higher-order beliefs, it is difficult to characterize behavior. Nevertheless, we show that regardless of the size and shape of the network, the utility function, and the patience of the agents, the speed of learning in any equilibrium is bounded from above by a constant that only depends on the private signal distribution.

We show that Bayesian posteriors concentrate on the outcome distributions that approximately minimize the Kullback–Leibler divergence from the empirical distribution, uniformly over sample paths, even when the prior does not have full support. This generalizes Diaconis and Freedman's (1990) uniform convergence result to, e.g., priors that have finite support, are constrained by independence assumptions, or have a parametric form that cannot match some probability distributions. The concentration result lets us provide a rate of convergence for Berk's (1966) result on the limiting behavior of posterior beliefs when the prior is misspecified. We provide a bound on approximation errors in “anticipated-utility” models, and extend our analysis to outcomes that are perceived to follow a Markov process.

We study a generalization of the classical monopoly insurance problem under adverse selection (see Stiglitz 1977) where we allow for a random distribution of losses, possibly correlated with the agent's risk parameter that is private information. Our model explains patterns of observed customer behavior and predicts insurance contracts most often observed in practice: these consist of menus of several deductible-premium pairs or menus of insurance with coverage limits–premium pairs. A main departure from the classical insurance literature is obtained here by endowing the agents with risk-averse preferences that can be represented by a dual utility functional (Yaari 1987).

We develop an axiomatic theory of information acquisition that captures the idea of constant marginal costs in information production: the cost of generating two independent signals is the sum of their costs, and generating a signal with probability half costs half its original cost. Together with Blackwell monotonicity and a continuity condition, these axioms determine the cost of a signal up to a vector of parameters. These parameters have a clear economic interpretation and determine the difficulty of distinguishing states.

We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting agents provide by facilitating future matchings. We prove that the trade-off between a “thicker” market and faster matching vanishes in large markets; the greedy policy leads to shorter waiting times and more agents matched than any other policy. We empirically confirm these findings in data from the National Kidney Registry. Greedy matching achieves as many transplants as commonly used policies (1.8% more than monthly batching) and shorter waiting times (16 days faster than monthly batching).

We study auction design for bidders equipped with non-expected utility preferences that exhibit constant risk aversion (CRA). The CRA class is large and includes loss-averse, disappointment-averse, mean-dispersion, and Yaari's dual preferences as well as coherent and convex risk measures. Any preference in this class displays first-order risk aversion, contrasting the standard expected utility case which displays second-order risk aversion. The optimal mechanism offers “ full-insurance” in the sense that each agent’s utility is independent of other agents’ reports. The seller excludes less types than under risk neutrality and awards the object randomly to intermediate types. Subjecting intermediate types to a risky allocation while compensating them when losing allows the seller to collect larger payments from higher types. Relatively high types are willing to pay more, and their allocation is efficient.

We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting agents provide by facilitating future matchings. We prove that the trade-off between a “thicker” market and faster matching vanishes in large markets; the greedy policy leads to shorter waiting times and more agents matched than any other policy. We empirically confirm these findings in data from the National Kidney Registry. Greedy matching achieves as many transplants as commonly used policies (1.8% more than monthly batching) and shorter waiting times (16 days faster than monthly batching).