A general approach to define constrained coalitional games is proposed, i.e., TU games where additional, application-oriented constraints are imposed on the possible outcomes. It is observed that constrained games are succinct NonTransferable (NTU) specifications, which yet retain (some of) the nice properties of the underlying TU games. In fact, a clear picture about the preservation properties of TU solution concepts is depicted, and a thorough analysis is eventually carried out, to assess the impact of issuing constraints on the computational complexity of these solution concepts.
Constrained coalitional games: formal framework, properties, and complexity results
GRECO, Gianluigi;PALOPOLI, Luigi;SCARCELLO F.
2009-01-01
Abstract
A general approach to define constrained coalitional games is proposed, i.e., TU games where additional, application-oriented constraints are imposed on the possible outcomes. It is observed that constrained games are succinct NonTransferable (NTU) specifications, which yet retain (some of) the nice properties of the underlying TU games. In fact, a clear picture about the preservation properties of TU solution concepts is depicted, and a thorough analysis is eventually carried out, to assess the impact of issuing constraints on the computational complexity of these solution concepts.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
