Team game models appear in a number of interesting applications in network and economic systems. In this chapter, three conceptual algorithms of the fictitious play type are derived for their solution and proven convergent. They are based on Frank-Wolfe linearization and cyclic decomposition. Inaccurate subproblem solutions and overall epsilon-optimality are made possible by utilizing the concept of Hearn's gap function