Maximum and minimum core payoffs for supermodular multisided assignment markets with local monotonicity

We give formulas to obtain the maximum and minimum core payoffs for supermodular multisided assignment markets satisfying a local monotonicity condition. These formulas are obtained directly from the multisided array of data and we provide a core allocation where these bounds are attained. Similar formulas are known from Eriksson et al. (2000) for the bilateral Becker’s assortative assignment.