Marco Mussi

Marco Mussi

Auto-generated profile, based on publicly available information

Marco Mussi

Politecnico di Milano Milan Italy

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 January 2024 in Journal of Energy Storage
Verified
Journal Article
Open access
MMMarco Mussi
Marco Mussi
LPLuigi Pellegrino
Luigi Pellegrino
OPOscar Francesco Pindaro
Oscar Francesco Pindaro
MRMarcello Restelli
Marcello Restelli
Francesco TrovòFrancesco Trovò
Francesco Trovò

28 March 2023 in Expert Systems with Applications
Verified
Journal Article
Open access
MMMarco Mussi
Marco Mussi
DLDavide Lombarda
Davide Lombarda
AMAlberto Maria Metelli
Alberto Maria Metelli
Francesco TrovòFrancesco Trovò
Francesco Trovò
MRMarcello Restelli
Marcello Restelli

23 May 2025 in Artificial Intelligence
Verified
Journal Article
Open access
MMMarco Mussi
Marco Mussi
SDSimone Drago
Simone Drago
MRMarcello Restelli
Marcello Restelli
AMAlberto Maria Metelli
Alberto Maria Metelli

27 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
MMMarco Mussi
Marco Mussi
MRMarcello Restelli
Marcello Restelli
Traditional pricing paradigms, once dominated by static models and rule-based heuristics, are increasingly being replaced by dynamic, data-driven approaches powered by machine learning algorithms. Despite their growing sophistication, most dynamic pricing algorithms focus on optimizing the price of each product independently, disregarding potential interactions among items. By neglecting these interdependencies in consumer demand across related goods, sellers may fail to capture the full potential of coordinated pricing strategies. In this paper, we address this problem by exploring dynamic pricing mechanisms designed explicitly for complementary products, aiming to exploit their joint demand structure to maximize overall revenue. We present an online learning algorithm considering both positive and negative interactions between products' demands. The algorithm utilizes transaction data to identify advantageous complementary relationships through an integer programming problem between different items, and then optimizes pricing strategies using data-driven and computationally efficient multi-armed bandit solutions based on heteroscedastic Gaussian processes. We validate our solution in a simulated environment, and we demonstrate that our solution improves the revenue w.r.t. a comparable learning algorithm ignoring such interactions.

9 September 2024 in arXiv
Verified
Preprint
Open access
PDF file
GGGianmarco Genalti
Gianmarco Genalti
MMMarco Mussi
Marco Mussi
NGNicola Gatti
Nicola Gatti
MRMarcello Restelli
Marcello Restelli
MCMatteo Castiglioni
Matteo Castiglioni
AMAlberto Maria Metelli
Alberto Maria Metelli
Rested and Restless Bandits are two well-known bandit settings that are useful to model real-world sequential decision-making problems in which the expected reward of an arm evolves over time due to the actions we perform or due to the nature. In this work, we propose Graph-Triggered Bandits (GTBs), a unifying framework to generalize and extend rested and restless bandits. In this setting, the evolution of the arms' expected rewards is governed by a graph defined over the arms. An edge connecting a pair of arms $(i,j)$ represents the fact that a pull of arm $i$ triggers the evolution of arm $j$, and vice versa. Interestingly, rested and restless bandits are both special cases of our model for some suitable (degenerated) graph. As relevant case studies for this setting, we focus on two specific types of monotonic bandits: rising, where the expected reward of an arm grows as the number of triggers increases, and rotting, where the opposite behavior occurs. For these cases, we study the optimal policies. We provide suitable algorithms for all scenarios and discuss their theoretical guarantees, highlighting the complexity of the learning problem concerning instance-dependent terms that encode specific properties of the underlying graph structure.

30 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
MMMarco Mussi
Marco Mussi
AMAlberto Maria Metelli
Alberto Maria Metelli
MRMarcello Restelli
Marcello Restelli
In many real-world sequential decision-making problems, an action does not immediately reflect on the feedback and spreads its effects over a long time frame. For instance, in online advertising, investing in a platform produces an instantaneous increase of awareness, but the actual reward, i.e., a conversion, might occur far in the future. Furthermore, whether a conversion takes place depends on: how fast the awareness grows, its vanishing effects, and the synergy or interference with other advertising platforms. Previous work has investigated the Multi-Armed Bandit framework with the possibility of delayed and aggregated feedback, without a particular structure on how an action propagates in the future, disregarding possible dynamical effects. In this paper, we introduce a novel setting, the Dynamical Linear Bandits (DLB), an extension of the linear bandits characterized by a hidden state. When an action is performed, the learner observes a noisy reward whose mean is a linear function of the hidden state and of the action. Then, the hidden state evolves according to linear dynamics, affected by the performed action too. We start by introducing the setting, discussing the notion of optimal policy, and deriving an expected regret lower bound. Then, we provide an optimistic regret minimization algorithm, Dynamical Linear Upper Confidence Bound (DynLin-UCB), that suffers an expected regret of order $\widetilde{\mathcal{O}} \Big( \frac{d \sqrt{T}}{(1-\overline{\rho})^{3/2}} \Big)$, where $\overline{\rho}$ is a measure of the stability of the system, and $d$ is the dimension of the action vector. Finally, we conduct a numerical validation on a synthetic environment and on real-world data to show the effectiveness of DynLin-UCB in comparison with several baselines.