Selfish bin packing
type: Item
instance of: scholarly article
title: Selfish bin packing
zbMATH Open document ID: 1213.90211
author: Leah Epstein
author: Elena Kleiman
published in: Algorithmica
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 68T42
zbMATH DE Number: 5886433
Wikidata QID: Q105583416
MaRDI profile type: Publication
full work available at URL: s00453-009-9348-6
OpenAlex ID: W2128578725
cites work: Q2934597
cites work: Near-optimal network design with selfish agents
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Q3254691
cites work: Worst-case analysis of the subset sum algorithm for bin packing.
cites work: Q3347319
cites work: Q3145801
cites work: Q4828962
cites work: Selfish Bin Packing
cites work: Strong Price of Anarchy for Machine Load Balancing
cites work: Q4737150
cites work: Atomic Congestion Games Among Coalitions
cites work: The effect of collusion in congestion games
cites work: Strong equilibrium in congestion games
cites work: Q3409969
cites work: Approximate equilibria and ball fusion
cites work: A simple on-line bin-packing algorithm
cites work: STACS 2004
cites work: The price of selfish routing
cites work: Non-cooperative games
cites work: Algorithms, games, and the internet
cites work: How bad is selfish routing?
cites work: Coalition-proof Nash equilibria. I: Concepts
DOI: 10.1007/S00453-009-9348-6
description: scientific article; zbMATH DE number 5886433