On the robustness of anchoring effects in WTP and WTA experiments

We reexamine the effects of the anchoring manipulation of Ariely, Loewenstein, and Prelec (2003) on the evaluation of common market goods and find very weak anchoring effects. We perform the same manipulation on the evaluation of binary lotteries, and find no anchoring effects at all. This suggests limits on the robustness of anchoring effects

Preemption, Leapfrogging, and Competition in Patent Races

This paper investigates when patent races will be characterized by vigorous competition and when they will degenerate into a monopoly. Under some conditions, a firm with an arbitrarily small headstart can preempt its rivals. Such 'e-preemption' is shown to depend on whether a firm that is behind in the patent race, as measured by the expected time remaining until discovery, can't 'leapfrog' the competition and become the new leader. An example of an R and D game with random discovery illustrates how e-preemption can occur when leapfrogging is impossible. A multi-stage R and D process allows leapfrogging and thus permits competition. A similar conclusion emerges in a model of a deterministic patent race with imperfect monitoring of rival firms' R and D investment activities

The effects of entry on incumbent innovation and productivity

How does firm entry affect innovation incentives in incumbent firms? Microdata suggest that there is heterogeneity across industries. Specifically, incumbent productivity growth and patenting is positively correlated with lagged greenfield foreign firm entry in technologically advanced industries, but not in laggard industries. In this paper we provide evidence that these correlations arise from a causal effect predicted by Schumpeterian growth theory—the threat of technologically advanced entry spurs innovation incentives in sectors close to the technology frontier, where successful innovation allows incumbents to survive the threat, but discourages innovation in laggard sectors, where the threat reduces incumbents' expected rents from innovating. We find that the empirical patterns hold using rich micro panel data for the United Kingdom. We control for the endogeneity of entry by exploiting major European and U.K. policy reforms, and allow for endogeneity of additional factors. We complement the analysis for foreign entry with evidence for domestic entry and entry through imports

History of chromosome rearrangements reflects the spatial organization of yeast chromosomes

Three-dimensional (3D) organization of genomes affects critical cellular processes such as transcription, replication, and deoxyribo nucleic acid (DNA) repair. While previous studies have investigated the natural role, the 3D organization plays in limiting a possible set of genomic rearrangements following DNA repair, the influence of specific organizational principles on this process, particularly over longer evolutionary time scales, remains relatively unexplored. In budding yeast S.cerevisiae, chromosomes are organized into a Rabl-like configuration, with clustered centromeres and telomeres tethered to the nuclear periphery. Hi-C data for S.cerevisiae show that a consequence of this Rabl-like organization is that regions equally distant from centromeres are more frequently in contact with each other, between arms of both the same and different chromosomes. Here, we detect rearrangement events in Saccharomyces species using an automatic approach, and observe increased rearrangement frequency between regions with higher contact frequencies. Together, our results underscore how specific principles of 3D chromosomal organization can influence evolutionary events.National Institutes of Health (U.S.) (Grant GM114190

Hidden breakpoints in genome alignments

During the course of evolution, an organism's genome can undergo changes that affect the large-scale structure of the genome. These changes include gene gain, loss, duplication, chromosome fusion, fission, and rearrangement. When gene gain and loss occurs in addition to other types of rearrangement, breakpoints of rearrangement can exist that are only detectable by comparison of three or more genomes. An arbitrarily large number of these "hidden" breakpoints can exist among genomes that exhibit no rearrangements in pairwise comparisons. We present an extension of the multichromosomal breakpoint median problem to genomes that have undergone gene gain and loss. We then demonstrate that the median distance among three genomes can be used to calculate a lower bound on the number of hidden breakpoints present. We provide an implementation of this calculation including the median distance, along with some practical improvements on the time complexity of the underlying algorithm. We apply our approach to measure the abundance of hidden breakpoints in simulated data sets under a wide range of evolutionary scenarios. We demonstrate that in simulations the hidden breakpoint counts depend strongly on relative rates of inversion and gene gain/loss. Finally we apply current multiple genome aligners to the simulated genomes, and show that all aligners introduce a high degree of error in hidden breakpoint counts, and that this error grows with evolutionary distance in the simulation. Our results suggest that hidden breakpoint error may be pervasive in genome alignments.Comment: 13 pages, 4 figure

Statistics of Partial Minima

Motivated by multi-objective optimization, we study extrema of a set of N points independently distributed inside the d-dimensional hypercube. A point in this set is k-dominated by another point when at least k of its coordinates are larger, and is a k-minimum if it is not k-dominated by any other point. We obtain statistical properties of these partial minima using exact probabilistic methods and heuristic scaling techniques. The average number of partial minima, A, decays algebraically with the total number of points, A ~ N^{-(d-k)/k}, when 1<=k<d. Interestingly, there are k-1 distinct scaling laws characterizing the largest coordinates as the distribution P(y_j) of the jth largest coordinate, y_j, decays algebraically, P(y_j) ~ (y_j)^{-alpha_j-1}, with alpha_j=j(d-k)/(k-j) for 1<=j<=k-1. The average number of partial minima grows logarithmically, A ~ [1/(d-1)!](ln N)^{d-1}, when k=d. The full distribution of the number of minima is obtained in closed form in two-dimensions.Comment: 6 pages, 1 figur