Selfish bin packing with cardinality constraints

DOI10.1016/j.tcs.2013.05.041zbMath1295.91005OpenAlexW2035351791MaRDI QIDQ391143

Leah Epstein, Ron Adar

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.041

zbMATH Keywords

price of anarchyalgorithmic game theoryvariants of bin packing

Mathematics Subject Classification ID

Noncooperative games (91A10) Combinatorial optimization (90C27)

Related Items

Selfish bin packing under harmonic mean cost sharing mechanism, An Incentive Mechanism for Selfish Bin Covering, Selfish bin packing with punishment, Quality of equilibria for selfish bin packing with cost sharing variants, A bin packing game with cardinality constraints under the best cost rule, A new lower bound on the price of anarchy of selfish bin packing, Selfish colorful bin packing games, From packing rules to cost-sharing mechanisms, On the sequential price of anarchy of isolation games

Cites Work

• Unnamed Item
• Unnamed Item
• Selfish bin packing
• Strong equilibrium in congestion games
• Worst-case analysis of the subset sum algorithm for bin packing.
• Algorithms for on-line bin-packing problems with cardinality constraints
• Cardinality constrained bin-packing problems
• Non-cooperative games
• Convergence Time to Nash Equilibrium in Selfish Bin Packing
• Selfish Square Packing
• BOUNDS ON THE CONVERGENCE TIME OF DISTRIBUTED SELFISH BIN PACKING
• AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
• Handbook of Approximation Algorithms and Metaheuristics
• On the online bin packing problem
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
• Approximation schemes for ordered vector packing problems
• Online Bin Packing with Cardinality Constraints