This article establishes the Poisson optional stopping times (POST) method by Lange et al. (2020) as a near-universal method for solving liquidity-constrained American options, or, equivalently, penalised optimal-stopping problems. In this setup, the decision maker is permitted to "stop", i.e....

This article establishes the Poisson optional stopping times (POST) method by [22] as a near-universal method for solving liquidity-constrained American options, or, equivalently, penalised optimal-stopping problems. In this setup, the decision maker is permitted to "stop", i.e. exercise the...

We present the first necessary and sufficient conditions for the existence of a unique perfect-foresight solution, returning to a given steady-state, in an otherwise linear model with occasionally binding constraints. We derive further conditions on the existence of a solution in such models,...

We present the first necessary and sufficient conditions for there to be a unique perfect-foresight solution to an otherwise linear dynamic model with occasionally binding constraints, given a fixed terminal condition. We derive further results on the existence of a solution in the presence of...

We present the first necessary and sufficient conditions for the existence of a unique perfect-foresight solution, returning to a given steady-state, in an otherwise linear model with occasionally binding constraints. We derive further conditions on the existence of a solution in such models,...

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the...

We present the first necessary and sufficient conditions for there to be a unique perfect-foresight solution to an otherwise linear dynamic model with occasionally binding constraints, given a fixed terminal condition. We derive further conditions on the existence of a solution in such models....

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the "curse...

We construct the first algorithm for the perfect foresight solution of otherwise linear models with occasionally binding constraints, with fixed terminal conditions, that is guaranteed to return a solution in finite time, if one exists. We also provide a proof of the inescapability of the "curse...