Question

What is the intution in Thomas Sampsons paper from 2016 "DYNAMIC SELECTION: AN IDEA FLOWS THEORY OF
ENTRY, TRADE, AND GROWTH".

Answer 1

Dynamic capabilities enable business enterprises to create, deploy, and protect the intangible assets that support superior long‐ run business performance. The microfoundations of dynamic capabilities—the distinct skills, processes, procedures, organizational structures, decision rules, and disciplines—which undergird enterprise‐level sensing, seizing, and reconfiguring capacities are difficult to develop and deploy. Enterprises with strong dynamic capabilities are intensely entrepreneurial. They not only adapt to business ecosystems, but also shape them through innovation and through collaboration with other enterprises, entities, and institutions. The framework advanced can help scholars understand the foundations of long‐run enterprise success while helping managers delineate relevant strategic considerations and the priorities they must adopt to enhance enterprise performance and escape the zero profit tendency associated with operating in markets open to global competition.

This article develops an idea flows theory of trade and growth with heterogeneous firms. Entrants learn from incumbent firms, and the diffusion technology is such that learning depends not on the frontier technology, but on the entire distribution of productivity. By shifting the productivity distribution upward, selection causes technology diffusion, and in equilibrium this dynamic selection process leads to endogenous growth without scale effects. On the balanced growth path, the productivity distribution is a traveling wave with a lower bound that increases over time. The free entry condition implies trade liberalization must increase the dynamic selection rate to offset the profits from new export opportunities. Consequently, trade integration raises long-run growth. Dynamic selection is a new source of gains from trade not found when firms are homogeneous. Calibrating the model implies dynamic selection approximately triples the gains from trade compared to heterogeneous firm economies with static steady states.

A computer system may be configured to dynamically select a memory virtualization and corresponding virtual-to-physical address translation technique during execution of an application and to dynamically employ the selected technique in place of a current technique without re-initializing the application. The computer system may be configured to determine that a current address translation technique incurs a high overhead for the application's current workload and may be configured to select a different technique dependent on various performance criteria and/or a user policy. Dynamically employing the selected technique may include reorganizing a memory, reorganizing a translation table, allocating a different block of memory to the application, changing a page or segment size, or moving to or from a page-based, segment-based, or function-based address translation technique. A selected translation technique may be dynamically employed for the application independent of a translation technique employed for a different application

We study static and dynamic N-player binary “entry” games with strategic complementarities. ► Entry thresholds should be larger in static rather than dynamic versions of the same entry game. ► Our experiment reveals little difference in entry thresholds between the two types of games. ► The addition of delay costs to the dynamic game does not change this finding. ► Thus the “short-cut” of modeling dynamic entry decisions as static games may not be unreasonable.

a game theoretic framework to study dynamic competition with entry deterrence. Sufficient conditions are given such that the competition process results in the most efficient firm being eventually selected. We show this selection property for asymmetric firms to be the natural economic extension to the rent dissipation property obtained for symmetric firms. This framework is used to discuss previous models in which the selection property had not been studied (dynamic limit pricing and capacity renewal) or may fail to hold (quantity competition

The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when such a disruption occurs. The algorithm is based on column generation techniques combined with Lagrangian heuristics. Since the number of duties is very large in practical instances, we first define a core problem of tractable size. If some tasks remain uncovered in the solution of the core problem, we perform a neighborhood exploration to improve the solution. Computational experiments with real-life instances show that our method is capable of producing good solutions within a couple of minutes of computation time.