Network pollution games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256750 (Why is no real title available?)
- scientific article; zbMATH DE number 1021588 (Why is no real title available?)
- Algorithmic Game Theory
- Approximability of sparse integer programs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation algorithms for knapsack problems with cardinality constraints
- Black-box randomized reductions in algorithmic mechanism design
- Can taxes on cars and on gasoline mimic an unavailable tax on emissions?
- Every Planar Map is Four Colorable
- Mechanisms for multi-unit auctions
- Mechanisms for multi-unit combinatorial auctions with a few distinct goods
- Network game of pollution cost reduction
- New results for network pollution games
- On Imperfect Information and Optimal Pollution Control
- On Lagrangian Relaxation and Subset Selection Problems
- On the power of unique 2-prover 1-round games
- Regulating automobile pollution under certainty, competition, and imperfect information
- Sharing a polluted river
- Solving packing integer programs via randomized rounding with alterations
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The complexity of satisfiability problems
- The ellipsoid method and its consequences in combinatorial optimization
- There is no EPTAS for two-dimensional knapsack
- Time-consistent Shapley value allocation of pollution cost reduction
- To Tell the Truth: Imperfect Information and Optimal Pollution Control
- Treewidth. Computations and approximations
- Truthful and Near-Optimal Mechanism Design via Linear Programming
- Using automatic tax changes to control pollution emissions
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
This page was built for publication: Network pollution games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1755784)
