Efficiency and dependency in a network of linked permit markets
Juha Itkonen
No 20/2017, Bank of Finland Research Discussion Papers from Bank of Finland
Abstract:
We model a network of linked permit markets to examine efficiency and dependencies between the markets in a competitive equilibrium. Links enable the participants of one emissions trading system to use the permits of another system. To improve the cost-efficiency of the international policy architecture, the Paris climate agreement set out a framework for linking local policies. International trade in permits reduces costs by merging markets, but in a large network it is generally not obvious which markets end up linked in the equilibrium. Also, indirect links might allow foreign regulators to undermine domestic policy outcomes. We apply graph theory to study dependencies between markets and to determine how the network is partitioned into separate market areas. Our main theorem characterizes the dependency structure of the equilibrium in an exogenous trading network. We show that markets merge when they are connected by a particular pattern of links. The results help to identify potential sources of both cost reductions and foreign interference, and to secure the efficiency of climate change policies.
JEL-codes: D41 F13 L14 Q54 Q58 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.econstor.eu/bitstream/10419/212391/1/bof-rdp2017-020.pdf (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:zbw:bofrdp:rdp2017_020
Access Statistics for this paper
More papers in Bank of Finland Research Discussion Papers from Bank of Finland Contact information at EDIRC.
Bibliographic data for series maintained by ZBW - Leibniz Information Centre for Economics ().