Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function (Q5919290): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the impact of combinatorial structure on congestion games / 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: On the Uniqueness of Equilibrium in Atomic Splittable Routing Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Impact of Oligopolistic Competition in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games viewed from M-convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids Are Immune to Braess’ Paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource buying games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of equilibria in atomic splittable polymatroid congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collusion in atomic splittable routing games / 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: Convexity and Steinitz's exchange property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: M-Convex Function on Generalized Polymatroid / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function / 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

Revision as of 07:04, 21 July 2024

scientific article; zbMATH DE number 7143373
Language Label Description Also known as
English
Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function
scientific article; zbMATH DE number 7143373

    Statements

    Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function (English)
    0 references
    0 references
    13 December 2019
    0 references
    matroid congestion game
    0 references
    resource buying game
    0 references
    pure Nash equilibrium
    0 references
    monotone set function
    0 references
    submodular function
    0 references
    \({\mathrm{M}}^\natural \)-convex function
    0 references

    Identifiers