IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/2718.html

Allocation rules for coalitional network games

Author

Listed:
  • CAULIER, Jean-François
  • MAULEON, Ana
  • VANNETELBOSCH, Vincent

Abstract

Coalitional network games are real-valued functions defined on a set of players organized into a network and a coalition structure. We adopt a flexible approach assuming that players organize themselves the best way possible by forming the efficient coalitional network structure. We propose two allocation rules that distribute the value of the efficient coalitional network structure: the atom-based flexible coalitional network allocation rule and the player-based flexible coalitional network allocation rule.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2015. "Allocation rules for coalitional network games," LIDAM Reprints CORE 2718, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:2718
    Note: In : Mathematical Social Sciences, 78, 2015, p. 80-88
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Kirchsteiger, Georg & Mantovani, Marco & Mauleon, Ana & Vannetelbosch, Vincent, 2016. "Limited farsightedness in network formation," Journal of Economic Behavior & Organization, Elsevier, vol. 128(C), pages 97-120.
    2. Mohammad Abu‐zaineh & Sameera Awawda, 2022. "Measurement of Social Welfare and Inequality in Presence of Partially-ordered Variables," Working Papers hal-03904449, HAL.
    3. Sokolov, Denis, 2022. "Shapley value for TU-games with multiple memberships and externalities," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 76-90.
    4. DUJARDIN, Claire & lorant, VINCENT & THOMAS, Isabelle, 2013. "Self-assessed health of elderly people in Brussels: does the built environment matter?," LIDAM Discussion Papers CORE 2013048, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. PAPAVASILIOU, Anthony & HE, Yi & SVOBODA, Alva, 2013. "Self-commitment of combined cycle units under electricity price uncertainty," LIDAM Discussion Papers CORE 2013051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. José María Alonso-Meijide & Mikel à lvarez-Mozos & Maria Gloria Fiestras-Janeiro & Andres Jiménez-Losada, 2022. "Two families of values for global games," UB School of Economics Working Papers 2022/428, University of Barcelona School of Economics.
    7. Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015. "Revenue management for operations with urgent orders," European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
    8. Förster, Manuel & Mauleon, Ana & Vannetelbosch, Vincent J., 2016. "Trust and manipulation in social networks," Network Science, Cambridge University Press, vol. 4(2), pages 216-243, June.
    9. J. M. Alonso-Meijide & M. Álvarez-Mozos & M. G. Fiestras-Janeiro & A. Jiménez-Losada, 2025. "Two families of values for global cooperative games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 79(1), pages 181-199, February.
    10. Ana Mauleon & Vincent Vannetelbosch, 2013. "Relative Concerns and Delays in Bargaining with Private Information," Games, MDPI, vol. 4(3), pages 1-10, June.
    11. Chih‐Sheng Hsieh & Lung‐Fei Lee & Vincent Boucher, 2020. "Specification and estimation of network formation and network interaction models with the exponential probability distribution," Quantitative Economics, Econometric Society, vol. 11(4), pages 1349-1390, November.
    12. AVELLA, Pasquale & BOCCIA, Maurizio & WOLSEY, Laurence, 2013. "Single item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances," LIDAM Discussion Papers CORE 2013045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    More about this item

    JEL classification:

    • A14 - General Economics and Teaching - - General Economics - - - Sociology of Economics
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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:cor:louvrp:2718. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.