IDEAS home Printed from https://ideas.repec.org/a/taf/reroxx/v31y2018i1p1717-1736.html
   My bibliography  Save this article

Cost allocation for the problem of pollution reduction: a dynamic cooperative game approach

Author

Listed:
  • Muhammad Luqman
  • Sui Peng
  • Shaoan Huang
  • Amina Bibi
  • Najid Ahmad

Abstract

This paper studies CO2 emissions at a global level. The authors use Dynamic Optimisation to derive the minimum penalty cost on countries every single time. They then use an Imputation Distribution Procedure to allocate the minimum penalty cost among countries. Their work provides the extension of the Shapley value cost allocation as a penalty to reduce CO2 emissions. The paper has implications for how to provide initiatives to improve cooperation on reducing CO2 emissions at an international level. Results show that a reduction in cost of only one country can be harmful for other countries. In this way, some countries can end up or worse off in a case where all countries experience a uniform decrease in their penalty cost. Therefore, the findings of this work suggest a low penalty-cost scenario that helps the countries fight for pollution reduction and provide fruitful links for policy-makers. They show that the Clean Development Mechanism (CDM) of the Kyoto Protocol could be implemented by the Shapley value cost allocation.

Suggested Citation

  • Muhammad Luqman & Sui Peng & Shaoan Huang & Amina Bibi & Najid Ahmad, 2018. "Cost allocation for the problem of pollution reduction: a dynamic cooperative game approach," Economic Research-Ekonomska Istraživanja, Taylor & Francis Journals, vol. 31(1), pages 1717-1736, January.
  • Handle: RePEc:taf:reroxx:v:31:y:2018:i:1:p:1717-1736
    DOI: 10.1080/1331677X.2018.1515642
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1331677X.2018.1515642
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/1331677X.2018.1515642?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:reroxx:v:31:y:2018:i:1:p:1717-1736. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rero .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.