Customers' price elasticity in delivering event-based flexibility in France

How to cite

Metcalfe, Robert; Schein, Andrew; Bernard, Louise. 2024. "Customers' price elasticity in delivering event-based flexibility in France." AEA RCT Registry. AEARCTR-0012848. https://doi.org/10.1257/rct.12848-1.0

Download: BibTeX · RIS — for reference managers without a browser translator. Zotero and most others pick up this page's citation metadata directly.

Robert Metcalfe* , Andrew Schein , Louise Bernard

* Primary investigator

Registry ID
AEARCTR-0012848
DOI
https://doi.org/10.1257/rct.12848-1.0
First registered
Last updated
Status
On going
Trial dates
2024-01-02 – 2024-04-30
Countries
Private
Registry record
http://www.socialscienceregistry.org/trials/12848

Abstract

Centre for Net Zero (CNZ), in partnership with Octopus Energy France, will undertake a field trial during Winter 2023 - 2024. The trial will rigorously evaluate the price sensitivity of demand flexibility response from domestic customers in France.

We are building on the success of previous campaigns in the UK 2022-2023 and 2023-2024 Saving Sessions, which showcased domestic customers' willingness to curtail energy consumption during peak periods, and CNZ’s analysis thereof (Jacob et al., 2023). The French Eco-sessions is a scale-up from research in the UK and taking it to another country.

Experimental design

We will randomize customers to recieve different incentives for curtailing energy demand.

Design details

Randomization method
To ensure the robustness and applicability of our findings, we block units into experimental blocks of 5 units. We first find exact matches on the categorical variables (geographic locations, housing type, whether or not they answered the energy consumption survey) and then find the closest match on the numerical variable using Mahalanobis distance. Blocking begins by creating a measure of multivariate distance between all possible pairs of units. Within each category, the algorithm optGreedy calls an optimal-greedy algorithm, repeatedly finding the best remaining match. The optGreedy algorithm breaks ties by randomly selecting one of the minimum-distance pairs. Once the groups of 5 closest units are created, we randomly allocate a number from 1 to 5 to each unit within each group. Finally, we recode units 3 to 5 to be in the low incentive group. If there are more than 5,000 in units 1 and 2 (medium and high), I randomly select the extra groups and allocate all units in these groups to be in the low incentive group. Some groups do not have 5 matches. These units are randomly allocated to one of the 5 groups. The following variables are used to create the groups: - Geographic locations at the sub-national level - Housing type - Average annual consumption - we will create a measure of distance between all possible pairs of units - Whether or not they answered the survey about energy consumption patterns
Randomization unit
Household/customer
Clusters
We will invite 157k eligible customers to participate in Eco-sessions. We will divide the customers that accept the invitation into 3 groups: 10k, 5k, 5k.
Observations
157k eligible customers with half-hourly data on energy use prior, during, and after the trial.
Arms
10k 5k 5k
Primary outcomes
Electricity Consumption in kWh per half-hour: We will analyze the electricity consumption (kWh per half-hour) of participating customers during and around Eco-sessions.

Cited by

No citation data available for this registration yet.

Keywords