IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00130449.html

Values on regular games under Kirchhoff's laws

Author

Listed:
  • Fabien Lange

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Michel Grabisch

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

Abstract

In cooperative game theory, the Shapley value is a central notion defining a rational way to share the total worth of a game among players. In this paper, we address a general framework, namely regular set systems, where the set of feasible coalitions forms a poset where all maximal chains have the same length. We first show that previous definitions and axiomatizations of the Shaphey value proposed by Faigle and Kern and Bilbao and Edelman still work. our main contribution is then to propose a new axiomatization avoiding the hierarchical strength axiom of Faigle and Kern, and considering a new way to define the symmetry among players. Borrowing ideas from electric networks theory, we show that our symmetry axiom and the classical efficiency axiom correspond actually to the two Kirchhoff's laws in the resistor circuit associated to the Hasse diagram of feasible coalitions. We finally work out a weak form of the monotonicity axiom which is satisfied by the proposed value.

Suggested Citation

  • Fabien Lange & Michel Grabisch, 2006. "Values on regular games under Kirchhoff's laws," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00130449, HAL.
  • Handle: RePEc:hal:cesptp:halshs-00130449
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00130449v1
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00130449v1/document
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:hal:cesptp:halshs-00130449. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.