Core stability in chain-component additive games
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.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
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.:
- T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer, vol. 30(2), pages 177-185.
- repec:spr:compst:v:58:y:2003:i:2:p:191-208 is not listed on IDEAS
- J. R. G. van Gellekom & J. A. M. Potters & J. H. Reijnierse, 1999. "Prosperity properties of TU-games," International Journal of Game Theory, Springer, vol. 28(2), pages 211-227.
- Le Breton, M. & Owen, G. & Weber, S., 1991.
"Strongly Balanced Cooperative Games,"
91a09, Universite Aix-Marseille III.
- Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Vermeulen, D., 1999.
"On the Nucleolus of Neighbour Games,"
1999-111, Tilburg University, Center for Economic Research.
- repec:ner:tilbur:urn:nbn:nl:ui:12-154243 is not listed on IDEAS
- repec:dgr:kubcen:1999110 is not listed on IDEAS
- Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1994. "Sequencing and cooperation," Other publications TiSEM be67f9e9-7a4a-47f1-9fb9-7, School of Economics and Management.
- Amit K. Biswas & G. Ravindran & T. Parthasarathy, 2000. "Stability and largeness of core for symmetric games," International Journal of Game Theory, Springer, vol. 29(1), pages 11-22.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
- repec:ner:tilbur:urn:nbn:nl:ui:12-154192 is not listed on IDEAS
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, School of Economics and Management.
- repec:ner:tilbur:urn:nbn:nl:ui:12-86378 is not listed on IDEAS
- Hamers, H.J.M. & Borm, P.E.M. & Tijs, S.H., 1995. "On games corresponding to sequencing situations with ready times," Other publications TiSEM 99882a33-06c1-4f7c-8436-6, School of Economics and Management.
- Biswas, A. K. & Parthasarathy, T. & Potters, J. A. M. & Voorneveld, M., 1999. "Large Cores and Exactness," Games and Economic Behavior, Elsevier, vol. 28(1), pages 1-12, July.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:62:y:2008:i:1:p:116-139. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.