Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Strong price of anarchy / 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: Q3254691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and Pareto Price of Anarchy in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quality of strong equilibria for selfish bin packing with uniform cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in cost sharing connection games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric packing of selfish items and the subset sum algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Square Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Price of Anarchy for Machine Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple on-line bin-packing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a selfish bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank

Revision as of 16:05, 19 July 2024

scientific article
Language Label Description Also known as
English
Pareto optimal equilibria for selfish bin packing with uniform cost sharing
scientific article

    Statements

    Pareto optimal equilibria for selfish bin packing with uniform cost sharing (English)
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    bin packing
    0 references
    Nash equilibrium
    0 references
    selfish players
    0 references
    Pareto optimality
    0 references

    Identifiers