@inproceedings{82f3dbc957154244a5f33b9147721652,
title = "New results for network pollution games",
abstract = "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.",
keywords = "Algorithmic mechanism design, Approximation algorithms, Planar and tree networks",
author = "Eleftherios Anastasiadis and Xiaotie Deng and Piotr Krysta and Minming Li and Han Qiao and Jinshan Zhang",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 22nd International Conference on Computing and Combinatorics, COCOON 2016 ; Conference date: 02-08-2016 Through 04-08-2016",
year = "2016",
doi = "10.1007/978-3-319-42634-1\_4",
language = "英语",
isbn = "9783319426334",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "39--51",
editor = "Dinh, \{Thang N.\} and Thai, \{My T.\}",
booktitle = "Computing and Combinatorics - 22nd International Conference, COCOON 2016, Proceedings",
address = "德国",
}