We introduce a new model for two-sided markets that generalizes sta- ble marriages as well as assignment games. Our model is a further gen- eralization of the model introduced by Eriksson and Karlander (2000). We prove that the core of our model is always non-empty by providing an algorithm that determines a stable solution in O(n^4).