Marceau Coupechoux
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marceau Coupechoux has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Jean-Marc Kelif
Orange Innovation 92320 Chatillon France
9 shared publications - Arpan Chattopadhyay
Department of Electrical Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, India
5 shared publications - Lou Salaun
Bell Labs Nokia Paris-Saclay 91620 Nozay France
5 shared publications - Anurag Kumar
Department of Electrical Communication Engineering Indian Institute of Science Bangalore India
4 shared publications - Amrit Singh Bedi
Department of Computer Science Uni- versity of Maryland College Park USA
3 shared publications - Antonio De Domenico
CEA-LETI Grenoble France
3 shared publications
Latest Publications
- Open Access
- 30 April 2026
- Published by MDPI AG in Sustainability
- Vol. 18 (9) , 4410
On the Effects of Buy-Back Policies: A Model of the Smartphone Circular Economy
This article develops a simple model of the smartphone circular economy where the buy-back price offered to consumers is the main control variable. The model explicitly integrates refurbishment, recycling, and premature phone replacement encouraged by buy-back incentives. We distinguish three types of smartphones: premium, basic, and refurbished premium phones. Furthermore, consumers are segmented by buy-back sensitivity: sensitive users tend to return their phones and shorten their device lifespan, while non-sensitive users keep their phones longer. Additionally, refurbished consumers can buy new phones in case of insufficient supply. Our analysis reveals that with realistic parameters, there exists an optimal buy-back level that minimizes CO2eq. emissions and waste, and this optimum coincides with the equilibrium between supply and demand on the refurbished market. However, depending on the system parameters, negative effects can be observed. For example, if most components are replaced during refurbishment, emissions increase with the buy-back. More generally, our results highlight the importance of eco-design. While the model is applied to smartphones, its structure is generic and can be adapted to other products with refurbishment and buy-back incentives.
- 30 April 2026
- Published by MDPI AG in Sustainability
- Vol. 18 (9) , 4410
Open AccessOn the Effects of Buy-Back Policies: A Model of the Smartphone Circular Economy
This article develops a simple model of the smartphone circular economy where the buy-back price offered to consumers is the main control variable. The model explicitly integrates refurbishment, recycling, and premature phone replacement encouraged by buy-back incentives. We distinguish three types of smartphones: premium, basic, and refurbished premium phones. Furthermore, consumers are segmented by buy-back sensitivity: sensitive users tend to return their phones and shorten their device lifespan, while non-sensitive users keep their phones longer. Additionally, refurbished consumers can buy new phones in case of insufficient supply. Our analysis reveals that with realistic parameters, there exists an optimal buy-back level that minimizes CO2eq. emissions and waste, and this optimum coincides with the equilibrium between supply and demand on the refurbished market. However, depending on the system parameters, negative effects can be observed. For example, if most components are replaced during refurbishment, emissions increase with the buy-back. More generally, our results highlight the importance of eco-design. While the model is applied to smartphones, its structure is generic and can be adapted to other products with refurbishment and buy-back incentives.
- Open Access
- 2 March 2026
- Published by Springer Nature in Annals of Telecommunications
- Vol. 81 (9-10) , 1-15
Radio access network carbon footprint in France: historical trend and prospective scenarios
While the ITU has set ambitious CO2eq reduction targets for the Information and Communication Technologies (ICT) sector, it is of upmost importance to estimate the carbon footprint of mobile networks at the country level. Indeed, mobile networks drive the dynamics of the sector, and several policies are implemented at the national level to stick to a decarbonization trajectory. In this paper, we adopt a bottom-up approach to estimate the carbon footprint of the Radio Access Network (RAN) in France based on public data sets, well-accepted models, and realistic figures. We show that the French mobile networks have been characterized by an almost constant growth in terms of the number of equipment, energy consumption, and carbon footprint since 2015. With our assumptions, the Compound Annual Growth Rate (CAGR) of the total carbon footprint is estimated to be $$+13$$ % for the period 2015–2024. The CAGR would decelerate between $$+1$$ % and $$+3.4$$ % for the period 2024–2030 due to the combined effect of energy efficiency gains and decarbonization of the electric mix. In order to enlighten the public debate, we test the hypothesis of faster energy efficiency gains, technology modernization, higher network sharing, longer equipment lifetime, and sobriety measures for the 2030 horizon. With our assumptions, we show that ITU objectives can only be achieved when all positive effects are combined and drastic measures are taken.- 2 March 2026
- Published by Springer Nature in Annals of Telecommunications
- Vol. 81 (9-10) , 1-15
Open AccessRadio access network carbon footprint in France: historical trend and prospective scenarios
While the ITU has set ambitious CO2eq reduction targets for the Information and Communication Technologies (ICT) sector, it is of upmost importance to estimate the carbon footprint of mobile networks at the country level. Indeed, mobile networks drive the dynamics of the sector, and several policies are implemented at the national level to stick to a decarbonization trajectory. In this paper, we adopt a bottom-up approach to estimate the carbon footprint of the Radio Access Network (RAN) in France based on public data sets, well-accepted models, and realistic figures. We show that the French mobile networks have been characterized by an almost constant growth in terms of the number of equipment, energy consumption, and carbon footprint since 2015. With our assumptions, the Compound Annual Growth Rate (CAGR) of the total carbon footprint is estimated to be $$+13$$ % for the period 2015–2024. The CAGR would decelerate between $$+1$$ % and $$+3.4$$ % for the period 2024–2030 due to the combined effect of energy efficiency gains and decarbonization of the electric mix. In order to enlighten the public debate, we test the hypothesis of faster energy efficiency gains, technology modernization, higher network sharing, longer equipment lifetime, and sobriety measures for the 2030 horizon. With our assumptions, we show that ITU objectives can only be achieved when all positive effects are combined and drastic measures are taken. - 27 February 2026
- Published by Springer Nature in Annals of Telecommunications
- Vol. 81 (9-10) , 1-16
Carbon footprint of urban 5 G traffic in Lyon based on real-world data and analytical modeling
- 27 February 2026
- Published by Springer Nature in Annals of Telecommunications
- Vol. 81 (9-10) , 1-16
Carbon footprint of urban 5 G traffic in Lyon based on real-world data and analytical modeling
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (1) , 657-673
Rate Meta-Distribution in Millimeter Wave URLLC Device-to-Device Networks With Beam Misalignment
Using the stochastic geometry framework, we study a millimeter wave (mmWave) Device-to-Device (D2D) network dedicated to Ultra-Reliable Low Latency Communications (URLLC), where users employ multiple antennas to perform beamforming. We leverage the notion of meta-distribution in order to capture the reliability requirement of URLLC. The packet transmission process is divided into two phases: a beam training phase, during which exhaustive beam sweeping is adopted, and a data transmission phase. The paper investigates the misalignment error distribution resulting from an imperfect training phase, due to the finite codebooks resolution and the fast variation of the channel. For the data transmission phase, closed-form expressions for all the moments of the conditional rate coverage probability are derived, and the meta-distribution is approximated using the beta approximation. The study evaluates the overall network performance through the effective rate meta-distribution, which accounts for the training overhead and beam misalignment errors. The results show the detrimental impact of misalignment errors when URLLC requirements are stringent and highlight the trade-off between the training overhead and the gain brought by multiple antennas. Insights are provided for optimally and jointly choosing the codebook size and tbe number of antennas.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (1) , 657-673
Rate Meta-Distribution in Millimeter Wave URLLC Device-to-Device Networks With Beam Misalignment
Using the stochastic geometry framework, we study a millimeter wave (mmWave) Device-to-Device (D2D) network dedicated to Ultra-Reliable Low Latency Communications (URLLC), where users employ multiple antennas to perform beamforming. We leverage the notion of meta-distribution in order to capture the reliability requirement of URLLC. The packet transmission process is divided into two phases: a beam training phase, during which exhaustive beam sweeping is adopted, and a data transmission phase. The paper investigates the misalignment error distribution resulting from an imperfect training phase, due to the finite codebooks resolution and the fast variation of the channel. For the data transmission phase, closed-form expressions for all the moments of the conditional rate coverage probability are derived, and the meta-distribution is approximated using the beta approximation. The study evaluates the overall network performance through the effective rate meta-distribution, which accounts for the training overhead and beam misalignment errors. The results show the detrimental impact of misalignment errors when URLLC requirements are stringent and highlight the trade-off between the training overhead and the gain brought by multiple antennas. Insights are provided for optimally and jointly choosing the codebook size and tbe number of antennas.
- Open Access
- 2 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Machine Learning in Communications and Networking
- Vol. 2, 1142-1158
Deep Reinforcement Learning for Uplink Scheduling in NOMA-URLLC Networks
This article addresses the problem of Ultra Reliable Low Latency Communications (URLLC) in wireless networks, a framework with particularly stringent constraints imposed by many Internet of Things (IoT) applications from diverse sectors. We propose a novel Deep Reinforcement Learning (DRL) scheduling algorithm, named NOMA-PPO, to solve the Non-Orthogonal Multiple Access (NOMA) uplink URLLC scheduling problem involving strict deadlines. The challenge of addressing uplink URLLC requirements in NOMA systems is related to the combinatorial complexity of the action space due to the possibility to schedule multiple devices, and to the partial observability constraint that we impose to our algorithm in order to meet the IoT communication constraints and be scalable. Our approach involves 1) formulating the NOMA-URLLC problem as a Partially Observable Markov Decision Process (POMDP) and the introduction of an agent state , serving as a sufficient statistic of past observations and actions, enabling a transformation of the POMDP into a Markov Decision Process (MDP); 2) adapting the Proximal Policy Optimization (PPO) algorithm to handle the combinatorial action space; 3) incorporating prior knowledge into the learning agent with the introduction of a Bayesian policy. Numerical results reveal that not only does our approach outperform traditional multiple access protocols and DRL benchmarks on 3GPP scenarios, but also proves to be robust under various channel and traffic configurations, efficiently exploiting inherent time correlations.
- 2 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Machine Learning in Communications and Networking
- Vol. 2, 1142-1158
Open AccessDeep Reinforcement Learning for Uplink Scheduling in NOMA-URLLC Networks
This article addresses the problem of Ultra Reliable Low Latency Communications (URLLC) in wireless networks, a framework with particularly stringent constraints imposed by many Internet of Things (IoT) applications from diverse sectors. We propose a novel Deep Reinforcement Learning (DRL) scheduling algorithm, named NOMA-PPO, to solve the Non-Orthogonal Multiple Access (NOMA) uplink URLLC scheduling problem involving strict deadlines. The challenge of addressing uplink URLLC requirements in NOMA systems is related to the combinatorial complexity of the action space due to the possibility to schedule multiple devices, and to the partial observability constraint that we impose to our algorithm in order to meet the IoT communication constraints and be scalable. Our approach involves 1) formulating the NOMA-URLLC problem as a Partially Observable Markov Decision Process (POMDP) and the introduction of an agent state , serving as a sufficient statistic of past observations and actions, enabling a transformation of the POMDP into a Markov Decision Process (MDP); 2) adapting the Proximal Policy Optimization (PPO) algorithm to handle the combinatorial action space; 3) incorporating prior knowledge into the learning agent with the introduction of a Bayesian policy. Numerical results reveal that not only does our approach outperform traditional multiple access protocols and DRL benchmarks on 3GPP scenarios, but also proves to be robust under various channel and traffic configurations, efficiently exploiting inherent time correlations.
- Open Access
Bidding efficiently in Simultaneous Ascending Auctions with incomplete information using Monte Carlo Tree Search and determinization
For decades, Simultaneous Ascending Auction (SAA) has been the most widely used mechanism for spectrum auctions, and it has recently gained popularity for allocating 5G licenses in many countries. Despite its relatively simple rules, SAA introduces a complex strategic game with an unknown optimal bidding strategy. Given the high stakes involved, with billions of euros sometimes on the line, developing an efficient bidding strategy is of utmost importance. In this work, we extend our previous method, a Simultaneous Move Monte-Carlo Tree Search (SM-MCTS) based algorithm named $SMS^α$ to incomplete information framework. For this purpose, we compare three determinization approaches which allow us to rely on complete information SM-MCTS. This algorithm addresses, in incomplete framework, the four key strategic issues of SAA: the exposure problem, the own price effect, budget constraints, and the eligibility management problem. Through extensive numerical experiments on instances of realistic size with an uncertain framework, we show that $SMS^α$ largely outperforms state-of-the-art algorithms by achieving higher expected utility while taking less risks, no matter which determinization method is chosen.Open AccessBidding efficiently in Simultaneous Ascending Auctions with incomplete information using Monte Carlo Tree Search and determinization
For decades, Simultaneous Ascending Auction (SAA) has been the most widely used mechanism for spectrum auctions, and it has recently gained popularity for allocating 5G licenses in many countries. Despite its relatively simple rules, SAA introduces a complex strategic game with an unknown optimal bidding strategy. Given the high stakes involved, with billions of euros sometimes on the line, developing an efficient bidding strategy is of utmost importance. In this work, we extend our previous method, a Simultaneous Move Monte-Carlo Tree Search (SM-MCTS) based algorithm named $SMS^α$ to incomplete information framework. For this purpose, we compare three determinization approaches which allow us to rely on complete information SM-MCTS. This algorithm addresses, in incomplete framework, the four key strategic issues of SAA: the exposure problem, the own price effect, budget constraints, and the eligibility management problem. Through extensive numerical experiments on instances of realistic size with an uncertain framework, we show that $SMS^α$ largely outperforms state-of-the-art algorithms by achieving higher expected utility while taking less risks, no matter which determinization method is chosen. - 9 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Games
- Vol. 17 (1) , 210-223
Bidding Efficiently in Simultaneous Ascending Auctions With Budget and Eligibility Constraints Using Simultaneous Move Monte Carlo Tree Search
For decades, Simultaneous Ascending Auction (SAA) has been the most popular mechanism used for spectrum auctions. It has recently been employed by many countries for the allocation of 5G licences. Although SAA presents relatively simple rules, it induces a complex strategic game for which the optimal bidding strategy is unknown. Considering the fact that sometimes billions of euros are at stake in an SAA, establishing an efficient bidding strategy is crucial. In this work, we model the auction as a $n$ -player simultaneous move game with complete information and propose the first efficient bidding algorithm that tackles simultaneously its four major strategic issues: the exposure problem , the own price effect , budget constraints and the eligibility management problem . Our solution, called $SMS^\alpha$ , is based on Simultaneous Move Monte Carlo Tree Search (SM-MCTS) and relies on a new method for the prediction of closing prices. By introducing a new reward function in $SMS^\alpha$ , we give the possibility to bidders to define their own level of risk-aversion. Through extensive numerical experiments on instances of realistic size, we show that $SMS^\alpha$ largely outperforms state-of-the-art algorithms, notably by achieving higher expected utility while taking less risks.
- 9 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Games
- Vol. 17 (1) , 210-223
Bidding Efficiently in Simultaneous Ascending Auctions With Budget and Eligibility Constraints Using Simultaneous Move Monte Carlo Tree Search
For decades, Simultaneous Ascending Auction (SAA) has been the most popular mechanism used for spectrum auctions. It has recently been employed by many countries for the allocation of 5G licences. Although SAA presents relatively simple rules, it induces a complex strategic game for which the optimal bidding strategy is unknown. Considering the fact that sometimes billions of euros are at stake in an SAA, establishing an efficient bidding strategy is crucial. In this work, we model the auction as a $n$ -player simultaneous move game with complete information and propose the first efficient bidding algorithm that tackles simultaneously its four major strategic issues: the exposure problem , the own price effect , budget constraints and the eligibility management problem . Our solution, called $SMS^\alpha$ , is based on Simultaneous Move Monte Carlo Tree Search (SM-MCTS) and relies on a new method for the prediction of closing prices. By introducing a new reward function in $SMS^\alpha$ , we give the possibility to bidders to define their own level of risk-aversion. Through extensive numerical experiments on instances of realistic size, we show that $SMS^\alpha$ largely outperforms state-of-the-art algorithms, notably by achieving higher expected utility while taking less risks.
- Open Access
Bidding efficiently in Simultaneous Ascending Auctions with budget and eligibility constraints using Simultaneous Move Monte Carlo Tree Search
For decades, Simultaneous Ascending Auction (SAA) has been the most popular mechanism used for spectrum auctions. It has recently been employed by many countries for the allocation of 5G licences. Although SAA presents relatively simple rules, it induces a complex strategic game for which the optimal bidding strategy is unknown. Considering the fact that sometimes billions of euros are at stake in an SAA, establishing an efficient bidding strategy is crucial. In this work, we model the auction as a $n$-player simultaneous move game with complete information and propose the first efficient bidding algorithm that tackles simultaneously its four main strategic issues: the $\textit{exposure problem}$, the $\textit{own price effect}$, $\textit{budget constraints}$ and the $\textit{eligibility management problem}$. Our solution, called $SMS^α$, is based on Simultaneous Move Monte Carlo Tree Search (SM-MCTS) and relies on a new method for the prediction of closing prices. By introducing a new reward function in $SMS^α$, we give the possibility to bidders to define their own level of risk-aversion. Through extensive numerical experiments on instances of realistic size, we show that $SMS^α$ largely outperforms state-of-the-art algorithms, notably by achieving higher expected utility while taking less risks.Open AccessBidding efficiently in Simultaneous Ascending Auctions with budget and eligibility constraints using Simultaneous Move Monte Carlo Tree Search
For decades, Simultaneous Ascending Auction (SAA) has been the most popular mechanism used for spectrum auctions. It has recently been employed by many countries for the allocation of 5G licences. Although SAA presents relatively simple rules, it induces a complex strategic game for which the optimal bidding strategy is unknown. Considering the fact that sometimes billions of euros are at stake in an SAA, establishing an efficient bidding strategy is crucial. In this work, we model the auction as a $n$-player simultaneous move game with complete information and propose the first efficient bidding algorithm that tackles simultaneously its four main strategic issues: the $\textit{exposure problem}$, the $\textit{own price effect}$, $\textit{budget constraints}$ and the $\textit{eligibility management problem}$. Our solution, called $SMS^α$, is based on Simultaneous Move Monte Carlo Tree Search (SM-MCTS) and relies on a new method for the prediction of closing prices. By introducing a new reward function in $SMS^α$, we give the possibility to bidders to define their own level of risk-aversion. Through extensive numerical experiments on instances of realistic size, we show that $SMS^α$ largely outperforms state-of-the-art algorithms, notably by achieving higher expected utility while taking less risks. - Open Access
- 1 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
5G vs Wifi6 Downlink Power Consumption Comparison for Teleworking Use Case
Teleworking became a vastly popular practice lately owing to the Covid-19 outbreak. Our present study aims to evaluate the operating energy consumption in 5G versus Wifi6 networks for this remote working case study. We specifically study the detailed operations of transmission and reception at both radio access networks and quantify their power consumption in the downlink, analytically, using simulations and, for the case of Wifi6. We focus on three case studies in the framework of a teleworking tool: audio session, video session and shared screen session. Our results show that for the use case of video session in the downlink, when the number of users is rather small, Wifi6 consumes less power, however, as the number of users gets larger, 5G with Multi-User MIMO (MU-MIMO) outperforms the individual Wifi accesses. These results depend on the number of simultaneous MUMIMO streams as well as on the fixed component of the power consumption of the 5G, for which we present a sensitivity analysis as well.
- 1 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Open Access5G vs Wifi6 Downlink Power Consumption Comparison for Teleworking Use Case
Teleworking became a vastly popular practice lately owing to the Covid-19 outbreak. Our present study aims to evaluate the operating energy consumption in 5G versus Wifi6 networks for this remote working case study. We specifically study the detailed operations of transmission and reception at both radio access networks and quantify their power consumption in the downlink, analytically, using simulations and, for the case of Wifi6. We focus on three case studies in the framework of a teleworking tool: audio session, video session and shared screen session. Our results show that for the use case of video session in the downlink, when the number of users is rather small, Wifi6 consumes less power, however, as the number of users gets larger, 5G with Multi-User MIMO (MU-MIMO) outperforms the individual Wifi accesses. These results depend on the number of simultaneous MUMIMO streams as well as on the fixed component of the power consumption of the 5G, for which we present a sensitivity analysis as well.
- Open Access
- 1 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. c1-c5
ComNet 2023 Cover Page
- 1 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. c1-c5
Open AccessComNet 2023 Cover Page