The newsvendor game has a nonempty core (Q700099)

Let \((N, c)\) be a newsvendor game where \(N\) is the set of newsvendors and \(c\) is the cost function. The paper shows that for any set of random demands facing the newsvendors, the core of \((N, c)\) is nonempty. This result is a nice implication of the Shapley-Bondareva theorem. Additional results give sufficient conditions when the core is nonnegative and when the core is a singleton.