Outcomes of the shallow lake interest conflict are presented in a number of different contexts: quasi-static and dynamic social planning, and quasi-static one-shot and repeated non-cooperative play. As the underlying dynamics are non-convex, the analysis uses geometrical-numerical methods: the...

Archimedes once said "give me a fulcrum, and I shall move the world." In this paper, we study the optimal timing of contingently placing a "fulcrum" in the context of crowdfunding, with the potential of tilting the random pledging process from failure to success. Specifically, we consider a...

In this note we present both necessary and sufficient conditions for the existence of a linear static state feedback controller if the system is described by an index one descriptor system. A priori no definiteness restrictions are made w.r.t. the quadratic performance criterium. It is shown...

In this note we consider the cooperative linear quadratic control problem. That is, the problem where a number of players, all facing a (different) linear quadratic control problem, decide to cooperate in order to optimize their performance.It is well-known, in case the performance criteria are...

In this article we address the problem of finding feedback Nash equilibria for linear quadratic differential games defined on descriptor systems. First, we decouple the dynamic and algebraic parts of a descriptor system using canonical projectors. We discuss the effects of feedback on the...

We analyze the problem of time-dependent channel coordination in the face of uncertain demand. The channel, composed of a manufacturer and a retailer, is to address a time-varying and uncertain price-dependent demand. The decision variables of the manufacturer are wholesale and (possibly zero)...

Almost every vendor faces uncertain and time-varying demand. Inventory level and price optimization while catering to stochastic demand are conventionally formulated as variants of newsvendor problem. Despite its ubiquity in potential applications, the time-dependent (multi-period) newsvendor...

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...

We solve the martingale optimal transport problem for cost functionals represented by optimal stopping problems. The measure-valued martingale approach developed in [A. M. G. Cox and S. Kallblad. Model-independent bounds for Asian options: a dynamic programming approach. SIAM Journal on Control...