Dynamic spectrum sharing aims to produce flexible spectrum usage and improve spectrum utilization with time. we have a tendency to propose two optimization models exploitation random optimization algorithms during which the secondary operator: 1) spends the stripped price to realize the target Grade of Service (GoS) assuming unrestricted budget or 2) gains the highest profit to realize the target GoS assuming restricted budget. we have a tendency to assume that there are spectrum resources accessible for secondary operators to borrow under merchant mode. Results obtained from every model are then compared with results derived from algorithms during which spectrum borrowings are random. Comparisons showed that the gain within the results obtained from our projected stochastic-optimization framework is considerably beyond heuristic counterparts. Second post-optimization performance analysis of the operators in the form of blocking probability in various scenarios is investigated to work out the probable performance gain and degradation of the secondary and primary operators, respectively.