### ?

## Optimization of Portfolio Compositions for Small and Medium Price-Taking Traders

The paper proposes two new approaches to designing efficient mathematical tools for quantitatively analyzing decision-making processes that small and medium price-taking traders undergo in forming and managing their portfolios of financial instruments traded in a stock exchange. Two mathematical models underlying these approaches are considered. If the trader can treat price changes for each financial instrument of her interest as those of a random variable with a known (for instance, a uniform) probability distribution, one of these models allows the trader to formulate the problem of finding an optimal composition of her portfolio as an integer programming problem. The other model is suggested to use when the trader does not possess any particular information on the probability distribution of the above-mentioned random variable for financial instruments of her interest while being capable of estimating the areas to which the prices of groups of financial instruments (being components of finite-dimensional vectors for each group) are likely to belong. When each such area is a convex polyhedron described by a finite set of compatible linear equations and inequalities of a balance kind, the use of this model allows one to view the trader’s decision on her portfolio composition as that of a player in an antagonistic game on sets of disjoint player strategies. The payoff function of this game is a sum of a linear and a bilinear function of two vector arguments, and the trader’s guaranteed financial result in playing against the stock exchange equals the exact value of the maximin of this function. This value, along with the vectors at which it is attained, can be found by solving a mixed programming problem. Finding an upper bound for this maximin value (and the vectors at which this upper bound is attained) is reducible to finding saddle points in an auxiliary antagonistic game with the same payoff function on convex polyhedra of disjoint player strategies. These saddle points can be calculated by solving linear programming problems forming a dual pair.