IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v59y2004i3p479-489.html
   My bibliography  Save this article

Splitting graphs when calculating Myerson value for pure overhead games

Author

Listed:
  • D. Gómez
  • E. González-Arangüena
  • C. Manuel
  • G. Owen
  • M. del Pozo
  • J. Tejada

Abstract

A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results which extend those well known for trees and cycle-complete graphs. On the other hand, in order to reduce the associated calculus for communication situations with a pure overhead game, the possibility of splitting the graph in several subgraphs is analyzed. For each fixed decomposition of the graph, a subspace of games compatible with this decomposition is given. Copyright Springer-Verlag 2004

Suggested Citation

  • D. Gómez & E. González-Arangüena & C. Manuel & G. Owen & M. del Pozo & J. Tejada, 2004. "Splitting graphs when calculating Myerson value for pure overhead games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 479-489, July.
    • Handle: RePEc:spr:mathme:v:59:y:2004:i:3:p:479-489
    DOI: 10.1007/s001860400346
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400346
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400346?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Enrique González-Arangüena & Conrado Manuel & Daniel Gomez & René van den Brink, 2008. "A Value for Directed Communication Situations," Tinbergen Institute Discussion Papers 08-006/1, Tinbergen Institute.
    2. Taiki Yamada, 2021. "New allocation rule of directed hypergraphs," Papers 2110.06506, arXiv.org, revised Feb 2023.

    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:spr:mathme:v:59:y:2004:i:3:p:479-489. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.