A logarithmic approximation for polymatroid congestion games
type: Item
instance of: scholarly article
title: A logarithmic approximation for polymatroid congestion games
zbMATH Open document ID: 1408.91007
author: Tobias Harks
author: Tim Oosterwijk
author: T. Vredeveld
published in: Operations Research Letters
publication date: 2019-01-15T00:00:00Z
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 7002336
zbMATH Keywords: congestion game
zbMATH Keywords: approximation algorithm
zbMATH Keywords: polymatroid
zbMATH Keywords: matroid
MaRDI profile type: Publication
OpenAlex ID: W2520500471
cites work: On the impact of combinatorial structure on congestion games
cites work: Minimum-Cost Network Design with (Dis)economies of Scale
cites work: Buy-at-Bulk Network Design with Protection
cites work: Structure preserving reductions among convex optimization problems
cites work: Improved Bounds for Matroid Partition and Intersection Algorithms
cites work: Finding Social Optima in Congestion Games with Positive Externalities
cites work: The complexity of pure Nash equilibria
cites work: A threshold of ln n for approximating set cover
cites work: Submodular functions and optimization.
cites work: Algorithms for Graphic Polymatroids and Parametrics-Sets
cites work: How hard is it to find extreme Nash equilibria in network congestion games?
cites work: Two algorithms for maximizing a separable concave function over a polymatroid feasible region
cites work: Computing pure Nash and strong equilibria in bottleneck congestion games
cites work: Resource Competition on Integral Polymatroids
cites work: Optimal cost sharing for capacitated facility location games
cites work: The complexity of welfare maximization in congestion games
cites work: Congestion games with player-specific payoff functions
cites work: A class of games possessing pure-strategy Nash equilibria
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q3549719
cites work: How to find Nash equilibria with extreme total latency in network congestion games?
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Optimal Cost Sharing for Resource Selection Games
cites work: Finding minimum congestion spanning trees
cites work: An analysis of the greedy algorithm for the submodular set covering problem
DOI: 10.1016/J.ORL.2016.09.001
description: scientific article; zbMATH DE number 7002336