Maximizing terminal utility by controlling risk exposure; a discrete-time dynamic control approach

2005 ◽  
Vol 2005 (2) ◽  
pp. 142-160 ◽  
Author(s):  
Christian Irgens * ◽  
Jostein Paulsen
2010 ◽  
Vol 44 (18) ◽  
pp. 5150-5157 ◽  
Author(s):  
Yanchen Liu ◽  
Hanchang Shi ◽  
Huiming Shi ◽  
Zhiqiang Wang

2016 ◽  
Vol 30 (3) ◽  
pp. 470-491
Author(s):  
Yingdong Lu ◽  
Mayank Sharma ◽  
Mark S. Squillante ◽  
Bo Zhang

Motivated by applications in areas such as cloud computing and information technology services, we consider GI/GI/1 queueing systems under workloads (arrival and service processes) that vary according to one discrete time scale and under controls (server capacity) that vary according to another discrete time scale. We take a stochastic optimal control approach and formulate the corresponding optimal dynamic control problem as a stochastic dynamic program. Under general assumptions for the queueing system, we derive structural properties for the optimal dynamic control policy, establishing that the optimal policy can be obtained through a sequence of convex programs. We also derive fluid and diffusion approximations for the problem and propose analytical and computational approaches in these settings. Computational experiments demonstrate the benefits of our theoretical results over standard heuristics.


2016 ◽  
Vol 93 (1) ◽  
pp. 121-123 ◽  
Author(s):  
S. V. Emel’yanov ◽  
Yu. E. Danik ◽  
M. G. Dmitriev ◽  
D. A. Makarov

Author(s):  
Benoit Duvocelle ◽  
János Flesch ◽  
Hui Min Shi ◽  
Dries Vermeulen

AbstractWe consider a discrete-time dynamic search game in which a number of players compete to find an invisible object that is moving according to a time-varying Markov chain. We examine the subgame perfect equilibria of these games. The main result of the paper is that the set of subgame perfect equilibria is exactly the set of greedy strategy profiles, i.e. those strategy profiles in which the players always choose an action that maximizes their probability of immediately finding the object. We discuss various variations and extensions of the model.


Sign in / Sign up

Export Citation Format

Share Document