Skip to main content

Advertisement

Springer Nature Link
Log in

Splitting graphs when calculating Myerson value for pure overhead games

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dpto. de Estadística e I.O, III. Escuela Universitaria de Estadística, Universidad Complutense de Madrid, Avda. Puerta de Hierro s/n, 28040, Madrid, Spain

    D. Gómez, C. Manuel & M. del Pozo

  2. Dept. of Mathematics, Naval Postgraduate School, Monterey, U.S.A

    E. González-Arangüena & G. Owen

  3. Dpto. de Estadística e I.O. I, Facultad de CC. Matemáticas, Universidad Complutense de Madrid, Madrid, Spain

    J. Tejada

Authors
  1. D. Gómez
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. E. González-Arangüena
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. C. Manuel
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. G. Owen
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. M. del Pozo
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. J. Tejada
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to C. Manuel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gómez, D., González-Arangüena, E., Manuel, C. et al. Splitting graphs when calculating Myerson value for pure overhead games. Math Meth Oper Res 59, 479–489 (2004). https://doi.org/10.1007/s001860400346

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860400346

Key words.