IDEAS home Printed from https://ideas.repec.org/p/mse/cesdoc/25019.html
   My bibliography  Save this paper

Dynamic Network Formation with Farsighted Players and Limited Capacities

Author

Abstract

We investigate a T-stage dynamic network formation game with linear-quadratic payoffs. Players interact through network which they create as a result of their actions. We study two versions of the dynamic game and provide the equilibrium analysis. First, we assume that players sequentially propose links to others with whom they want to connect and choose the levels of contribution for their links. The players have limited total contributions or capacities for forming links at every stage which can differ among players and over time. They cannot delete links, but the principle of natural elimination of links with no contribution is adopted. Next, we assume that the players simultaneously and independently propose links to other players and have overall limited capacities for the whole game, and not for each stage. This means that every player can redistribute the capacity not only over links, but also over time. The equilibrium concept for the first version of the dynamic game is subgame perfect equilibrium, while it is the Nash equilibrium in open-loop strategies for the second version. Both models are illustrated with numerical examples

Suggested Citation

  • Michel Grabisch & Elena Parilina & Agnieszka Rusinowska & Georges Zaccour, 2025. "Dynamic Network Formation with Farsighted Players and Limited Capacities," Documents de travail du Centre d'Economie de la Sorbonne 25019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    • Handle: RePEc:mse:cesdoc:25019
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-05274180
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games

    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:mse:cesdoc:25019. 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: Lucie Label (email available below). General contact details of provider: https://edirc.repec.org/data/cenp1fr.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.