Essays on durable goods consumption and firm innovation

This dissertation comprises three individual chapters. Chapter Two examines how free riding across neighbors influenced the diffusion of color television sets in rural China. Chapter Three tests for asymmetric information between a firm’s management and other investors concerning its patent output. Chapter Four discusses how knowledge stocks influence a patenting firm’s later diversification. Chapter Two documents the existence of a type of network effects—free riding across neighbors—in the consumption of color television sets in rural China, which reduces the propensity of non-owners to purchase. I construct a model of the timing of the purchase of a durable good in the presence of free riding, and test its key implications using household survey data in rural China. Chapter Three tests for asymmetric information between a firm’s management and other investors about its patent output by examining insider trading patterns and stock price changes in R&D intensive firms. It demonstrates that management has considerable information about its patent output beyond what is known to investors. It also shows that the predictive power of insider trading patterns on patent output comes from purchases rather than sales. Chapter Four discusses two sequential channels through which knowledge stocks may influence a firm’s later diversification. One is that firms with more knowledge are more likely to enter a new industry. The other is that firms’ businesses have a better chance of surviving, conditional on being formed. By examining U.S. public patenting firms in manufacturing sectors for 1984-1996, I find that knowledge stocks predict the likelihood of new industry entry when controlling for firm size. However, this predictive power is weakened when diversification effects are included. On the other hand, a survival study of newly established segments shows that initial knowledge stocks have significant positive effects on segment survival, whereas diversification effects are insignificant.

Foundations of quantitative information flow: Channels, cascades, and the information order

Secrecy is fundamental to computer security, but real systems often cannot avoid leaking some secret information. For this reason, the past decade has seen growing interest in quantitative theories of information flow that allow us to quantify the information being leaked. Within these theories, the system is modeled as an information-theoretic channel that specifies the probability of each output, given each input. Given a prior distribution on those inputs, entropy-like measures quantify the amount of information leakage caused by the channel. ^ This thesis presents new results in the theory of min-entropy leakage. First, we study the perspective of secrecy as a resource that is gradually consumed by a system. We explore this intuition through various models of min-entropy consumption. Next, we consider several composition operators that allow smaller systems to be combined into larger systems, and explore the extent to which the leakage of a combined system is constrained by the leakage of its constituents. Most significantly, we prove upper bounds on the leakage of a cascade of two channels, where the output of the first channel is used as input to the second. In addition, we show how to decompose a channel into a cascade of channels. ^ We also establish fundamental new results about the recently-proposed g-leakage family of measures. These results further highlight the significance of channel cascading. We prove that whenever channel A is composition refined by channel B, that is, whenever A is the cascade of B and R for some channel R, the leakage of A never exceeds that of B, regardless of the prior distribution or leakage measure (Shannon leakage, guessing entropy leakage, min-entropy leakage, or g-leakage). Moreover, we show that composition refinement is a partial order if we quotient away channel structure that is redundant with respect to leakage alone. These results are strengthened by the proof that composition refinement is the only way for one channel to never leak more than another with respect to g-leakage. Therefore, composition refinement robustly answers the question of when a channel is always at least as secure as another from a leakage point of view.^