DATA AND AI ARE CHANGING THE WAY ORGANIZATIONS THINK, DECIDE, AND ORGANIZE. IT’S TIME HUMANITIES, MANAGEMENT AND SOCIAL SCIENCES GET INVOLVED.
Metalab

NEWS

Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.

EVENTS

[ARTICLE] This paper investigates the impact of transaction costs on the viability of strategic alliances in service network design, highlighting that such costs can significantly influence the attractiveness of the collaboration.

by Claudia Archetti (ESSEC Business School), Okan Arslan, Ola Jabali, Gilbert Laporte, Maria Grazia Speranza

Strategic alliances are established between firms to improve their competitiveness in markets and generally appear in the form of joint ventures. Such collaborative efforts require centralized planning, and the survival of the alliance largely depends on the success of joint planning processes. In this regard, we investigate the opportunities that centralized collaboration can offer to firms when designing their service networks. Apart from the classical fixed and variable costs associated with the network design, we also consider transaction costs induced by the formation of the alliance, which can broadly be defined as cost components related to the coordination and monitoring of the people, efforts and resources. We concentrate on bilateral alliances and develop alternative models for solving their associated network design problem. We also adopt a state-of-the-art heuristic to solve large-scale instances. Our findings confirm that accounting for the transaction cost in network design is vital for the alliance. These transaction costs can be high enough to even render the collaboration unattractive. Hence, careful data collection and model treatment are required before deciding whether to form an alliance.

[Please read the research paper here]

[ARTICLE] This article compares various panel data methods, highlighting the benefits of the general cross-lagged model (GCLM) over static models and other dynamic models.

Co-authored by Ali Shamsollahi (ESSEC Business School), Michael J. Zyphur, Paul D. Allison, Louis Tay et al.

This article compares a general cross-lagged model (GCLM) to other panel data methods based on their coherence with a causal logic and pragmatic concerns regarding modeled dynamics and hypothesis testing. We examine three “static” models that do not incorporate temporal dynamics: random- and fixed-effects models that estimate contemporaneous relationships; and latent curve models. We then describe “dynamic” models that incorporate temporal dynamics in the form of lagged effects: cross-lagged models estimated in a structural equation model (SEM) or multilevel model (MLM) framework; Arellano-Bond dynamic panel data methods; and autoregressive latent trajectory models. We describe the implications of overlooking temporal dynamics in static models and show how even popular cross-lagged models fail to control for stable factors over time. We also show that Arellano-Bond and autoregressive latent trajectory models have various shortcomings. By contrasting these approaches, we clarify the benefits and drawbacks of common methods for modeling panel data, including the GCLM approach we propose. We conclude with a discussion of issues regarding causal inference, including difficulties in separating different types of time-invariant and time-varying effects over time.

[Please read the research paper here]

[ARTICLE] This paper introduces a general cross-lagged panel model (GCLM) for causal inference with longitudinal panel data within a structural equation modeling framework.

Co-authored by Ali Shamsollahi (ESSEC Business School), Michael J. Zyphur, Paul D. Allison, Louis Tay et al.

This is the first paper in a series of two that synthesizes, compares, and extends methods for causal inference with longitudinal panel data in a structural equation modeling (SEM) framework. Starting with a cross-lagged approach, this paper builds a general cross-lagged panel model (GCLM) with parameters to account for stable factors while increasing the range of dynamic processes that can be modeled. We illustrate the GCLM by examining the relationship between national income and subjective well-being (SWB), showing how to examine hypotheses about short-run (via Granger-Sims tests) versus long-run effects (via impulse responses). When controlling for stable factors, we find no short-run or long-run effects among these variables, showing national SWB to be relatively stable, whereas income is less so. Our second paper addresses the differences between the GCLM and other methods.

[Please read the research paper here]

[ARTICLE] This paper explores how software prototypes function as boundary objects in agile development, identifying four effective prototype use practices.

by Thomas Huber (ESSEC Business School), Maike A.E. Winkler, Jens Dibbern, Carol V. Brown

Bridging knowledge boundaries among project team members is essential to prevent delays or complete failure of software development projects. Prior researchers have reported that software prototypes can be used to help bridge knowledge boundaries between team members in traditional software development settings, yet their use in an agile development setting remains unexplored. Agile development centers the interactions between team members on emerging representations of the prototype whose properties are prone to change over time. Therefore, we conducted an in‐depth study of an agile development project to enhance our understanding on how software prototypes are used as boundary objects in a distributed team setting. Our analyses of team member interactions during 46 virtual meetings that took place over a period of 6 months revealed four different prototype use practices (exemplifying, contrasting, relating, framing) that were effective in bridging syntactic, semantic, or pragmatic knowledge boundaries. We also provide empirically grounded evidence of how variations in object properties can afford different use practices, how the use practices take advantage of these properties, and how object properties are reshaped through these use practices as different types of knowledge boundaries are bridged. These findings bear important implications for research on prototypes as boundary objects in software development in particular and boundary object use in general.

[Please read the research paper here]

[ARTICLE] This paper addresses the Dynamic Traveling Salesman Problem with Stochastic Release Dates (DTSP-srd), proposing a Markov Decision Process and reoptimization approach with stochastic and deterministic models.

by Claudia Archetti (ESSEC Business School), Dominique Feillet, Andrea Mor, Maria Grazia Speranza

The dynamic traveling salesman problem with stochastic release dates (DTSP-srd) is a problem in which a supplier has to deliver parcels to its customers. These parcels are delivered to its depot while the distribution is taking place. The arrival time of a parcel to the depot is called its release date. In the DTSP-srd, release dates are stochastic and dynamically updated as the distribution takes place. The objective of the problem is the minimization of the total time needed to serve all customers, given by the sum of the traveling time and the waiting time at the depot. The problem is represented as a Markov Decision Process and is solved through a reoptimization approach. Two models are proposed for the problem to be solved at each stage. The first model is stochastic and exploits the entire probabilistic information available for the release dates. The second model is deterministic and uses an estimation of the release dates. An instance generation procedure is proposed to simulate the evolution of the information to perform computational tests. The results show that a more frequent reoptimization provides better results across all tested instances and that the stochastic model performs better than the deterministic model. The main drawback of the stochastic model lies in the computational time required to evaluate a solution, which makes an iteration of the heuristic substantially more time-consuming than in the case where the deterministic model is used.

[Please read the research paper here]

[ARTICLE] This paper introduces a mixed integer linear programming model for the Inventory Routing Problem with Pickups and Deliveries (IRP-PD), enhanced with new valid inequalities and a branch-and-cut algorithm, achieving significant improvements in solving large instances.

by Claudia Archetti (ESSEC Business School), M. Grazia Speranza, Maurizio Boccia, Antonio Sforza, Claudio Sterle

This paper addresses the Inventory Routing Problem with Pickups and Deliveries (IRP-PD). A single commodity has to be picked up from several origins and distributed to several destinations. The commodity is made available at the supplier depot and at the pickup customers, with known amounts in each period of a discretized time horizon. The commodity is consumed by the delivery customers, whose demand, in each period of the time horizon, is known. The vehicles start and end their routes at the supplier depot. The objective is to determine a collection and distribution plan minimizing the sum of routing and inventory costs, satisfying inventory and capacity constraints. A mixed integer linear programming model is presented for the IRP-PD. Valid inequalities are proposed that are adapted from the inventory routing, the vehicle routing and the lot-sizing problems literature. Moreover, a new set of valid inequalities, called interval inequalities, is presented. A branch-and-cut algorithm is designed and tested on a large set of instances. Computational results show that the proposed approach is able to solve to optimality 946 out of 1280 instances. Moreover, the approach outperforms the state-of-the art method for the single vehicle case, increasing the number of instances solved to optimality from 473 to 538 out of 640 instances tested, with 133 new best known solutions.

[Please read the research paper here]

[ARTICLE] This paper evaluates how well bibliometric data and theories predict author impact and breakthroughs in research, finding limited explanatory power and suggesting improvements through machine learning.

by Sen Chai (ESSEC Business School), Alexander D’Amour, Lee Fleming

Following widespread availability of computerized databases, much research has correlated bibliometric measures from papers or patents to subsequent success, typically measured as the number of publications or citations. Building on this large body of work, we ask the following questions: given available bibliometric information in one year, along with the combined theories on sources of creative breakthroughs from the literatures on creativity and innovation, how accurately can we explain the impact of authors in a given research community in the following year? In particular, who is most likely to publish, publish highly cited work, and even publish a highly cited outlier? And, how accurately can these existing theories predict breakthroughs using only contemporaneous data? After reviewing and synthesizing (often competing) theories from the literatures, we simultaneously model the collective hypotheses based on available data in the year before RNA interference was discovered. We operationalize author impact using publication count, forward citations, and the more stringent definition of being in the top decile of the citation distribution. Explanatory power of current theories altogether ranges from less than 9% for being top cited to 24% for productivity. Machine learning (ML) methods yield similar findings as the explanatory linear models, and tangible improvement only for non-linear Support Vector Machine models. We also perform predictions using only existing data until 1997, and find lower predictability than using explanatory models. We conclude with an agenda for future progress in the bibliometric study of creativity and look forward to ML research that can explain its models.

[Please read the research paper here]

[ARTICLE] This paper proposes two integer programming formulations for the directed network design problem with relays (DNDPR) and demonstrates that branch-and-cut algorithms significantly outperform previous methods.

by Ivana Ljubić (ESSEC Business School), Markus Leitner, Martin Riedler, Mario Ruthmair

We study the directed network design problem with relays (DNDPR) whose aim is to construct a minimum cost network that enables the communication of a given set of origin-destination pairs. Thereby, expensive signal regeneration devices need to be placed to cover communication distances exceeding a predefined threshold. Applications of the DNDPR arise in telecommunications and transportation. We propose two new integer programming formulations for the DNDPR. The first one is a flow-based formulation with a pseudo-polynomial number of variables and constraints and the second is a cut-based formulation with an exponential number of constraints. Fractional distance values are handled efficiently by augmenting both models with an exponentially-sized set of infeasible path constraints. We develop branch-and-cut algorithms and also consider valid inequalities to strengthen the obtained dual bounds and to speed up convergence. The results of our extensive computational study on diverse sets of benchmark instances show that our algorithms outperform the previous state-of-the-art method based on column generation.

[Please read the research paper here]

[ARTICLE] This study develops a framework showing how digitalization of unorganized retail in emerging markets transforms socio-economic conditions for subsistence consumer-merchants.

by Malobi Mukherjee (ESSEC Business School), Jacob Wood

This study explores whether digitalisation of unorganised retail (UR) businesses in emerging markets have a positive socio-economic impact on the lives of the subsistence consumer–merchants who perform the dual role of being, not only consumers providing for themselves and their families, but also the managers of micro-UR businesses. We develop a framework for sustainable business model innovation at the base of the pyramid by undertaking content analysis of 65 newspaper articles (interviews with senior executives and founders of digital app-based platforms, expert analysis) as well as social media and YouTube testimonials of UR business users of these platforms in Vietnam, Indonesia, Malaysia and the Philippines. Using the Gioian coding structure of open and second order comparative coding, we develop a framework for sustainable business model innovation from the base of the pyramid perspective. The framework captures how digitalisation enables the UR businesses to circumvent resource shortages, consolidate procurement and inventory management and diversify product and service offerings, which leads to significant economic and social transformation for both the micro enterprises and their owners. Our framework contributes to the emergent literature on sustainable business model innovation and inclusive innovation in resource-constrained contexts. We conclude that sustainable business model innovations enable socio-economic transformations similar to those experienced by UR businesses in emerging Asian markets. Such developments can create local level pathways for local tropical countries seeking to achieve UN social development goals.

[Please read the research paper here]

[ARTICLE] This paper proposes a new parameter constraint for non-Gaussian mixture models using a small dictionary of elements.

by Pierre Alquier (ESSEC Business School), Léna Carel

Mixture models are among the most popular tools for clustering. However, when the dimension and the number of clusters is large, the estimation of the clusters become challenging, as well as their interpretation. Restriction on the parameters can be used to reduce the dimension. An example is given by mixture of factor analyzers for Gaussian mixtures. The extension of MFA to non-Gaussian mixtures is not straightforward. We propose a new constraint for parameters in non-Gaussian mixture model: the K components parameters are combinations of elements from a small dictionary, say H elements, with H≪K. Including a nonnegative matrix factorization (NMF) in the EM algorithm allows us to simultaneously estimate the dictionary and the parameters of the mixture. We propose the acronym NMF-EM for this algorithm, implemented in the R package nmfem. This original approach is motivated by passengers clustering from ticketing data: we apply NMF-EM to data from two Transdev public transport networks. In this case, the words are easily interpreted as typical slots in a timetable.

[Please read the research paper here]

Founded in 2020 by ESSEC Business School, The Institute for AI and Business for Artificial Intelligence, Data and Society helps organizations navigate and better understand the social, economic, cultural, and ethical impacts of AI and data

metalab@essec.edu

Learn more about the Institute for AI and Business

copyright © 2026 Institute for AI and Business

↓
Résumé de la politique de confidentialité

Ce site utilise des cookies afin que nous puissions vous fournir la meilleure expérience utilisateur possible. Les informations sur les cookies sont stockées dans votre navigateur et remplissent des fonctions telles que vous reconnaître lorsque vous revenez sur notre site Web et aider notre équipe à comprendre les sections du site que vous trouvez les plus intéressantes et utiles.