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

The position value in communication structures

Author

Listed:
  • E. Algaba
  • J. M. Bilbao
  • J. J. López

Abstract

We study cooperation structures with the following property: given any two feasible coalitions with non-empty intersection, its union is a feasible coalition again. TU-games restricted by union stable systems generalize graph-restricted games and games with permission structures. A study about the differences between the position value in union stable systems and hypergraph communication situations is given. Moreover, some computational aspects related to position value in union stable systems are discussed. Copyright Springer-Verlag 2004

Suggested Citation

  • E. Algaba & J. M. Bilbao & J. J. López, 2004. "The position value in communication structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 465-477, July.
    • Handle: RePEc:spr:mathme:v:59:y:2004:i:3:p:465-477
    DOI: 10.1007/s001860400343
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860400343
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860400343?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. Encarnación Algaba & Stefano Moretti & Eric Rémila & Philippe Solal, 2021. "Lexicographic solutions for coalitional rankings," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 817-849, November.
    2. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    3. Bas Dietzenbacher & Peter Borm & Ruud Hendrickx, 2017. "Decomposition of network communication games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(3), pages 407-423, June.
    4. Encarnaciön Algaba & Sylvain Béal & Eric Rémila & Phillippe Solal, 2018. "Harsanyi power solutions for cooperative games on voting structures," Working Papers 2018-05, CRESE.
    5. Xianghui Li & Bin Jiang & Yang Li, 2024. "The allowable value for cooperative games with restricted permutations," Annals of Operations Research, Springer, vol. 340(2), pages 943-959, September.
    6. 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.
    7. Encarnacion Algaba & Rene van den Brink, 2019. "The Shapley Value and Games with Hierarchies," Tinbergen Institute Discussion Papers 19-064/II, Tinbergen Institute.
    8. Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink & Jorge J. Lopez, 2011. "The Myerson Value and Superfluous Supports in Union Stable Systems," Tinbergen Institute Discussion Papers 11-127/1, Tinbergen Institute.
    9. Encarnación Algaba & René Brink & Chris Dietz, 2018. "Network Structures with Hierarchy and Communication," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 265-282, October.
    10. Florian Navarro, 2019. "Necessary players, Myerson fairness and the equal treatment of equals," Annals of Operations Research, Springer, vol. 280(1), pages 111-119, September.
    11. E. Algaba & J. M. Bilbao & R. Brink & J. J. López, 2012. "The Myerson Value and Superfluous Supports in Union Stable Systems," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 650-668, November.

    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:465-477. 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.