Selfish bin packing

DOI10.1007/s00453-009-9348-6zbMath1213.90211WikidataQ105583416 ScholiaQ105583416MaRDI QIDQ534779

Leah Epstein, Elena Kleiman

Publication date: 10 May 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9348-6

Mathematics Subject Classification ID

91A80: Applications of game theory

90C27: Combinatorial optimization

68T42: Agent technology and artificial intelligence

Related Items

Parametric packing of selfish items and the subset sum algorithm, Approximate core allocations and integrality gap for the bin packing game, The Subset Sum game, Selfish bin packing with cardinality constraints, Selfish bin covering, On the sequential price of anarchy of isolation games, A note on a selfish bin packing problem, Selfish Vector Packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coalition-proof Nash equilibria. I: Concepts
• Strong equilibrium in congestion games
• Worst-case analysis of the subset sum algorithm for bin packing.
• Approximate equilibria and ball fusion
• Non-cooperative games
• The effect of collusion in congestion games
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Selfish Bin Packing
• Near-optimal network design with selfish agents
• Atomic Congestion Games Among Coalitions
• A simple on-line bin-packing algorithm
• The price of selfish routing
• Algorithms, games, and the internet
• STACS 2004
• Strong Price of Anarchy for Machine Load Balancing