Selfish Bin Packing

DOI10.1007/978-3-540-87744-8_31zbMath1158.91333OpenAlexW2152046758MaRDI QIDQ3541100

Elena Kleiman, Leah Epstein

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_31

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of game theory (91A80) Distributed systems (68M14)

Related Items (4)

Selfish vector packing ⋮ Selfish bin packing ⋮ Measurement-based efficient resource allocation with demand-side adjustments ⋮ Convergence Time to Nash Equilibrium in Selfish Bin 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
• Tight bounds for worst-case equilibria
• The Price of Stability for Network Design with Fair Cost Allocation
• 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

This page was built for publication: Selfish Bin Packing