In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believe the portions are equally split. Moreover, the division takes at most n cuts, which is best possible. This extends...

In this paper we present a method for using rational expectations in a linear-quadratic optimizationframework. Following the approach put forward by Sims, we solve the model through a QZdecomposition, which is generally easier to implement than the more widely used method of Blanchardand Kahn.

This article presents an algorithm that extends Ljungqvist and Sargent's (2012) dynamic Stackelberg game to the case of dynamic stochastic general equilibrium models including forcing variables. Its first step is the solution of the discounted augmented linear quadratic regulator as in Hansen...

We bring together the theories of duality and dynamic programming. We show that the dual of a separable dynamic optimization problem can be recursively decomposed. We provide a dual version of the principle of optimality and give conditions under which the dual Bellman operator is a contraction...

The linear-quadratic (LQ) optimization is a close to standard technique in the optimal control framework. LQ is very well researched and there are many extensions for more sophisticated scenarios like nonlinear models. Usually, the quadratic objective function is taken as a prerequisite for...

Policy makers constantly face optimal control problems: what controls allow to achieve certain targets in, e.g., GDP growth or inflation? Conventionally this is done by applying certain linear-quadratic optimization algorithms to dynamic econometric models. Several algorithms extend this...