IDEAS home Printed from https://ideas.repec.org/p/tiu/tiurem/f5cc3272-7570-4e25-895d-e0e0a733e970.html
   My bibliography  Save this paper

Controlled communication networks

Author

Listed:
  • Feltkamp, V.
  • van den Nouweland, C.G.A.M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Feltkamp, V. & van den Nouweland, C.G.A.M., 1992. "Controlled communication networks," Research Memorandum FEW 538, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiurem:f5cc3272-7570-4e25-895d-e0e0a733e970
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    4. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    5. Tijs, S.H. & Parthasarathy, T. & Potters, J.A.M. & Rajendra Prasad, V., 1984. "Permutation games : Another class of totally balanced games," Other publications TiSEM a7edfa18-6224-4be3-b677-5, Tilburg University, School of Economics and Management.
    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. Susana López & Guillermo Owen & Martha Saboya, 2022. "The impact of intermediaries on a negotiation: an approach from game theory," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 30(3), pages 837-859, September.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    7. Slikker, M., 1998. "Average Convexity in Communication Situations," Other publications TiSEM 612b0000-a66a-435a-a707-2, Tilburg University, School of Economics and Management.
    8. 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.
    9. 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.
    10. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Post-Print hal-01305005, HAL.
    11. Slikker, M., 1998. "Average Convexity in Communication Situations," Discussion Paper 1998-12, Tilburg University, Center for Economic Research.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. 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.
    18. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
    19. 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).
    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

    Keywords

    Game Theory; game theory;

    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:tiurem:f5cc3272-7570-4e25-895d-e0e0a733e970. 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: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.