A logarithmic approximation for polymatroid congestion games
From MaRDI portal
Publication:1709937
DOI10.1016/j.orl.2016.09.001zbMath1408.91007OpenAlexW2520500471MaRDI QIDQ1709937
Tobias Harks, Tjark Vredeveld, Tim Oosterwijk
Publication date: 15 January 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/21d94606-76a7-4bc4-99ac-be397aa4b951
Noncooperative games (91A10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Cites Work
- Unnamed Item
- Optimal cost sharing for capacitated facility location games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- How to find Nash equilibria with extreme total latency in network congestion games?
- How hard is it to find extreme Nash equilibria in network congestion games?
- Structure preserving reductions among convex optimization problems
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- An analysis of the greedy algorithm for the submodular set covering problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- Submodular functions and optimization.
- The complexity of welfare maximization in congestion games
- Finding Social Optima in Congestion Games with Positive Externalities
- Resource Competition on Integral Polymatroids
- A threshold of ln n for approximating set cover
- Buy-at-Bulk Network Design with Protection
- On the impact of combinatorial structure on congestion games
- Minimum-Cost Network Design with (Dis)economies of Scale
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- The complexity of pure Nash equilibria
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- Optimal Cost Sharing for Resource Selection Games
- Finding minimum congestion spanning trees
This page was built for publication: A logarithmic approximation for polymatroid congestion games
