Chain-component additive games are graph-restricted superadditive games, where an exogenously given line-graph determines the cooperative possibilities of the players. These games can model various multi-agent decision situations, such as strictly hierarchical organisations or sequencing / scheduling related problems, where an order of the agents is fixed by some external factor, and with respect to this order only consecutive coalitions can generate added value. In this paper we characterise core stability of chain-component additive games in terms of polynomial many linear inequalities and equalities that arise from the combinatorial structure of the game. Furthermore we show that core stability is equivalent to essential extendibility. We also obtain that largeness of the core as well as extendibility and exactness of the game are equivalent properties which are all sufficient for core stability. Moreover, we also characterise these properties in terms of linear inequalities.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
101.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)
Did you know? All full texts are decentralized with the publishers, none reside on this server, thus making it possible to offer this service for free to all parties.