Selfish bin packing

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

Elena Kleiman, Leah Epstein

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

Applications of game theory (91A80) Combinatorial optimization (90C27) Agent technology and artificial intelligence (68T42)

Related Items (26)

Approximate core allocations and integrality gap for the bin packing game ⋮ The Subset Sum game ⋮ Selfish bin packing under harmonic mean cost sharing mechanism ⋮ Selfish Vector Packing ⋮ A note on a selfish bin packing problem ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Selfish bin packing with cardinality constraints ⋮ An Incentive Mechanism for Selfish Bin Covering ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ Using weight decision for decreasing the price of anarchy in selfish bin packing games ⋮ Selfish bin packing with punishment ⋮ Bin packing game with a price of anarchy of \(\frac{3}{2}\) ⋮ Selfish bin covering ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Prices of Anarchy of Selfish 2D Bin Packing Games ⋮ A bin packing game with cardinality constraints under the best cost rule ⋮ Selfish vector packing ⋮ The intermediate price of anarchy (IPoA) in bin packing games ⋮ A general bin packing game: interest taken into account ⋮ A new lower bound on the price of anarchy of selfish bin packing ⋮ Selfish colorful bin packing games ⋮ An improved mechanism for selfish bin packing ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ From packing rules to cost-sharing mechanisms ⋮ On the sequential price of anarchy of isolation games ⋮ Parametric packing of selfish items and the subset sum algorithm

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Selfish bin packing