Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129476481, #quickstatements; #temporary_batch_1730405342757
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.05372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure Nash equilibria in player-specific and weighted congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined proximity and sensitivity results in linearly constrained convex separable integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design with weighted players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity theorems in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish unsplittable flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids Are Immune to Braess’ Paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matroid approach to finding edge connectivity and packing arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion Games with Player-Specific Costs Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing (un-) splittable flow in games with player-specific affine latency functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for maximizing a separable concave function over a polymatroid feasible region / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pure Nash Equilibria in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Competition on Integral Polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroid Optimization, Submodularity, and Joint Replenishment Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate control for communication networks: shadow prices, proportional fairness and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of equilibria in noncooperative optimal flow control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity theorems of discrete convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network equilibrium problem in integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mathematics of internet congestion control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a Submodular Function on a Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411083 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129476481 / rank
 
Normal rank

Latest revision as of 21:09, 31 October 2024

scientific article; zbMATH DE number 6921208
Language Label Description Also known as
English
Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
scientific article; zbMATH DE number 6921208

    Statements

    Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2018
    0 references
    polymatroid
    0 references
    submodular function
    0 references
    sensitivity
    0 references
    reoptimization
    0 references
    integer optimization
    0 references
    noncooperative games
    0 references
    congestion games
    0 references
    pure Nash equilibrium
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references