A logarithmic approximation for polymatroid congestion games
DOI10.1016/J.ORL.2016.09.001zbMATH Open1408.91007OpenAlexW2520500471MaRDI QIDQ1709937FDOQ1709937
Authors: Tobias Harks, Tim Oosterwijk, T. Vredeveld 
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
Recommendations
- Finding social optima in congestion games with positive externalities
- Efficiency of equilibria in uniform matroid congestion games
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Totally unimodular congestion games
- Bounding the potential function in congestion games and approximate pure Nash equilibria
Combinatorial optimization (90C27) Noncooperative games (91A10) Combinatorial aspects of matroids and geometric lattices (05B35) Traffic problems in operations research (90B20)
Cites Work
- A threshold of ln n for approximating set cover
- A class of games possessing pure-strategy Nash equilibria
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- An analysis of the greedy algorithm for the submodular set covering problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Submodular functions and optimization.
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Structure preserving reductions among convex optimization problems
- Congestion games with player-specific payoff functions
- On the impact of combinatorial structure on congestion games
- Title not available (Why is that?)
- The complexity of pure Nash equilibria
- Optimal cost sharing for capacitated facility location games
- Optimal cost sharing for resource selection games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Resource competition on integral polymatroids
- How hard is it to find extreme Nash equilibria in network congestion games?
- The complexity of welfare maximization in congestion games
- Finding social optima in congestion games with positive externalities
- Minimum-cost network design with (dis)economies of scale
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Buy-at-bulk network design with protection
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- How to find Nash equilibria with extreme total latency in network congestion games?
- Finding minimum congestion spanning trees
Cited In (3)
This page was built for publication: A logarithmic approximation for polymatroid congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709937)
