IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v58y2009i3p341-353.html
   My bibliography  Save this article

A linear proportional effort allocation rule

Author

Listed:
  • Kamijo, Yoshio

Abstract

This paper proposes a new class of allocation rules in network games. Like the solution theory in cooperative games of how the Harsanyi dividend of each coalition is distributed among a set of players, this new class of allocation rules focuses on the distribution of the dividend of each network. The dividend of each network is allocated in proportion to some measure of each player's effort, which is called an effort function. With linearity of the allocation rules, an allocation rule is specified by the effort functions. These types of allocation rules are called linear proportional effort allocation rules. Two famous allocation rules, the Myerson value and the position value, belong to this class of allocation rules. In this study, we provide a unifying approach to define the two aforementioned values. Moreover, we provide an axiomatic analysis of this class of allocation rules, and axiomatize the Myerson value, the position value, and their non-symmetric generalizations in terms of effort functions. We propose a new allocation rule in network games that also belongs to this class of allocation rules.

Suggested Citation

  • Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    • Handle: RePEc:eee:matsoc:v:58:y:2009:i:3:p:341-353
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(09)00063-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. Monderer, Dov & Samet, Dov & Shapley, Lloyd S, 1992. "Weighted Values and the Core," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(1), pages 27-39.
    3. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    4. 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.
    5. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    6. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    7. Guillaume Haeringer, 1999. "Weighted Myerson Value," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 1(02), pages 187-192.
    8. 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.
    9. Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 23-38.
    10. André Casajus, 2007. "The position value is the Myerson value, in a sense," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 47-55, September.
    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. Julia Belau, 2018. "The class of ASN-position values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 65-99, January.
    2. Borkotokey, Surajit & Sarangi, Sudipta, 2011. "Allocation rules for fixed and flexible networks: the role of players and their links," MPRA Paper 38340, University Library of Munich, Germany.
    3. Borkotokey, Surajit & Kumar, Rajnish & Sarangi, Sudipta, 2015. "A solution concept for network games: The role of multilateral interactions," European Journal of Operational Research, Elsevier, vol. 243(3), pages 912-920.

    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. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    2. Borkotokey, Surajit & Sarangi, Sudipta, 2011. "Allocation rules for fixed and flexible networks: the role of players and their links," MPRA Paper 38340, University Library of Munich, Germany.
    3. 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.
    4. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    5. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    6. 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.
    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. C. Manuel & E. Ortega & M. del Pozo, 2023. "Marginality and the position value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 459-474, July.
    9. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    10. Li, Daniel Li & Shan, Erfang, 2019. "The position value and the structures of graphs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 190-197.
    11. 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.
    12. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
    13. 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.
    14. 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.
    15. Pierre Dehez, 2017. "On Harsanyi Dividends and Asymmetric Values," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 19(03), pages 1-36, September.
    16. Demuynck, Thomas & Rock, Bram De & Ginsburgh, Victor, 2016. "The transfer paradox in welfare space," Journal of Mathematical Economics, Elsevier, vol. 62(C), pages 1-4.
    17. 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.
    18. 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.
    19. Borkotokey, Surajit & Kumar, Rajnish & Sarangi, Sudipta, 2015. "A solution concept for network games: The role of multilateral interactions," European Journal of Operational Research, Elsevier, vol. 243(3), pages 912-920.
    20. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.

    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:eee:matsoc:v:58:y:2009:i:3:p:341-353. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.