On fair, effective and efficient REDD mechanism design
Gusti Mykola, Fritz Steffen, Böttcher Hannes and 9 more
Carbon Balance and Management · 2009
doi:10.1186/1750-0680-4-11 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
<p>Abstract</p> <p>The issues surrounding 'Reduced Emissions from Deforestation and Forest Degradation' (REDD) have become a major component of continuing negotiations under the United Nations Framework Convention on Climate Change (UNFCCC). This paper aims to address two key requirements of any potential REDD mechanism: first, the generation of measurable, reportable and verifiable (MRV) REDD credits; and secondly, the sustainable and efficient provision of emission reductions under a robust financing regime.</p> <p>To ensure the supply of MRV credits, we advocate the establishment of an 'International Emission Reference Scenario Coordination Centre' (IERSCC). The IERSCC would act as a global clearing house for harmonized data to be used in implementing reference level methodologies. It would be tasked with the collection, reporting and subsequent processing of earth observation, deforestation- and degradation driver information in a globally consistent manner. The IERSCC would also assist, coordinate and supervise the computation of national reference scenarios according to rules negotiated under the UNFCCC. To overcome the threats of "market flooding" on the one hand and insufficient economic incentives for REDD on the other hand, we suggest an 'International Investment Reserve' (IIR) as REDD financing framework. In order to distribute the resources of the IIR we propose adopting an auctioning mechanism.</p> <p>Auctioning not only reveals the true emission reduction costs, but might also allow for incentivizing the protection of biodiversity and socio-economic values. The introduced concepts will be vital to ensure robustness, environmental integrity and economic efficiency of the future REDD mechanism.</p>
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.