IDEAS home Printed from https://ideas.repec.org/a/sae/miceco/v2y2014i1p5-26.html
   My bibliography  Save this article

A Survey of Player-based and Link-based Allocation Rules for Network Games

Author

Listed:
  • Surajit Borkotokey
  • Loyimee Gogoi
  • Sudipta Sarangi

Abstract

In this survey, we present recent developments in the literature on Network games. We briefly cover the literature on Communication situations and the corresponding allocation rules. This is followed by a review on the existing player- and link-based fixed and flexible allocation rules for networks. It is worth mentioning that all the allocation rules hitherto found in the literature are either player- or link-based which means that they give emphasis either on the players or on the links they form, but not both equally.

Suggested Citation

  • Surajit Borkotokey & Loyimee Gogoi & Sudipta Sarangi, 2014. "A Survey of Player-based and Link-based Allocation Rules for Network Games," Studies in Microeconomics, , vol. 2(1), pages 5-26, June.
    • Handle: RePEc:sae:miceco:v:2:y:2014:i:1:p:5-26
    DOI: 10.1177/2321022214522744
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/2321022214522744
    Download Restriction: no
    File URL: https://libkey.io/10.1177/2321022214522744?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. Marco Slikker, 2005. "A characterization of the position value," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 505-514, November.
    2. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
    3. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    4. Tijs, S.H. & Driessen, T.S.H., 1986. "Game theory and cost allocation problems," Other publications TiSEM 376c24c5-c95d-4d29-96b6-4, Tilburg University, School of Economics and Management.
    5. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    6. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    7. 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.
    8. Lloyd S. Shapley, 1967. "On balanced sets and cores," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 14(4), pages 453-460.
    9. Marco Slikker, 2005. "Link Monotonic Allocation Schemes," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
    10. S. H. Tijs & T. S. H. Driessen, 1986. "Game Theory and Cost Allocation Problems," Management Science, INFORMS, vol. 32(8), pages 1015-1028, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    2. Pramod C. Mane & Nagarajan Krishnamurthy & Kapil Ahuja, 2019. "Formation of Stable and Efficient Social Storage Cloud," Games, MDPI, vol. 10(4), pages 1-17, November.
    3. Pramod C. Mane & Kapil Ahuja & Nagarajan Krishnamurthy, 2020. "Stability, efficiency, and contentedness of social storage networks," Annals of Operations Research, Springer, vol. 287(2), pages 811-842, April.
    4. Allouch, N. & Guardiola, Luis A. & Meca, A., 2024. "Measuring productivity in networks: A game-theoretic approach," Socio-Economic Planning Sciences, Elsevier, vol. 91(C).

    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. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    2. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    3. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
    4. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    5. A. Ghintran & E. González-Arangüena & C. Manuel, 2012. "A probabilistic position value," Annals of Operations Research, Springer, vol. 201(1), pages 183-196, December.
    6. Daniel Li Li & Erfang Shan, 2022. "Safety of links with respect to the Myerson value for communication situations," Operational Research, Springer, vol. 22(3), pages 2121-2131, July.
    7. Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.
    8. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    9. 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.
    10. van den Brink, René & Khmelnitskaya, Anna & van der Laan, Gerard, 2012. "An efficient and fair solution for communication graph games," Economics Letters, Elsevier, vol. 117(3), pages 786-789.
    11. Sylvain Béal & Anna Khmelnitskaya & Philippe Solal, 2018. "Two-step values for games with two-level communication structure," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 563-587, February.
    12. Navarro, Florian, 2020. "The center value: A sharing rule for cooperative games on acyclic graphs," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 1-13.
    13. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    14. Gérard Hamiache & Florian Navarro, 2020. "Associated consistency, value and graphs," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 227-249, March.
    15. Sylvain Béal & André Casajus & Frank Huettner, 2018. "Efficient extensions of communication values," Annals of Operations Research, Springer, vol. 264(1), pages 41-56, May.
    16. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    17. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
    18. Allouch, N. & Guardiola, Luis A. & Meca, A., 2024. "Measuring productivity in networks: A game-theoretic approach," Socio-Economic Planning Sciences, Elsevier, vol. 91(C).
    19. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
    20. René Brink & Gerard Laan & Vitaly Pruzhansky, 2011. "Harsanyi power solutions for graph-restricted games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 87-110, February.

    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:sae:miceco:v:2:y:2014:i:1:p:5-26. 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: SAGE Publications (email available below). General contact details of provider: .

    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.