Nash balanced assignment problem (Q6166900): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Price of Fairness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced optimization problems / 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: Fair optimization and networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted sum method for multi-objective optimization: new insights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most and least uniform spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming on Cray Supercomputers / rank
 
Normal rank

Latest revision as of 11:43, 2 August 2024

scientific article; zbMATH DE number 7722413
Language Label Description Also known as
English
Nash balanced assignment problem
scientific article; zbMATH DE number 7722413

    Statements

    Nash balanced assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2023
    0 references
    combinatorial optimization
    0 references
    balanced assignment problem
    0 references
    proportional fairness
    0 references
    proportional-fair scheduling
    0 references
    weighted sum method
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references