IDEAS home Printed from https://ideas.repec.org/a/ebl/ecbull/eb-13-00769.html
   My bibliography  Save this article

Cooperative games with size-truncated information

Author

Listed:
  • F. Javier Martínez-de-Albéniz

    (Universitat de Barcelona)

Abstract

We study the marginal worth vectors and their convex hull, the so-called Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k,for any k,and that the Weber sets of consecutive levels form a chain if and onlyif the original game is 0-monotone. Even if the game is not 0-monotone, theintersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones.

Suggested Citation

  • F. Javier Martínez-de-Albéniz, 2014. "Cooperative games with size-truncated information," Economics Bulletin, AccessEcon, vol. 34(1), pages 188-199.
    • Handle: RePEc:ebl:ecbull:eb-13-00769
    as

    Download full text from publisher

    File URL: http://www.accessecon.com/Pubs/EB/2014/Volume34/EB-14-V34-I1-P20.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. van den Nouweland, Anne & Borm, Peter & Tijs, Stef, 1992. "Allocation Rules for Hypergraph Communication Situations," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 255-268.
    2. Derks, J J M, 1992. "A Short Proof of the Inclusion of the Core in the Weber Set," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(2), pages 149-150.
    3. Alegre, Antoni & Claramunt, M. Merce, 1995. "Allocation of solvency cost in group annuities: Actuarial principles and cooperative game theory," Insurance: Mathematics and Economics, Elsevier, vol. 17(1), pages 19-34, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. F. Javier Martínez-de-Albéniz, 2013. "Cooperative games with size-truncated," UB School of Economics Working Papers 2013/301, University of Barcelona School of Economics.
    2. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.
    3. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    4. Slikker, Marco & Dutta, Bhaskar & van den Nouweland, Anne & Tijs, Stef, 2000. "Potential maximizers and network formation," Mathematical Social Sciences, Elsevier, vol. 39(1), pages 55-70, January.
    5. C. Manuel & D. Martín, 2021. "A value for communication situations with players having different bargaining abilities," Annals of Operations Research, Springer, vol. 301(1), pages 161-182, June.
    6. Chen, J. & Elliott, M. & Koh, A., 2020. "Capability Accumulation and Conglomeratization in the Information Age," Cambridge Working Papers in Economics 2069, Faculty of Economics, University of Cambridge.
    7. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    8. Josep Maria Izquierdo Aznar & Carlos Rafels Pallarola, 2002. "Coalitionally Monotonic Set-solutions for Cooperative TU Games," Working Papers in Economics 75, Universitat de Barcelona. Espai de Recerca en Economia.
    9. Derks, Jean, 2005. "A new proof for Weber's characterization of the random order values," Mathematical Social Sciences, Elsevier, vol. 49(3), pages 327-334, May.
    10. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023. "The two-step average tree value for graph and hypergraph games," Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.
    11. E. Algaba & J. Bilbao & R. Brink, 2015. "Harsanyi power solutions for games on union stable systems," Annals of Operations Research, Springer, vol. 225(1), pages 27-44, February.
    12. Fragnelli, V. & Llorca, N. & Sánchez-Soriano, J. & Tijs, S.H., 2006. "Convex Games with Countable Number of Players and Sequencing Situations," Discussion Paper 2006-119, Tilburg University, Center for Economic Research.
    13. Bas Dietzenbacher & Elena Yanovskaya, 2021. "Consistency of the equal split-off set," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 1-22, March.
    14. E. Algaba & J. M. Bilbao & P. Borm & J. J. López, 2000. "The position value for union stable systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(2), pages 221-236, November.
    15. de Andrés-Sánchez, Jorge & González-Vila Puchades, Laura, 2017. "The valuation of life contingencies: A symmetrical triangular fuzzy approximation," Insurance: Mathematics and Economics, Elsevier, vol. 72(C), pages 83-94.
    16. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    17. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    18. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    19. Kajii, Atsushi & Kojima, Hiroyuki & Ui, Takashi, 2007. "Cominimum additive operators," Journal of Mathematical Economics, Elsevier, vol. 43(2), pages 218-230, February.
    20. Takashi Ui & Hiroyuki Kojima & Atsushi Kajii, 2011. "The Myerson value for complete coalition structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 427-443, December.
    21. Suijs, J.P.M. & De Waegenaere, A.M.B. & Borm, P.E.M., 1996. "Stochastic Cooperative Games in Insurance and Reinsurance," Discussion Paper 1996-53, Tilburg University, Center for Economic Research.

    More about this item

    Keywords

    Cooperative game; core; Weber set; marginal worth vectors;
    All these keywords.

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ebl:ecbull:eb-13-00769. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: John P. Conley (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.