Using a discrete version of the Ramsey Vintage Capital Model, we provide a characterization of the initial capital stocks compatible with a predefined scrapping time and a level of technical progress which generate feasible capital paths. From that characterization, it is proved that for a given...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization. Quantum annealers attempt to solve an NP-hard problem by starting in a quantum superposition of all...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization. Quantum annealers attempt to solve an NP-hard problem by starting in a quantum superposition of all...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization. Quantum annealers attempt to solve an NP-hard problem by starting in a quantum superposition of all...

We show that the equivalence between certain problems of singular stochastic control (SSC) and related questions of optimal stopping known for convex performance criteria (see, for example, Karatzas and Shreve (1984)) continues to hold in a non convex problem provided a related discretionary...