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

Too many options: How to identify coalitions in a policy network?

Author

Listed:
  • Thibaud Deguilhem

    (LADYSS - Laboratoire Dynamiques Sociales et Recomposition des Espaces - UP1 - Université Paris 1 Panthéon-Sorbonne - UP8 - Université Paris 8 Vincennes-Saint-Denis - UPN - Université Paris Nanterre - CNRS - Centre National de la Recherche Scientifique - UPCité - Université Paris Cité)

  • Juliette Schlegel

    (LADYSS - Laboratoire Dynamiques Sociales et Recomposition des Espaces - UP1 - Université Paris 1 Panthéon-Sorbonne - UP8 - Université Paris 8 Vincennes-Saint-Denis - UPN - Université Paris Nanterre - CNRS - Centre National de la Recherche Scientifique - UPCité - Université Paris Cité)

  • Jean-Philippe Berrou

    (LAM - Les Afriques dans le monde - IEP Bordeaux - Sciences Po Bordeaux - Institut d'études politiques de Bordeaux - IRD - Institut de Recherche pour le Développement - Institut d'Études Politiques [IEP] - Bordeaux - UBM - Université Bordeaux Montaigne - CNRS - Centre National de la Recherche Scientifique)

  • Ousmane Djibo

    (IRD Représentation du Niger - IRD - Institut de Recherche pour le Développement)

  • Alain Piveteau

    (LAM - Les Afriques dans le monde - IEP Bordeaux - Sciences Po Bordeaux - Institut d'études politiques de Bordeaux - IRD - Institut de Recherche pour le Développement - Institut d'Études Politiques [IEP] - Bordeaux - UBM - Université Bordeaux Montaigne - CNRS - Centre National de la Recherche Scientifique)

Abstract

For different currents in policy analysis as policy networks and the Advocacy Coalition Framework (ACF), identifying coalitions from policy beliefs and coordination between actors is crucial to a precise understanding of a policy process. Focusing particularly the relational dimension of ACF approaches linked with policy network analysis, determining policy subsystems from the actor collaborations and exchanges has recently begun offering fertile links with the network analysis. Studies in this way frequently apply Block Modeling and Community Detection (BMCD) strategies to define homogeneous political groups. However, the BMCD literature is growing quickly, using a wide variety of algorithms and interesting selection methods that are much more diverse than those used in the policy network analysis and particularly the ACF when this current focused on the collaboration networks before or after regarding the belief distance between actors. Identifying the best methodological option in a specific context can therefore be difficult and few ACF studies give an explicit justification. On the other hand, few BMCD publications offer a systematic comparison of real social networks and they are never applied to policy network datasets. This paper offers a new, relevant 5-Step selection method to reconcile advances in both the policy networks/ACF and BMCD. Using an application based on original African policy network data collected in Madagascar and Niger, we provide a useful set of practical recommendations for future ACF studies using policy network analysis: (i) the density and size of the policy network affect the identification process, (ii) the ''best algorithm'' can be rigorously determined by maximizing a novel indicator based on convergence and homogeneity between algorithm results, (iii) researchers need to be careful with missing data: they affect the results and imputation does not solve the problem.

Suggested Citation

  • Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
  • Handle: RePEc:hal:journl:hal-04689665
    DOI: 10.1016/j.socnet.2024.06.005
    Note: View the original document on HAL open archive server: https://hal.science/hal-04689665
    as

    Download full text from publisher

    File URL: https://hal.science/hal-04689665/document
    Download Restriction: no

    File URL: https://libkey.io/10.1016/j.socnet.2024.06.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. Simon Matti & Annica Sandström, 2013. "The Defining Elements of Advocacy Coalitions: Continuing the Search for Explanations for Coordination and Coalition Structures," Review of Policy Research, Policy Studies Organization, vol. 30(2), pages 240-257, March.
    3. Jochen Markard & Marco Suter & Karin Ingold, 2015. "Socio-technical transitions and policy change - Advocacy coalitions in Swiss energy policy," SPRU Working Paper Series 2015-13, SPRU - Science Policy Research Unit, University of Sussex Business School.
    4. Dana Fisher & Philip Leifeld & Yoko Iwaki, 2013. "Mapping the ideological networks of American climate politics," Climatic Change, Springer, vol. 116(3), pages 523-545, February.
    5. Viengsamay Sengchaleun & Hina Hakim & Sengchanh Kounnavong & Daniel Reinharz, 2022. "Analysis of the Relevance of the Advocacy Coalition Framework to Analyze Public Policies in Non-Pluralist Countries," Social Sciences, MDPI, vol. 11(12), pages 1-11, November.
    6. Jenkins-Smith, Hank C. & Sabatier, Paul A., 1994. "Evaluating the Advocacy Coalition Framework," Journal of Public Policy, Cambridge University Press, vol. 14(2), pages 175-203, April.
    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. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    2. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    3. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    4. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    5. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 2017. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 17(3), pages 275-314, September.
    6. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    7. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    8. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    9. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    10. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 0. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 0, pages 1-40.
    11. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    12. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    13. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    14. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    15. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    16. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    17. L Tang & X Wang, 2008. "An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 590-599, May.
    18. Gintaras Palubeckis & Dalius Rubliauskas, 2012. "A branch-and-bound algorithm for the minimum cut linear arrangement problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 540-563, November.
    19. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    20. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.

    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-04689665. 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: 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.