# Questions tagged [dynamic-programming]

The tag has no usage guidance.

64 questions
Filter by
Sorted by
Tagged with
17 views

73 views

202 views

### What is state space representation for DSGE modeling

I'm beginning with DSGE modeling, and a mathematical representation (perhaps trivial for most of the people that are more with this topic) is the space-state state representation of a dynamical model, ...
65 views

### Optimization in discrete time

I have made optimizations in continuous time that belong to the control theory, for example one case: $\max(\min)V[u(t)]=\int_0^Tf(t,x(t),u(t))dt$ constraint to: $\dot x=g(t,x(t),u(t))$ Where: $x(t)$: ...
53 views

### Can anyone help me understand the Motrtensen-Pissarides model?

I am seeking help with the Mortensen-Pissarides model in discrete time? Basically, I was given the following in class example (which we didn’t complete do to time constraints associated with the end ...
184 views

318 views

### In Blackwell's condition for T to be a contraction mapping, we require that satisfies discounting. What is the intuition of discounting?

The discounting condition is as follow: There exists some $\beta \in (0, 1)$ such that $[T(f + a)](x) ≤ (T f)(x) + βa$, for all $f ∈ B(X), a ≥ 0, x ∈ X$. While the monotonicity condition makes sense,...
226 views

722 views

75 views

### Hamilton-Jacobi-Bellman with heterogeneous discount rates

Let $i=1,2$ denote the players, $x$ the state and $u_i$ the control of player $i$. The state equation reads $\dot x = f(x,u_1,u_2)$ and the objective function is given by $F_i(x,u_1,u_2)$. Now I'd ...
134 views

### Dynamic programming problem with dimension over 1000

I am working on a project which need to solve a dynamic programming problem with dimension over 1000. In past literature, there exist several methods like Smolyak algorithm and Sparse grid method that ...
775 views

### Solution Method for Infinite-Horizon Maximization Problem

Full disclosure: this problem was part of a final exam that none of our class could really solve definitively. Below the general form is a specific utility function we worked with that I'll try to ...
When solving (numerically, by value function iteration) a dynamic programming problem in discrete time, such as $$V_1(a) = \max_{c} \ u(c) + \dfrac{1}{1+\rho}V_0(a')$$ we maximize with respect to ...
Here we have two agents who can spend their time doing some group activity ($h$) or staying at home ($l$). Each agent $i$ is trying to maximize their respective dynamic programming problem: \begin{...