Sustainability in the Stochastic Ramsey Model
In this paper we provide a self-contained exposition of the problem of sustaining a constant consumption level in a Ramsey model. Our focus is on the case in which the output capital-ratio is random. After a brief review of the known results on the probabilities of sustaining a target consumption from an initial stock, we present some new results on estimating the probabilities by using Chebyshev inequalities. Some numerical calculations for these estimates are also provided.
Code (0)
등록된 구현이 없습니다.
Tasks
modelSimilar Papers 제목 키워드 기반
A Simple Algorithm for Solving Ramsey Optimal Policy with Exogenous Forcing Variables
This algorithm extends Ljungqvist and Sargent (2012) algorithm of Stackelberg dynamic game to the case of dynamic stochastic general equilibrium models including exogenous forcing variables. It is based Anderson, Hansen,…
A Novel Paradigm for Calculating Ramsey Number via Artificial Bee Colony Algorithm
The Ramsey number is of vital importance in Ramsey's theorem. This paper proposed a novel methodology for constructing Ramsey graphs about R(3,10), which uses Artificial Bee Colony optimization(ABC) to raise the lower bo…
Solving Graph Coloring Problems with Abstraction and Symmetry
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further evidence that the Ramsey number $R(4,3,3…
RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching
The Ramsey number is the minimum number of nodes, $n = R(s, t)$, such that all undirected simple graphs of order $n$, contain a clique of order $s$, or an independent set of order $t$. This paper explores the application…
Reinforcement Learning (RL)Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
Ramsey-good graphs are graphs that contain neither a clique of size $s$ nor an independent set of size $t$. We study doubly saturated Ramsey-good graphs, defined as Ramsey-good graphs in which the addition or removal of …