New Results for Network Pollution Games

  • Eleftherios Anastasiadis
  • Xiaotie Deng
  • Piotr KrystaEmail author
  • Minming Li
  • Han Qiao
  • Jinshan Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9797)


We study a newly introduced network model of the pollution control and design approximation algorithms and truthful mechanisms with objective to maximize the social welfare. On a high level, we are given a graph whose nodes represent the agents (sources of pollution), and edges between agents represent the effect of pollution spread. The government is responsible to maximize the social welfare while setting bounds on the levels of emitted pollution both locally and globally. We obtain a truthful in expectation FPTAS when the network is a tree (modelling water pollution) and a deterministic truthful 3-approximation mechanism. On planar networks (modelling air pollution) the previous result was a huge constant approximation algorithm. We design a PTAS with a small violation of local pollution constraints. We also design approximation algorithms for general networks with bounded degree. Our approximations are near best possible under appropriate complexity assumptions.


Algorithmic mechanism design Approximation algorithms Planar and tree networks 


  1. 1.
    Air quality in Europe - 2014 Report. European Environment Agency Report No. 5/2014.
  2. 2.
    State of the Air 2014 Report. American Lung Association, 30 April 2014.
  3. 3.
    Anastasiadis, E., Deng, X., Krysta, P., Li, M., Qiao, H., Zhang, J.: Network pollution games. In: AAMAS (2016)Google Scholar
  4. 4.
    Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: Solving packing integer programs via randomized rounding with alterations. Theor. Comput. 8(1), 533–565 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Belitskaya, A.V.: Network game of pollution cost reduction. Contrib. Game Theor. Manag. 6, 24–34 (2013)MathSciNetGoogle Scholar
  7. 7.
    Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. Eur. J. Oper. Res. 123(2), 333–345 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chau, C., Elbassioni, K., Khonji, M.: Truthful mechanisms for combinatorial AC electric power allocation. In: Proceedings of the 13th AAMAS, pp. 1005–1012 (2014)Google Scholar
  9. 9.
    Dobzinski, S., Nisan, N.: Mechanisms for multi-unit auctions. In: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 346–351. ACM (2007)Google Scholar
  10. 10.
    Dong, B., Ni, D., Wang, Y.: Sharing a polluted river network. Environ. Resour. Econ. 53(3), 367–387 (2012)CrossRefGoogle Scholar
  11. 11.
    Dughmi, S., Roughgarden, T.: Black-box randomized reductions in algorithmic mechanism design. SIAM J. Comput. 43(1), 312–336 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Katsikarelis, I.: Computing bounded-width tree, branch decompositions of k-outerplanar graphs (2013). arXiv preprint arXiv: 1301.5896
  13. 13.
    Kloks, T.: Treewidth: Computations and Approximations. Lecture Notes in Computer Science, vol. 842. Springer, Heidelberg (1994)CrossRefzbMATHGoogle Scholar
  14. 14.
    Krysta, P., Telelis, O., Ventre, C.: Mechanisms for multi-unit combinatorial auctions with a few distinct goods. In: Proceedings of 12th AAMAS, pp. 691–698 (2013)Google Scholar
  15. 15.
    Kwerel, E.: To tell the truth: imperfect information and optimal pollution control. Rev. Econ. Stud. 44, 595–601 (1977)CrossRefzbMATHGoogle Scholar
  16. 16.
    Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. J. ACM (JACM) 58(6), 25 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Ni, D., Wang, Y.: Sharing a polluted river. Games Econ. Behav. 60(1), 176–186 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory, vol. 1. Cambridge University Press, Cambridge (2007)CrossRefzbMATHGoogle Scholar
  19. 19.
    Vorosmarty, C.J., McIntyre, P.B., Gessner, M.O., Dudgeon, D., Prusevich, A., Green, P., Glidden, S., Bunn, S.E., Sullivan, C.A., Reidy Liermann, C., Davies, P.M.: Global threats to human water security, river biodiversity. Nature 467, 555–561 (2010)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Eleftherios Anastasiadis
    • 1
  • Xiaotie Deng
    • 2
  • Piotr Krysta
    • 1
    Email author
  • Minming Li
    • 3
  • Han Qiao
    • 4
  • Jinshan Zhang
    • 1
  1. 1.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  2. 2.Department of Computer Science and EngineeringShanghai Jiao Tong UniversityShanghaiChina
  3. 3.Department of Computer ScienceCity University of Hong KongHong KongChina
  4. 4.School of ManagementUniversity of Chinese Academy of SciencesBeijingChina

Personalised recommendations