IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v53y2006i3p198-203.html
   My bibliography  Save this article

The Banzhaf value and communication situations

Author

Listed:
  • J.M. Alonso‐Meijide
  • M.G. Fiestras‐Janeiro

Abstract

Myerson 3 and 4 proposed and characterized a modification of the Shapley value in the context of communication situations. In this paper we propose several characterizations of the extension of the Banzhaf value proposed by Owen 7 to communication situations. In particular we characterize this value with the properties of fairness, isolation, and pairwise merging. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006

Suggested Citation

  • J.M. Alonso‐Meijide & M.G. Fiestras‐Janeiro, 2006. "The Banzhaf value and communication situations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(3), pages 198-203, April.
    • Handle: RePEc:wly:navres:v:53:y:2006:i:3:p:198-203
    DOI: 10.1002/nav.20132
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.20132
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.20132?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
    ---><---

    References listed on IDEAS

    as
    1. Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
    2. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    3. Guillermo Owen, 1975. "Multilinear extensions and the banzhaf value," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 22(4), pages 741-750, December.
    4. Feltkamp, Vincent, 1995. "Alternative Axiomatic Characterizations of the Shapley and Banzhaf Values," International Journal of Game Theory, Springer;Game Theory Society, vol. 24(2), pages 179-186.
    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. Algaba, A. & Bilbao, J.M. & van den Brink, J.R. & Jiménez-Losada, A., 2000. "Cooperative Games on Antimatroids," Other publications TiSEM 907b4b44-90f9-4faa-9473-8, Tilburg University, School of Economics and Management.
    2. 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.
    3. Jilei Shi & Erfang Shan, 2021. "The Banzhaf value for generalized probabilistic communication situations," Annals of Operations Research, Springer, vol. 301(1), pages 225-244, June.
    4. 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.
    5. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    6. Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers hal-04447373, HAL.
    7. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    8. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    9. 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.
    10. Sridhar Mandyam & Usha Sridhar, 2017. "DON and Shapley Value for Allocation among Cooperating Agents in a Network: Conditions for Equivalence," Studies in Microeconomics, , vol. 5(2), pages 143-161, December.
    11. 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.
    12. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
    13. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2005. "The component fairness solution for cycle-free graph games," Research Memorandum 057, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    14. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    15. Gary E. Bolton & Kalyan Chatterjee & Kathleen L. McGinn, 2013. "How Communication Links Influence Coalition Bargaining: A Laboratory Investigation," World Scientific Book Chapters, in: Bargaining in the Shadow of the Market Selected Papers on Bilateral and Multilateral Bargaining, chapter 6, pages 113-128, World Scientific Publishing Co. Pte. Ltd..
    16. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Discussion Paper 2011-100, Tilburg University, Center for Economic Research.
    17. Tejada, O. & Álvarez-Mozos, M., 2018. "Graphs and (levels of) cooperation in games: Two ways how to allocate the surplus," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 114-122.
    18. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01305005, HAL.
    19. Debasis Mishra & A. Talman, 2010. "A characterization of the average tree solution for tree games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 105-111, March.
    20. 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.

    More about this item

    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:wly:navres:v:53:y:2006:i:3:p:198-203. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.