This thesis studies the revenue maximization problem in the networked cournot markets. In a networked cournot market, platform decides whether a firm has access to a specific market and tries to find an optimal matching that maximizes the revenue. We begin with several examples with quadratic production costs, and then conduct detailed analysis on the linear cost case as well as the linear cost case with production capacities. At the end of the thesis, we also conduct analysis on computational complexity of revenue maximization problems under homogeneous firms and markets and heterogeneous firms and markets respectively.