We study inverse-Monge assignment games, namely cooperative assignment games in which the assignment matrix satisfies the inverse-Monge property. For square inverse-Monge assignment games, we describe their cores and we obtain a closed formula for the buyers-optimal and the sellers-optimal core allocations. We also apply the above results to solve the non-square case.