New Results for Network Pollution Games

DOI10.1007/978-3-319-42634-1_4zbMath1479.91249OpenAlexW2494222833MaRDI QIDQ2817847

Minming Li, Eleftherios Anastasiadis, Jinshan Zhang, Han Qiao, Piotr Krysta, Xiaotie Deng

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_4

zbMATH Keywords

approximation algorithmsalgorithmic mechanism designplanar and tree networks

Mathematics Subject Classification ID

Applications of game theory (91A80) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Mechanism design theory (91B03)

Related Items (2)

Network pollution games ⋮ New Results for Network Pollution Games

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Treewidth. Computations and approximations
• Approximation algorithms for knapsack problems with cardinality constraints
• Sharing a polluted river
• New Results for Network Pollution Games
• Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods
• To Tell the Truth: Imperfect Information and Optimal Pollution Control
• Approximation algorithms for NP-complete problems on planar graphs
• Mechanisms for Multi-Unit Auctions
• Truthful and Near-Optimal Mechanism Design via Linear Programming
• Black-Box Randomized Reductions in Algorithmic Mechanism Design
• Algorithmic Game Theory

This page was built for publication: New Results for Network Pollution Games