IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04090079.html
   My bibliography  Save this paper

Targeting in networks under costly agreements

Author

Listed:
  • Mohamed Belhaj

    (AMSE - Aix-Marseille Sciences Economiques - EHESS - École des hautes études en sciences sociales - AMU - Aix Marseille Université - ECM - École Centrale de Marseille - CNRS - Centre National de la Recherche Scientifique)

  • Frédéric Deroïan

    (AMSE - Aix-Marseille Sciences Economiques - EHESS - École des hautes études en sciences sociales - AMU - Aix Marseille Université - ECM - École Centrale de Marseille - CNRS - Centre National de la Recherche Scientifique)

  • Shahir Safi

    (Concordia University [Montreal])

Abstract

We consider agents organized in an undirected network of local complementarities. A principal with a fixed budget offers costly bilateral contracts in order to increase the sum of agents' effort. We study contracts rewarding effort exceeding the effort made in the absence of the principal. First, targeting a subgroup of the whole society becomes optimal under substantial contracting costs, which significantly increases the computational complexity of the principal's problem. In particular, under sufficiently low intensity of complementarities, a correspondence is established between optimal targeting and an NP-hard problem. Second, for any intensities of complementarities, the optimal unit returns offered to all targeted agents are positive for all contracting costs and in general heterogeneous, even though networks are undirected. Yet, heterogeneity never leads to negative returns, which implies that, with these linear payment schemes, coordination is never an issue for the principal.

Suggested Citation

  • Mohamed Belhaj & Frédéric Deroïan & Shahir Safi, 2023. "Targeting in networks under costly agreements," Post-Print hal-04090079, HAL.
  • Handle: RePEc:hal:journl:hal-04090079
    DOI: 10.1016/j.geb.2023.03.003
    Note: View the original document on HAL open archive server: https://amu.hal.science/hal-04090079
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Bloch, Francis & Shabayek, Shaden, 2023. "Targeting in social networks with anonymized information," Games and Economic Behavior, Elsevier, vol. 141(C), pages 380-402.

    More about this item

    Keywords

    Networked synergies; Optimal targeting; Linear scheme;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal:journl:hal-04090079. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.