DOCSLIB.ORG

Stochastic Control and Dynamic Asset Allocation∗

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Stochastic Control and Dynamic Asset Allocation∗ Stochastic Control and Dynamic Asset Allocation∗ Gon¸calo dos Reis† David Sˇiˇska‡ 4th April 2021 Contents 1 Introduction to stochastic control through examples 4 1.1 Discrete space and time . 4 1.2 Merton’s problem . 5 1.3 Optimal liquidation problem . 8 1.4 Systemic risk - toy model . 10 1.5 Optimal stopping . 11 1.6 Basic elements of a stochastic control problem . 11 1.7 Exercises . 13 1.8 Solutions to Exercises . 15 2 Controlled Markov chains 20 2.1 Problem setting . 20 2.2 Dynamic programming for controlled Markov chains . 20 2.3 Bellman equation for controlled Markov chain . 22 2.4 Q-learning for unknown environments . 23 2.5 Robbins–Monro algorithm . 24 2.6 The Q-learning algorithm . 25 2.7 Exercises . 26 2.8 Solutions to Exercises . 26 3 Stochastic control of diffusion processes 27 3.1 Equations with random drift and diffusion . 27 3.2 Controlled diffusions . 33 3.3 Stochastic control problem with finite time horizon . 34 3.4 Exercises . 36 ∗Lecture notes for academic year 2020/21, School of Mathematics, University of Edinburgh. †[email protected] ‡[email protected] 1 3.5 Solutions to Exercises . 37 4 Dynamic programming and the HJB Equation 39 4.1 Dynamic programming principle . 39 4.2 Hamilton-Jacobi-Bellman (HJB) and verification . 43 4.3 Solving control problems using the HJB equation and verification theorem 47 4.4 Policy Improvement Algorithm . 50 4.5 Exercises . 50 4.6 Solutions to Exercises . 52 5 Pontryagin maximum principle and BSDEs 55 5.1 Non-rigorous Derivation of Pontryagin’s Maximum Principle . 55 5.2 Deriving a Numerical Method from Pontryiagin’s maximum principle . 58 5.3 Backward Stochastic Differential Equations (BSDEs) . 58 5.4 Pontryagin’s Maximum Principle . 63 5.5 Exercises . 71 5.6 Solutions to the exercises . 72 A Appendix 73 A.1 Basic notation and useful review of analysis concepts . 73 A.2 Some useful results from stochastic analysis . 77 A.3 Useful Results from Other Courses . 83 A.4 Solutions to the exercises . 91 References 92 Reading these notes The reader is expected to know basic stochastic analysis and ideally a little bit of financial mathematics. The notation and basic results used throughout the notes are in Appendix A. Section 1 is introduction. Section 2 is a brief introduction to the controlled Markov chains: a discrete space and time setting for stochastic control problems. Section 3 covers basics of stochastic differential equations and is essential reading for what fol- lows. Sections 4 and 5 are basically independent of each other. Exercises You will find a number of exercises throughout these notes. You must make an effort to solve them (individually or with friends). Solutions to some of the exercises will be made available as time goes by but remember: no one ever learned swimming solely by watching other people swim (and similarly 2 no-one ever learned mathematics solely by reading others’ solutions). Other reading It is recommended that you read the relevant chapters of Pham [14, at least Chapters 1-3 and 6] as well as Touzi [18, at least Chapters 1-4 and 9]. Additionally one recommends Krylov [12] for those wishing to see everything done in great generality and with proofs that do not contain any vague arguments but it is not an easy book to read. Chapter 1 however, is very readable and much recommended. Those interested in applications in algorithmic trading should read Cartea, Jaimungal and Penalva [4] and those who would like to learn about mean field games there is Carmona and Delarue [3]. 3 1 Introduction to stochastic control through examples We start with some motivating examples. 1.1 Discrete space and time We start with an optimal stopping example. Example 1.1. A very simple example of an optimal stopping problem is the following: given a fair die we are told that we’re allowed to roll the die for up to three times. After each roll we can either choose to stop the game and our gain is equal to the number currently apearing on the die, or to carry on. If we choose to carry on then we get nothing for this roll and we hope to get more next time. Of course if this is the 3rd time we rolled the die then we have to accept whichever number it is we got in this last roll. In this case solving the problem is a matter of simple calculation, working backward in time. If we’re in the third round then we stop, because we have no choice. In the second round reason as follows: our expected winning in round three is 1 21 (1 + 2 + 3 + 4 + 5 + 6) = = 3.5 . 6 6 So we stop in the second round if we rolled 4, 5 or 6 as that’s more then our expected outcome from continuing. In the first round we reason as follows: our expected winning from continuing into round two are 1 1 21 (4 + 5 + 6) + = 2.5 + 1.75 = 4.25 6 2 6 The first part corresponds to the decision to stop in round two. The second part corresponds to the decision to continue, weighted by the respective probabilities. So in the first round it is optimal to stop if we got 5 or 6. The optimal expected “payoff” 2 for this optimal stopping problem is 4 + 3 . Example 1.2. There is a biased coin with p (0, 1), p = 1 , probability of getting ∈ ∕ 2 heads and q = 1 p probability of getting tails. − We will start with an initial wealth x = iδ, i N with i < m, with some m N fixed ∈ ∈ reasonably large. At each turn we choose an action a 1, 1 . By choosing a = 1 we bet that the ∈ {− } coin comes up heads and our wealth is increased by δ if we are correct, decreased by δ otherwise. By choosing a = 1 we bet on tails and our wealth is updated accordingly. − That is, given that Xn 1 = x and our action a 1, 1 we have − ∈ {− } P(Xn = x + aδ Xn 1 = x, a) = p , P(Xn = x aδ Xn 1 = x, a) = q . | − − | − The game terminates when either x = 0 or x = mδ. Let N = min n N : Xn = { ∈ 0 or X = mδ . Our aim is to maximize n } α α J (x) = E X X0 = x N | ! " over functions α = α(x) telling what action to choose in each given state. 4 1.2 Merton’s problem In this part we give a motivating example to introduce the problem of dynamic asset allocation and stochastic optimization. We will not be particularly rigorous in these calculations. The market Consider an investor can invest in a two asset Black-Scholes market: a risk-free asset (“bank” or “Bond”) with rate of return r > 0 and a risky asset (“stock”) with mean rate of return µ > r and constant volatility σ > 0. Suppose that the price of the risk-free asset at time t, Bt, satisfies dBt rt = r dt or Bt = B0e , t 0. Bt ≥ The price of the stock evolves according to the following SDE: dSt = µ dt + σ dWt, St where (Wt)t 0 is a standard one-dimensional Brownian motion one the filtered prob- ≥ ability space (Ω, , F = ( t)t 0, P). F F ≥ 0 The agent’s wealth process and investments Let Xt denote the investor’s wealth in the bank at time t 0. Let πt denote the wealth in the risky asset. Let 0 ≥ Xt = Xt + πt be the investor’s total wealth. The investor has some initial capital X0 = x > 0 to invest. Moreover, we also assume that the investor saves / consumes wealth at rate C at time t 0. t ≥ There are three popular possibilities to describe the investment in the risky asset: (i) Let ξt denote the number of units stocks held at time t (allow to be fractional and negative), (ii) the value in units of currency πt = ξtSt invested in the risky asset at time t, (iii) the fraction ν = πt of current wealth invested in the risky asset at time t. t Xt 0 The investment in the bond is then determined by the accounting identity Xt = X π . The parametrizations are equivalent as long as we consider only positive t − t wealth processes (which we shall do). The gains/losses from the investment in the stock are then given by πt Xtνt ξt dSt, dSt, dSt . St St The last two ways to describe the investment are especially convenient when the model for S is of the exponential type, as is the Black-Scholes one. Using (ii), t t t πs Xs πs Xt = x + dSs + − dBs Cs ds 0 Ss 0 Bs − 0 # t # # t = x + π (µ r) + rX C ds + π σ dW s − s − s s s #0 #0 $ % 5 or in differential form dX = π (µ r) + rX C dt + π σ dW , X = x . t t − t − t t t 0 $ % Alternatively, using (iii), the equation simplifies even further.1 Recall π = νX. dSt dBt dXt = Xtνt + Xt 1 νt Ct dt St − Bt − = X ν (µ r) +& r 'C dt + X ν σ dW . t t − − t t t t We can make a further s$imp&lification and'obtain% an SDE in “geometric Brownian motion” format if we assume that the consumption Ct can be written as a fraction of the total wealth, i.e. Ct = κtXt. Then dX = X ν (µ r) + r κ dt + X ν σ dW .
Load more

Recommended publications
  • STOCHASTIC CONTROL Contents 1. Introduction 1 2. Mathematical Probability 1 3. Stochastic Calculus 3 4. Diffusions 7 5. the Stoc
    STOCHASTIC CONTROL NAFTALI HARRIS Abstract. In this paper we discuss the Stochastic Control Problem, which deals with the best way to control a stochastic system and has applications in fields as diverse as robotics, finance, and industry. After quickly reviewing mathematical probability and stochastic integration, we prove the Hamilton- Jacobi-Bellman equations for stochastic control, which transform the Stochas- tic Control Problem into a partial differential equation. Contents 1. Introduction 1 2. Mathematical Probability 1 3. Stochastic Calculus 3 4. Diffusions 7 5. The Stochastic Control Problem 11 6. The Hamilton-Jacobi-Bellman Equation 12 7. Acknowledgements 18 References 18 1. Introduction The Stochastic Control Problem arises when we wish to control a continuous- time random system optimally. For example, we wish to fly an airplane through turbulence, or manage a stock portfolio, or precisely maintain the temperature and pressure of a system in the presence of random air currents and temperatures. To build up to a formal definition of this problem, we will first review mathematical probability and stochastic calculus. These will give us the tools to talk about It^o processes and diffusions, which will allow us to state the Stochastic Control Problem formally. Finally, we will spend the latter half of this paper proving necessary conditions and sufficient conditions for its solution. 2. Mathematical Probability In this section we briskly define the mathematical model of probability required in the rest of this paper. We define probability spaces, random variables, and conditional expectation. For more detail, see Williams [4]. Definition 2.1 (Probability Space). A probability space is a triple (Ω; F;P ), where Ω is an arbitrary set, F is a sigma algebra over Ω, and P is a measure on sets in F with P (Ω) = 1.
    [Show full text]
  • MARKOV DECISION PROCESSES Abstract: the Theory of Markov
    July 06, 2010, 15:00 Draft, don’t distribute MARKOV DECISION PROCESSES NICOLE BAUERLE¨ ∗ AND ULRICH RIEDER‡ Abstract: The theory of Markov Decision Processes is the theory of controlled Markov chains. Its origins can be traced back to R. Bellman and L. Shapley in the 1950’s. During the decades of the last century this theory has grown dramatically. It has found applications in various areas like e.g. computer science, engineering, operations research, biology and economics. In this article we give a short intro- duction to parts of this theory. We treat Markov Decision Processes with finite and infinite time horizon where we will restrict the presentation to the so-called (gen- eralized) negative case. Solution algorithms like Howard’s policy improvement and linear programming are also explained. Various examples show the application of the theory. We treat stochastic linear-quadratic control problems, bandit problems and dividend pay-out problems. AMS 2010 Classification: 90C40, 60J05, 93E20 Keywords and Phrases: Markov Decision Process, Markov Chain, Bell- man Equation, Policy Improvement, Linear Programming 1. Introduction Do you want to play a card game? Yes? Then I will tell you how it works. We have a well-shuffled standard 32-card deck which is also known as a piquet deck. 16 cards are red and 16 cards are black. Initially the card deck lies on the table face down. Then I start to remove the cards and you are able to see its faces. Once you have to say ”stop”. If the next card is black you win 10 Euro, if it is red you loose 10 Euro.
    [Show full text]
  • On Some Recent Aspects of Stochastic Control and Their Applications 507
    Probability Surveys Vol. 2 (2005) 506–549 ISSN: 1549-5787 DOI: 10.1214/154957805100000195 On some recent aspects of stochastic control and their applications∗ Huyˆen Pham† Laboratoire de Probabilit´es et Mod`eles Al´eatoires, CNRS, UMR 7599 Universit´eParis 7, e-mail: [email protected], and CREST Abstract: This paper is a survey on some recent aspects and developments in stochastic control. We discuss the two main historical approaches, Bell- man’s optimality principle and Pontryagin’s maximum principle, and their modern exposition with viscosity solutions and backward stochastic differ- ential equations. Some original proofs are presented in a unifying context including degenerate singular control problems. We emphasize key results on characterization of optimal control for diffusion processes, with a view towards applications. Some examples in finance are detailed with their ex- plicit solutions. We also discuss numerical issues and open questions. AMS 2000 subject classifications: 93E20, 49J20, 49L20, 60H30. Keywords and phrases: Controlled diffusions, dynamic programming, maximum principle, viscosity solutions, backward stochastic differential equations, finance. Received December 2005. arXiv:math/0509711v3 [math.PR] 12 Jan 2006 ∗This is an original survey paper †I would like to thank Philip Protter for his encouragement to write this paper. 506 H. Pham/On some recent aspects of stochastic control and their applications 507 Contents 1 Introduction 508 2 Theproblemanddiscussiononmethodology 508 2.1 Problemformulation . 508 2.2 Bellman’s optimality principle . 509 2.2.1 The Hamilton-Jacobi-Bellman (in)equation . 511 2.2.2 Theclassicalverificationapproach . 512 2.3 Pontryagin’s maximum principle . 514 2.4 Othercontrolproblems . 515 2.4.1 Randomhorizon .
    [Show full text]
  • Stochastic Control
    1 Stochastic Control Roger Brockett April 3, 2009 2 PREFACE Teaching stochastic processes to students whose primary interests are in applications has long been a problem. On one hand, the subject can quickly become highly technical and if mathematical concerns are allowed to dominate there may be no time available for exploring the many interesting areas of applications. On the other hand, the treatment of stochastic calculus in a cavalier fashion leaves the student with a feeling of great uncertainty when it comes to exploring new material. Moreover, the problem has become more acute as the power of the differential equation point of view has become more widely appreciated. In these notes, an attempt is made to resolve this dilemma with the needs of those interested in building models and designing algorithms for estimation and control in mind. The approach is to start with Poisson counters and to identify the Wiener process with a certain limiting form. We do not attempt to define the Wiener process per se. Instead, everything is done in terms of limits of jump processes. The Poisson counter and differential equations whose right-hand sides include the differential of Poisson counters are developed first. This leads to the construction of a sample path representations of a continuous time jump process using Poisson counters. This point of view leads to an efficient problem solving technique and permits a unified treatment of time varying and nonlinear problems. More importantly, it provides sound intuition for stochastic differential equations and their uses without allowing the technicalities to dominate. In treating estimation theory, the conditional density equa- tion is given a central role.
    [Show full text]
  • Stochastic Bridges of Linear Systems Yongxin Chen and Tryphon Georgiou
    1 Stochastic bridges of linear systems Yongxin Chen and Tryphon Georgiou Abstract We study a generalization of the Brownian bridge as a stochastic process that models the position and velocity of inertial particles between the two end-points of a time interval. The particles experience random acceleration and are assumed to have known states at the boundary. Thus, the movement of the particles can be modeled as an Ornstein-Uhlenbeck process conditioned on position and velocity measurements at the two end-points. It is shown that optimal stochastic control provides a stochastic differential equation (SDE) that generates such a bridge as a degenerate diffusion process. Generalizations to higher order linear diffusions are considered. I. INTRODUCTION The theoretical foundations on how molecular dynamics affect large scale properties of ensembles were layed down more than a hundred years ago. A most prominent place among mathematical models has been occupied by the Brownian motion which provides a basis for studying diffusion and noise [1], [2], [3], [4]. The Brownian motion is captured by the mathematical model of a Wiener process, herein denoted by w(t). It represents the random motion of particles suspended in a fluid where their inertia is negligible compared to viscous forces. Taking into account inertial effects under a “delta-correlated” stationary Gaussian force field η(t) (that is, white noise, loosely thought of as dw=dt [1, p. 46]) d2x(t) dx(t) m = −λ + η(t) dt2 dt represents the Langevin dynamics ; x represents position, m mass, t time, and λ viscous friction parameter. The corresponding SDE dx(t) 0 1 x(t) 0 = dt + dw(t); dv(t) 0 −λ/m v(t) 1=m where w is a Wiener process and v the velocity, is a degenerate diffusion in that the stochastic term does not affect all degrees of freedom.
    [Show full text]
  • Numerical Methods for Mean Field Games and Mean Field Type Control
    Numerical Methods for Mean Field Games and Mean Field Type Control Mathieu Lauri`ere Abstract. Mean Field Games (MFG) have been introduced to tackle games with a large number of competing players. Considering the limit when the number of players is infinite, Nash equilibria are studied by considering the interaction of a typical player with the population's distribution. The situa- tion in which the players cooperate corresponds to Mean Field Control (MFC) problems, which can also be viewed as optimal control problems driven by a McKean-Vlasov dynamics. These two types of problems have found a wide range of potential applications, for which numerical methods play a key role since most models do not have analytical solutions. In these notes, we review several aspects of numerical methods for MFG and MFC. We start by pre- senting some heuristics in a basic linear-quadratic setting. We then discuss numerical schemes for forward-backward systems of partial differential equa- tions (PDEs), optimization techniques for variational problems driven by a Kolmogorov-Fokker-Planck PDE, an approach based on a monotone operator viewpoint, and stochastic methods relying on machine learning tools. Contents 1. Introduction 2 1.1. Outline 3 1.2. Definition of the problems and notation 3 2. Warm-up: Linear-Quadratic problems 5 2.1. Problem definition and MFG solution 5 2.2. Time discretization 6 2.3. Picard (fixed point) iterations 6 arXiv:2106.06231v1 [math.OC] 11 Jun 2021 2.4. Fictitious play 9 2.5. Newton iterations 10 2.6. Mean Field Type Control and the Price of Anarchy 10 3.
    [Show full text]
  • Markov Chains
    Chapter 1 Markov Chains A sequence of random variables X0,X1,...with values in a countable set S is a Markov chain if at any time n, the future states (or values) Xn+1,Xn+2,... depend on the history X0,...,Xn only through the present state Xn.Markov chains are fundamental stochastic processes that have many diverse applica- tions. This is because a Markov chain represents any dynamical system whose states satisfy the recursion Xn = f(Xn−1,Yn), n ≥ 1, where Y1,Y2 ... are independent and identically distributed (i.i.d.) and f is a deterministic func- tion. That is, the new state Xn is simply a function of the last state and an auxiliary random variable. Such system dynamics are typical of those for queue lengths in call centers, stresses on materials, waiting times in produc- tion and service facilities, inventories in supply chains, parallel-processing software, water levels in dams, insurance funds, stock prices, etc. This chapter begins by describing the basic structure of a Markov chain and how its single-step transition probabilities determine its evolution. For in- stance, what is the probability of reaching a certain state, and how long does it take to reach it? The next and main part of the chapter characterizes the stationary or equilibrium distribution of Markov chains. These distributions are the basis of limiting averages of various cost and performance param- eters associated with Markov chains. Considerable discussion is devoted to branching phenomena, stochastic networks, and time-reversible chains. In- cluded are examples of Markov chains that represent queueing, production systems, inventory control, reliability, and Monte Carlo simulations.
    [Show full text]
  • Applications of Stochastic Optimal Control to Economics and Finance
    A Service of Leibniz-Informationszentrum econstor Wirtschaft Leibniz Information Centre Make Your Publications Visible. zbw for Economics Federico, Salvatore (Ed.); Ferrari, Giorgio (Ed.); Regis, Luca (Ed.) Book — Published Version Applications of stochastic optimal control to economics and finance Provided in Cooperation with: MDPI – Multidisciplinary Digital Publishing Institute, Basel Suggested Citation: Federico, Salvatore (Ed.); Ferrari, Giorgio (Ed.); Regis, Luca (Ed.) (2020) : Applications of stochastic optimal control to economics and finance, ISBN 978-3-03936-059-8, MDPI, Basel, http://dx.doi.org/10.3390/books978-3-03936-059-8 This Version is available at: http://hdl.handle.net/10419/230540 Standard-Nutzungsbedingungen: Terms of use: Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Documents in EconStor may be saved and copied for your Zwecken und zum Privatgebrauch gespeichert und kopiert werden. personal and scholarly purposes. Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle You are not to copy documents for public or commercial Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich purposes, to exhibit the documents publicly, to make them machen, vertreiben oder anderweitig nutzen. publicly available on the internet, or to distribute or otherwise use the documents in public. Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, If the documents have been made available under an Open gelten abweichend von
    [Show full text]
  • Machine Learning, Lecture 5 Kernel Machines
    Outline lecture 5 2(39) Machine Learning, Lecture 5 1. Summary of lecture 4 Kernel Machines 2. Introductory GP example 3. Stochastic processes Thomas Schön 4. Gaussian processes (GP) Division of Automatic Control Construct a GP from a Bayesian linear regression model • GP regression Linköping University • Examples where we have made use of GPs in recent research Linköping, Sweden. • 5. Support vector machines (SVM) Email: [email protected], Phone: 013 - 281373, Chapter 6.4 – 7.2 (Chapter 12 in HTF, GP not covered in HTF) Office: House B, Entrance 27. AUTOMATIC CONTROL Machine Learning REGLERTEKNIK Machine Learning T. Schön LINKÖPINGS UNIVERSITET T. Schön Summary of lecture 4 (I/II) 3(39) Summary of lecture 4 (II/II) 4(39) A kernel function k(x, z) is defined as an inner product A neural network is a nonlinear function (as a function expansion) from a set of input variables to a set of output variables controlled by k(x, z) = φ(x)Tφ(z), adjustable parameters w. where φ(x) is a fixed mapping. This function expansion is found by formulating the problem as usual, which results in a (non-convex) optimization problem. This problem is Introduced the kernel trick (a.k.a. kernel substitution). In an solved using numerical methods. algorithm where the input data x enters only in the form of scalar products we can replace this scalar product with another choice of Backpropagation refers to a way of computing the gradients by kernel. making use of the chain rule, combined with clever reuse of information that is needed for more than one gradient.
    [Show full text]
  • Mean Field Simulation for Monte Carlo Integration MONOGRAPHS on STATISTICS and APPLIED PROBABILITY
    Mean Field Simulation for Monte Carlo Integration MONOGRAPHS ON STATISTICS AND APPLIED PROBABILITY General Editors F. Bunea, V. Isham, N. Keiding, T. Louis, R. L. Smith, and H. Tong 1. Stochastic Population Models in Ecology and Epidemiology M.S. Barlett (1960) 2. Queues D.R. Cox and W.L. Smith (1961) 3. Monte Carlo Methods J.M. Hammersley and D.C. Handscomb (1964) 4. The Statistical Analysis of Series of Events D.R. Cox and P.A.W. Lewis (1966) 5. Population Genetics W.J. Ewens (1969) 6. Probability, Statistics and Time M.S. Barlett (1975) 7. Statistical Inference S.D. Silvey (1975) 8. The Analysis of Contingency Tables B.S. Everitt (1977) 9. Multivariate Analysis in Behavioural Research A.E. Maxwell (1977) 10. Stochastic Abundance Models S. Engen (1978) 11. Some Basic Theory for Statistical Inference E.J.G. Pitman (1979) 12. Point Processes D.R. Cox and V. Isham (1980) 13. Identification of OutliersD.M. Hawkins (1980) 14. Optimal Design S.D. Silvey (1980) 15. Finite Mixture Distributions B.S. Everitt and D.J. Hand (1981) 16. ClassificationA.D. Gordon (1981) 17. Distribution-Free Statistical Methods, 2nd edition J.S. Maritz (1995) 18. Residuals and Influence in RegressionR.D. Cook and S. Weisberg (1982) 19. Applications of Queueing Theory, 2nd edition G.F. Newell (1982) 20. Risk Theory, 3rd edition R.E. Beard, T. Pentikäinen and E. Pesonen (1984) 21. Analysis of Survival Data D.R. Cox and D. Oakes (1984) 22. An Introduction to Latent Variable Models B.S. Everitt (1984) 23. Bandit Problems D.A. Berry and B.
    [Show full text]
  • Hidden Markov Model Multiarm Bandits: a Methodology for Beam Scheduling in Multitarget Tracking Vikram Krishnamurthy, Senior Member, IEEE, and Robin J
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 49, NO. 12, DECEMBER 2001 2893 Hidden Markov Model Multiarm Bandits: A Methodology for Beam Scheduling in Multitarget Tracking Vikram Krishnamurthy, Senior Member, IEEE, and Robin J. Evans Abstract—In this paper, we derive optimal and suboptimal beam scheduling algorithms for electronically scanned array tracking systems. We formulate the scheduling problem as a multiarm bandit problem involving hidden Markov models (HMMs). A finite-dimensional optimal solution to this multiarm bandit problem is presented. The key to solving any multiarm bandit problem is to compute the Gittins index. We present a finite-dimensional algorithm that computes the Gittins index. Suboptimal algorithms for computing the Gittins index are also presented. Numerical examples are presented to illustrate the algorithms. Index Terms—Dynamic programming, hidden Markov models, optimal beam steering, scheduling, sequential decision procedures. Fig. 1. Multitarget tracking with one intelligent sensor. The scheduling problem involves which single target to track with the steerable electronic scanned array (ESA). I. INTRODUCTION AND PROBLEM FORMULATION ONSIDER the following hidden Markov model (HMM) work considers one important part of a complete agile beam C target tracking problem: targets (e.g., aircraft) are tracking system. We show that the multiarm bandit formulation being tracked by an electronically scanned array (ESA) with can provide a rigorous and potentially useful approach to the only one steerable beam. The coordinates of each target problem of scheduling an agile beam among a finite number of evolve according to a finite state Markov established target tracks. chain (see [27]), and the conditional mean estimate target state The multiarm bandit problem is an example of a dynamic sto- is computed by an HMM tracker.
    [Show full text]
  • A Framework of Stochastic Power Management Using Hidden Markov Model
    A Framework of Stochastic Power Management Using Hidden Markov Model Ying Tan, Qinru Qiu Department of Electrical and Computer Engineering Binghamton University, State University of New York Binghamton, New York 13902, USA {ying, qqiu}@binghamton.edu Abstract - The effectiveness of stochastic power management correspondence because the workload is not only controlled by the relies on the accurate system and workload model and effective hardware and software but also affected by user and environment. policy optimization. Workload modeling is a machine learning For example, user working style and user mood have significant procedure that finds the intrinsic pattern of the incoming tasks impact of the workload distribution of a computer system. Consider based on the observed workload attributes. Markov Decision a power manager (PM) of a wireless adapter. The observed Process (MDP) based model has been widely adopted for workload attribute is the frequency and the size of the stochastic power management because it delivers provable incoming/outgoing TCP/IP packets. During a teleconference, the optimal policy. Given a sequence of observed workload user may choose to send a video image, send the audio message, attributes, the hidden Markov model (HMM) of the workload share files or share the image on whiteboard. Different operations is trained. If the observed workload attributes and states in the generate different communication requirements. An accurate workload model do not have one-to-one correspondence, the workload model of the wireless adapter must reflect how the user MDP becomes a Partially Observable Markov Decision Process switches from one operation to another. However, this information (POMDP). This paper presents a framework of modeling and is not observable by the PM.
    [Show full text]