IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/612b0000-a66a-435a-a707-29af0807bb3d.html
   My bibliography  Save this paper

Average Convexity in Communication Situations

Author

Listed:
  • Slikker, M.

    (Tilburg University, Center For Economic Research)

Abstract

No abstract is available for this item.

Suggested Citation

  • Slikker, M., 1998. "Average Convexity in Communication Situations," Discussion Paper 1998-12, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:612b0000-a66a-435a-a707-29af0807bb3d
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/528486/12.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Inarra, Elena & Usategui, Jose M, 1993. "The Shapley Value and Average Convex Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 22(1), pages 13-29.
    2. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    3. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    4. van den Nouweland, Anne & Borm, Peter, 1991. "On the Convexity of Communication Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(4), pages 421-430.
    5. 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.
    6. Jesus Marin Solano & Carlos Rafels Pallarola, 1996. "Convexity versus average convexity: potential, pmas, the shapley value and simple games," Working Papers in Economics 3, Universitat de Barcelona. Espai de Recerca en Economia.
    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. Slikker, M., 1998. "Average Convexity in Communication Situations," Other publications TiSEM 612b0000-a66a-435a-a707-2, Tilburg University, School of Economics and Management.
    2. Alexandre Skoda & Xavier Venel, 2022. "Weighted Average-convexity and Cooperative Games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-03717539, HAL.
    3. Slikker, M., 1999. "Link Monotonic Allocation Schemes," Other publications TiSEM 42bfa59c-dba6-427e-ac48-9, Tilburg University, School of Economics and Management.
    4. Alexandre Skoda & Xavier Venel, 2022. "Weighted Average-convexity and Cooperative Games," Documents de travail du Centre d'Economie de la Sorbonne 22016, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    5. Marco Slikker, 2005. "Link Monotonic Allocation Schemes," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
    6. Alexandre Skoda & Xavier Venel, 2022. "Weighted Average-convexity and Cooperative Games," Post-Print halshs-03717539, HAL.
    7. 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.
    8. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    9. E. Algaba & J.M. Bilbao & J.J. López, 2001. "A unified approach to restricted games," Theory and Decision, Springer, vol. 50(4), pages 333-345, June.
    10. 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.
    11. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    12. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Other publications TiSEM f5cc3272-7570-4e25-895d-e, Tilburg University, School of Economics and Management.
    13. Anne Van Den Nouweland & Peter Borm & Guillermo Owen & Stef Tijs, 1993. "Cost allocation and communication," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 733-744, August.
    14. 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.
    15. Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Research Memorandum FEW 538, Tilburg University, School of Economics and Management.
    16. 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.
    17. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Post-Print hal-01305005, HAL.
    18. 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.
    19. 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.
    20. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.

    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:tiu:tiucen:612b0000-a66a-435a-a707-29af0807bb3d. 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.