The Global Warming Potential (GWP) is used within the Kyoto Protocol to the United Nations Framework Convention on Climate Change as a metric for weighting the climatic impact of emissions of different greenhouse gases. ...

Published in: Ambivalence Towards Convergence. Digitalization and Media Change Redaktörer: Tanja Storsul, Dagny Stuedahl Nordicom, 2007, 251 p. - ISBN 978-91-89471-50-4, (Research Anthologies and Monographs)

This paper describes the severe situation of vehicular emission pollution in Beijing, and discusses the following mitigation strategies: improving fuel quality, controlling the exhaust from new vehicles, controlling the ...

This article reviews basic insights about compliance and “hard” enforcement that can be derived from various non-cooperative equilibrium concepts, and evaluates the Marrakesh Accords in light of these insights. Five different ...

An Elsevier Open Archive article. NOTICE: this is the author’s version of a work that was accepted for publication in Linear Algebra and its Applications. Changes resulting from the publishing process, such as peer ...

While there is a vast literature both on international bargaining and on how international agreements can be enforced, very little work has been done on how bargaining and enforcement interact. An important exception is ...

Implementation of the Kyoto Protocol is likely to leave Russa and other Eastern European countries with market power in the market for emission permits. Ceteris paribus, this will raise the permit price above the competitive ...

Mens bruken av avgifter som virkemiddel i klimapolitikken overfor næringslivet har hatt motvind i Norge de siste årene, har flere europeiske land siden begynnelsen av 90-tallet vist stigende interesse for å skattlegge ...

We consider a combinatorial problem motivated by a special simplified timetabling problem for subway networks. Mathematically the problem is to find (pairwise) disjoint congruence classes modulo certain given integers; ...

Starting with a problem in wireless telecommunication, we are led to study the multiple knapsack problem with assignment restrictions. This problem is NP-hard. We consider special cases and their computational complexity. ...