Selfish bin packing (Q534779): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T42 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5886433 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q105583416 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-009-9348-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2128578725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal network design with selfish agents / 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: Worst-case analysis of the subset sum algorithm for bin packing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Bin 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: Q4737150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Congestion Games Among Coalitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of collusion in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equilibrium in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate equilibria and ball fusion / 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: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalition-proof Nash equilibria. I: Concepts / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Selfish bin packing
scientific article

    Statements

    Selfish bin packing (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references