Bargaining Sets with Thresholds
Abstract
**Please note that the full text is embargoed** ABSTRACT: A concept of bargaining set for cooperative n person games with side payments has been defined by assuming that a player could be attracted in a new
coalition only if his supplementary gain exceeds a fixed threshold and could reject a new coalition only if his loss exceeds another fixed threshold.
Necessary and sufficient conditions for the existence of the objections with thresholds and for the existence of the counter objections with thresholds
associated to couples consisting of a group of players and a coalition structure subjected to some conditions have been proved. These results enabled
us to state a combinatorial algorithm for establishing whether a given payoff configuration belongs to the bargaining set with thresholds, or not.