Advanced Search
MyIDEAS: Login

Core Stability in Chain-Component Additive Games

Contents:

Author Info

  • Velzen, S. van
  • Hamers, H.J.M.
  • Solymosi, T.

    (Tilburg University, Center for Economic Research)

Abstract

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

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.
File URL: http://arno.uvt.nl/show.cgi?fid=12150
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2004-101.

as in new window
Length:
Date of creation: 2004
Date of revision:
Handle: RePEc:dgr:kubcen:2004101

Contact details of provider:
Web page: http://center.uvt.nl

Related research

Keywords: Core stability; graph-restricted games; large core; exact game;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Flip Klijn & Dries Vermeulen & Herbert Hamers & Tamás Solymosi & Stef Tijs & Joan Pere Villar, 2003. "Neighbor games and the leximax solution," Computational Statistics, Springer, vol. 58(2), pages 191-208, November.
  2. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, Tilburg University.
  3. Le Breton,Michel & Owen,Guillermo & Weber,Shlomo, 1991. "Strongly balanced cooperative games," Discussion Paper Serie A 338, University of Bonn, Germany.
  4. Hamers, Herbert & Klijn, Flip & Solymosi, Tamas & Tijs, Stef & Vermeulen, Dries, 2003. "On the nucleolus of neighbor games," European Journal of Operational Research, Elsevier, vol. 146(1), pages 1-18, April.
  5. Hamers, H.J.M. & Klijn, F. & Velzen, S. van, 2002. "On the Convexity of Precedence Sequencing Games," Discussion Paper 2002-112, Tilburg University, Center for Economic Research.
  6. 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.
  7. Potters, Jos & Reijnierse, Hans, 1995. "Gamma-Component Additive Games," International Journal of Game Theory, Springer, vol. 24(1), pages 49-56.
  8. 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.
  9. 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.
  10. 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.
  11. Hamers, H. & Borm, P. & Tijs, S., 1993. "A Games Corresponding to Sequencing Situations with Ready Times," Papers 9316, Tilburg - Center for Economic Research.
  12. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
  13. Curiel, I. & Potters, J.A.M. & Rajendra Prasad, V. & Tijs, S.H. & Veltman, B., 1994. "Sequencing and cooperation," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154192, Tilburg University.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Velzen, S. van, 2005. "Cooperation in Networks and Scheduling," Open Access publications from Tilburg University urn:nbn:nl:ui:12-170234, Tilburg University.
  2. Csóka, Péter & Herings, P. Jean-Jacques & Kóczy, László Á., 2007. "Balancedness Conditions for Exact Games," Research Memorandum 039, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  3. Velzen, S. van, 2005. "Simple Combinatorial Optimisation Cost Games," Discussion Paper 2005-118, Tilburg University, Center for Economic Research.
  4. Arantza Estevez-Fernandez, 2011. "New Characterizations for Largeness of the Core," Tinbergen Institute Discussion Papers 11-086/1, Tinbergen Institute.
  5. Arantza Estevez-Fernandez, 2011. "New Characterizations for Largeness of the Core," Tinbergen Institute Discussion Papers 11-086/1, Tinbergen Institute.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:2004101. 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: (Richard Broekman).

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.