Network pollution games
From MaRDI portal
Publication:1755784
DOI10.1007/s00453-018-0435-4zbMath1417.91390OpenAlexW3013129520WikidataQ64987770 ScholiaQ64987770MaRDI QIDQ1755784
Minming Li, Piotr Krysta, Jinshan Zhang, Han Qiao, Xiaotie Deng, Eleftherios Anastasiadis
Publication date: 11 January 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc6390722
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Approximation algorithms (68W25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximability of sparse integer programs
- There is no EPTAS for two-dimensional knapsack
- The ellipsoid method and its consequences in combinatorial optimization
- Regulating automobile pollution under certainty, competition, and imperfect information
- Treewidth. Computations and approximations
- Approximation algorithms for knapsack problems with cardinality constraints
- Can taxes on cars and on gasoline mimic an unavailable tax on emissions?
- Time-consistent Shapley value allocation of pollution cost reduction
- Using automatic tax changes to control pollution emissions
- Sharing a polluted river
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- New Results for Network Pollution Games
- Mechanisms for Multi-unit Combinatorial Auctions with a Few Distinct Goods
- On the power of unique 2-prover 1-round games
- On Lagrangian Relaxation and Subset Selection Problems
- On Imperfect Information and Optimal Pollution Control
- Every Planar Map is Four Colorable
- To Tell the Truth: Imperfect Information and Optimal Pollution Control
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Approximation algorithms for NP-complete problems on planar graphs
- Mechanisms for Multi-Unit Auctions
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- The complexity of satisfiability problems
- Black-Box Randomized Reductions in Algorithmic Mechanism Design
- Algorithmic Game Theory
This page was built for publication: Network pollution games
