Stochastic games of control and stopping for a linear diffusion

被引:0
作者
Karatzas, Annis [1 ,2 ]
Sudderth, William [3 ]
机构
[1] Columbia Univ, Dept Math, New York, NY 10027 USA
[2] Columbia Univ, Dept Stat, New York, NY 10027 USA
[3] Univ Minnesota, Sch Stat, Minneapolis, MN 55455 USA
来源
RANDOM WALK, SEQUENTIAL ANALYSIS AND RELATED TOPICS: A FESTSCHRIFT IN HONOR OF YUAN-SHIH CHOW | 2006年
基金
美国国家科学基金会;
关键词
stochastic games; optimal control; optimal stopping; nash equilibrium; linear diffusions; local time; generalized ito rule;
D O I
暂无
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We study three stochastic differential games. In each game, two players control a process X = {Xt, 0 <= t < infinity} which takes values in the interval I = (0, 1), is absorbed at the endpoints of I, and satisfies a stochastic differential equation dX(t) = mu(X-t, alpha(X-t), beta(X-t)) dt + sigma(X-t, alpha(X-t), beta(X-t)) dW(t), X-0 = x is an element of I. The control functions alpha((.)) and)beta((.)) are chosen by players U and respectively. In the first of our games, which is zero-sum, player U has a continuous reward function u : [0, 1] -> R. In addition to alpha((.)), player a chooses a stopping rule tau and seeks to maximize the expectation of u(X-tau); whereas player B chooses beta((.)) and aims to minimize this expectation. In the second game, players U and B each have continuous reward functions u((.)) and upsilon((.)), choose stopping rules tau and rho, and seek to maximize the expectations of u(X-t) and upsilon(X-rho), respectively. In the third game the two players again have continuous reward functions u((.)) and upsilon((.)), now assumed to be unimodal, and choose stopping rules tau and rho. This game terminates at the minimum tau boolean AND rho of the stopping rules tau and rho, and players U, B want to maximize the expectations of u(X-tau boolean AND rho) and upsilon(X-tau boolean AND rho), respectively. Under mild technical assumptions we show that the first game has a value, and find a saddle point of optimal strategies for the players. The other two games are not zero-sum, in general, and for them we construct Nash equilibria.
引用
收藏
页码:100 / +
页数:4
相关论文
共 38 条