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 analyzes a game-theoretic model of token-based project financing, comparing its efficiency to equity financing.

by Edmond Baranes (ESSEC Business School), Ulrich Hege, Jin-Hyuk Kim

We analyze a game-theoretic model, in which projects are financed by selling tokens that give access to consumption utility and the initial investors can sell their tokens in a secondary market. The efficiency of projects funded by token and equity financing is compared, and regulatory implications discussed. We then extent the model to consider the token issuer’s ex-post investment incentive, which creates a gap between the size of funds raised and actual capital outlays. If the investors have a naive expectation, then the issuer can sometimes sell the entire token supply and invest nothing, so the project fails. If they have a rational expectation, then the equilibrium investment level becomes more efficient, but there can be still a room for regulatory policies such as setting a floor on the issuer’s token holdings.

[Please read the research paper here]

[ARTICLE] This research demonstrates that machine learning algorithms, particularly random forest classifiers, can effectively classify borrowers into credit categories using readily available data.

by Apostolos Ampountolas (ESSEC Business School), Titus Nyarko Nde, Paresh Date, Corina Constantinescu

In micro-lending markets, lack of recorded credit history is a significant impediment to assessing individual borrowers’ creditworthiness and therefore deciding fair interest rates. This research compares various machine learning algorithms on real micro-lending data to test their efficacy at classifying borrowers into various credit categories. We demonstrate that off-the-shelf multi-class classifiers such as random forest algorithms can perform this task very well, using readily available data about customers (such as age, occupation, and location). This presents inexpensive and reliable means to micro-lending institutions around the developing world with which to assess creditworthiness in the absence of credit history or central credit databases.

[Please read the research paper here]

[ARTICLE] This study presents a machine learning framework incorporating text analysis of keyword series to improve hotel demand predictions.

by Apostolos Ampountolas (ESSEC Business School), Mark P. Legg

Purpose
This study aims to predict hotel demand through text analysis by investigating keyword series to increase demand predictions’ precision. To do so, this paper presents a framework for modeling hotel demand that incorporates machine learning techniques.

Design/methodology/approach
The empirical forecasting is conducted by introducing a segmented machine learning approach of leveraging hierarchical clustering tied to machine learning and deep learning techniques. These features allow the model to yield more precise estimates. This study evaluates an extensive range of social media–derived words with the most significant probability of gradually establishing an understanding of an optimal outcome. Analyzes were performed on a major hotel chain in an urban market setting within the USA.

Findings
The findings indicate that while traditional methods, being the naïve approach and ARIMA models, struggled with forecasting accuracy, segmented boosting methods (XGBoost) leveraging social media predict hotel occupancy with greater precision for all examined time horizons. Additionally, the segmented learning approach improved the forecasts’ stability and robustness while mitigating common overfitting issues within a highly dimensional data set.

Research limitations/implications
Incorporating social media into a segmented learning framework can augment the current generation of forecasting methods’ accuracy. Moreover, the segmented learning approach mitigates the negative effects of market shifts (e.g. COVID-19) that can reduce in-production forecasts’ life-cycles. The ability to be more robust to market deviations will allow hospitality firms to minimize development time.

Originality/value
The results are expected to generate insights by providing revenue managers with an instrument for predicting demand.

[Please read the research paper here]

[ARTICLE] This paper evaluates various traditional time series forecasting models for daily hotel demand across multiple horizons, finding that the SARIMAX model with exogenous variables outperformed other models.

by Apostolos Ampountolas (ESSEC Business School)

Overnight forecasting is a crucial challenge for revenue managers because of the uncertainty associated between demand and supply. However, there is limited research that focuses on predicting daily hotel demand. Hence, this paper evaluates various models’ of traditional time series forecasting performances for daily demand at multiple horizons. The models include the seasonal naïve, Holt–Winters (HW) triple exponential smoothing, an autoregressive integrated moving average (ARIMA), a seasonal autoregressive integrated moving average (SARIMAX) with exogenous variables, multilayer perceptron (MLP) artificial neural networks model (ANNs), an sGARCH, and GJR-GARCH models. The dataset of this study contains daily demand observations from a hotel in a US metropolitan city from 2015 to 2019 and a set of exogenous social and environmental features such as temperature, holidays, and hotel competitive set ranking. Experimental results indicated that under the MAPE accuracy measure: (i) the SARIMAX model with external regressors outperformed the ANN-MLP model with similar external regressors and the other models, in every one horizon except one out of seven forecast horizons; (ii) the sGARCH(4, 2) and GJR-GARCH(4, 2) shows a superior predictive accuracy at all horizons. The results performance is evaluated by conducting pairwise comparisons between the different model’s distribution of forecasts using Diebold–Mariano and Harvey–Leybourne–Newbold tests. The results are significant for revenue managers because they provide valuable insights into the exogenous variables that impact accurate daily demand forecasting.

[Please read the research paper here]

[ARTICLE] This paper proposes a generic data model for prosopographic databases, enhancing their quality by integrating concepts like uncertainty, reliability, accuracy, and completeness.

by Isabelle Wattiau, Jacky Akoka (ESSEC Business School), Stéphane Lamasse, Cédric du Mouza

Prosopographic databases, which allow the study of social groups through their bibliography, are used today by a significant number of historians. Computerization has allowed intensive and large-scale exploitation of these databases. The modeling of these proposopographic databases has given rise to several data models. An important problem is to ensure a level of quality of the stored information. In this article , we propose a generic data model allowing to describe most of the existing prosopographic databases and to enrich them by integrating several quality concepts such as uncertainty, reliability, accuracy or completeness.

[Please read the research paper here]

[ARTICLE] This paper reviews bilevel optimization, which models hierarchical decision processes and is challenging to solve.

by Ivana Ljubić (ESSEC Business School), Thomas Kleinert, Martine Labbé, Martin Schmidt

Bilevel optimization is a field of mathematical programming in which some variables are constrained to be the solution of another optimization problem. As a consequence, bilevel optimization is able to model hierarchical decision processes. This is appealing for modeling real-world problems, but it also makes the resulting optimization models hard to solve in theory and practice. The scientific interest in computational bilevel optimization increased a lot over the last decade and is still growing. Independent of whether the bilevel problem itself contains integer variables or not, many state-of-the-art solution approaches for bilevel optimization make use of techniques that originate from mixed-integer programming. These techniques include branch-and-bound methods, cutting planes and, thus, branch-and-cut approaches, or problem-specific decomposition methods. In this survey article, we review bilevel-tailored approaches that exploit these mixed-integer programming techniques to solve bilevel optimization problems. To this end, we first consider bilevel problems with convex or, in particular, linear lower-level problems. The discussed solution methods in this field stem from original works from the 1980’s but, on the other hand, are still actively researched today. Second, we review modern algorithmic approaches to solve mixed-integer bilevel problems that contain integrality constraints in the lower level. Moreover, we also briefly discuss the area of mixed-integer nonlinear bilevel problems. Third, we devote some attention to more specific fields such as pricing or interdiction models that genuinely contain bilinear and thus nonconvex aspects. Finally, we sketch a list of open questions from the areas of algorithmic and computational bilevel optimization, which may lead to interesting future research that will further propel this fascinating and active field of research.

[Please read the research paper here]

[ARTICLE] This article develops an ROI content valuation framework for digital video subscription platforms.

by Raoul Kübler (ESSEC Business School), Rouven Seifert, Michael Kandziora

For digital video subscription platforms, creating and managing content portfolios are critical to acquire new customers, retain existing customers, leverage cross-sales, and generate advertising revenues. We treat content portfolios as a form of pure bundling which may vary in composition and attractiveness over time. Therefore, evaluating the value contribution of each content piece is essential to manage a platform’s portfolio efficiently and to understand how a specific content piece contributes to the bundle’s attractiveness. In this article, we develop an ROI content valuation framework for a digital film subscription platform. This framework describes how a single piece of content diffuses through consumers’ journeys and influences subscription fees through acquisition and retention as well as revenues from cross-sales and advertising. This conceptual approach allows us to address the heterogeneity across content and platform contingencies such as exclusive availability and platform specifics, and link them to revenue streams. Building on this framework, we offer avenues for future research and provide potential lead performance indicators together with their operationalization, enabling all parties involved in the production, marketing, distribution, and sales of content to determine the platform-specific value of a content piece.

[Please read the research paper here]

[ARTICLE] An integer linear programming-based solution strategy has been developed for leaf sweeping operations in Trenque Lauquen, Argentina, optimizing sweeper assignments, leaf bag deposit points, and collection truck routes.

by Diego Delle Donne (ESSEC Business School), Valeria Di Tomaso, Guillermo Duran

A solution strategy based on integer linear programming models has been developed for leaf sweeping operations in the Argentine city of Trenque Lauquen. The aim is to achieve efficiency in the assignment of sweepers to city blocks, the identification of leaf bag deposit points and the routes to be followed by collection trucks for leaf bag pickup. Previous to this strategy, sweeper assignments were improvised and inefficient, with blocks often left unswept. Furthermore, no method was available for accurately determining the number of sweepers needed to ensure either full coverage of all city zones within the working day or a balanced work load distribution across all sweepers. Application of the solution strategy by the city has resulted in efficient definitions of sweeper requirements while optimizing sweeper assignments such that all blocks are covered. Once the strategy is fully implemented, the number of bag deposit points under the manual definitions should be reduced by roughly one-half and the total travel distance of the truck routes, modelled as an asymmetric travelling salesman problem, should be cut by 10–15% with the consequent savings in time, vehicle use and fuel consumption.

[Please read the research paper here]

[ARTICLE] This paper studies the Minimum Sum Coloring Problem (MSCP) and introduces the first branch-and-price algorithm to solve it to proven optimality.

by Diego Delle Donne (ESSEC Business School), Fabio Furini, Enrico Malaguti, Roberto Wolfler Calvo

A proper coloring of a given graph is an assignment of a positive integer number (color) to each vertex such that two adjacent vertices receive different colors. This paper studies the Minimum Sum Coloring Problem (MSCP), which asks for finding a proper coloring while minimizing the sum of the colors assigned to the vertices. We propose the first branch-and-price algorithm to solve the MSCP to proven optimality. The newly developed exact approach is based on an Integer Programming (IP) formulation with an exponential number of variables which is tackled by column generation. We present extensive computational experiments, on synthetic and benchmark DIMACS graphs from the literature, to compare the performance of our newly developed branch-and-price algorithm against three compact IP formulations. On synthetic graphs, our algorithm outperforms the compact formulations in terms of: (i) number of solved instances, (ii) running times and (iii) exit gaps obtained when optimality is not achieved. For the DIMACS instances, our algorithm is competitive with the best compact formulation and provides very strong dual bounds.

[Please read the research paper here]

[ARTICLE] This paper addresses the Double Traveling Salesman Problem with Multiple Stacks (DTSPMS), focusing on its computational aspects, demonstrating polynomial complexity under certain conditions for key subproblems.

by Laurent Alfandari (ESSEC Business School), Sophie Toulouse

The Double Traveling Salesman Problem with Multiple Stacks, DTSPMS, deals with the collect and delivery of n commodities in two distinct cities, where the pickup and the delivery tours are related by LIFO constraints. During the pickup tour, commodities are loaded into a container of k rows, or stacks, with capacity c. This paper focuses on computational aspects of the DTSPMS, which is NP-hard. We first review the complexity of two critical subproblems: deciding whether a given pair of pickup and delivery tours is feasible and, given a loading plan, finding an optimal pair of pickup and delivery tours, are both polynomial under some conditions on k and c. We then prove a (3k)/2 standard approximation for the Min Metric k DTSPMS, where k is a universal constant, and other approximation results for various versions of the problem. We finally present a matching-based heuristic for the 2 DTSPMS, which is a special case with k=2 rows, when the distances are symmetric. This yields a 1/2−o(1), 3/4−o(1) and 3/2+o(1) standard approximation for respectively Max 2 DTSPMS, its restriction Max 2 DTSPMS(1,2) with distances 1 and 2, and Min 2 DTSPMS(1,2), and a 1/2−o(1) differential approximation for Min 2 DTSPMS and Max 2 DTSPMS.

[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.