Mathematics of Operations Research, Vol. 41, No. 1 (February 2016), pp. 146-173 (28 pages) This paper investigates the problem of maximizing expected terminal utility in a (generically incomplete) ...

We design a dynamic rate scheduling policy of Markov type by using the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a ...