Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
From MaRDI portal
Publication:4581762
DOI10.1137/16M1107450zbMath1403.90571arXiv1611.05372MaRDI QIDQ4581762
Britta Peis, Tobias Harks, Max Klimm
Publication date: 21 August 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.05372
sensitivitysubmodular functionnoncooperative gamescongestion gamespolymatroidreoptimizationpure Nash equilibriuminteger optimization
Noncooperative games (91A10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial games (91A46)
Related Items
Equilibrium computation in resource allocation games, Correction to: ``Equilibrium computation in resource allocation games, A common generalization of budget games and congestion games, Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Escaping Braess's paradox through approximate Caratheodory's theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Network design with weighted players
- Pure Nash equilibria in player-specific and weighted congestion games
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- The mathematics of internet congestion control
- Proximity theorems of discrete convex functions
- A matroid approach to finding edge connectivity and packing arborescences
- Refined proximity and sensitivity results in linearly constrained convex separable integer programming
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- Submodular functions and optimization.
- Selfish unsplittable flows
- Congestion Games with Player-Specific Costs Revisited
- Polymatroid Optimization, Submodularity, and Joint Replenishment Games
- Resource Competition on Integral Polymatroids
- On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
- M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
- Rate control for communication networks: shadow prices, proportional fairness and stability
- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
- Routing (un-) splittable flow in games with player-specific affine latency functions
- The Price of Stability for Network Design with Fair Cost Allocation
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Sensitivity theorems in integer linear programming
- Minimizing a Submodular Function on a Lattice
- On the existence of equilibria in noncooperative optimal flow control
- Discrete Convex Analysis
- Matroids Are Immune to Braess’ Paradox
- Mathematical Foundations of Computer Science 2003
- The network equilibrium problem in integers
- Convex separable optimization is not much harder than linear optimization
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
