In this presentation, we adapt mathematical tools and models from Telecommunication Networks to Online Social networks.

Abstract: Markov Decision Problems (MDPs) are a well-studied abstraction of sequential decision making. Policy Iteration (PI) is a classical, widely-used family of algorithms to compute an optimal policy for a given MDP.

We address a problem of stochastic optimal control motivated by portfolio optimization in mathematical finance, the goal of which is to minimize the expected value of a general quadratic loss function of the wealth at close of trade when there is

Even though classical computers have evolved immensely in the past decades, there remain problems that we can never imagine solving on a classical computer in reasonable time.

A well known fact is that there are polynomials of degree 2 (for instance, inner product, or elementary symmetric polynomials of degree 2), such that any representation of these as a sum of product of affine forms requires Omega(n) summands, where