Computational social choice literature has successfully studied the complexity of manipulation in variousvoting systems. However, the existing modelsof coalitional manipulation view the manipulatingcoalition as an exogenous input, ignoring thequestion of the coalition formation process. While such analysis is useful as a first approximation, a richer framework is required to model voting manipulationin the real world more accurately, and, inparticular, to explain how a manipulating coalitionarises and chooses its action. In this paper, we apply tools from cooperative game theory to developa model that considers the coalition formation processand determines which coalitions are likely toform and what actions they are likely to take. We explore the computational complexity of several standard coalitional game theory solution concepts in our setting, and study the relationship betweenour model and the classic coalitional manipulation problem as well as the now-standard bribery model.