Reactive and Semi-Reactive Bargaining Sets for Games with Restricted Cooperation

Abstract

Generalizations of reactive and semi-reactive bargaining sets of TU games are defined for the case when objections and counter-objections are permitted not between singletons but between elements of a family of coalitions [Formula: see text] and can use coalitions from [Formula: see text]. Necessary and sufficient conditions on [Formula: see text], [Formula: see text] that ensure existence results for generalizations of the reactive bargaining set and of the semi-reactive barganing set at each TU game [Formula: see text] with nonnegative values are obtained. The existence conditions for the generalized reactive bargaining set do not coincide with existence conditions for the generalized kernel and coincide with conditions for the generalized semi-reactive bargaining set only if [Formula: see text] and [Formula: see text]. The conditions for the generalized semi-reactive bargaining set coincide with conditions for the generalized classical bargaining set that were described in the previous papers of the author. For monotonic [Formula: see text], the condition on [Formula: see text] for existence of the generalized semi-reactive bargaining sets on the class of games with nonnegative values is also necessary and sufficient on the class of simple games, but similar result for the generalized classical bargaining sets is proved only for [Formula: see text].