An Incentive Mechanism for Selfish Bin Covering (Q2958351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Selfish bin packing with cardinality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish bin covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic fully polynomial time approximation scheme for bin covering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / 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: Algorithms, games, and the internet / rank
 
Normal rank

Latest revision as of 09:32, 13 July 2024

scientific article
Language Label Description Also known as
English
An Incentive Mechanism for Selfish Bin Covering
scientific article

    Statements

    An Incentive Mechanism for Selfish Bin Covering (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    0 references
    selfish bin covering
    0 references
    incentive mechanism
    0 references
    Nash equilibrium
    0 references
    price of anarchy (PoA)
    0 references
    price of stability (PoS)
    0 references
    0 references