Indexed by:期刊论文

Date of Publication:2013-08-01

Journal:8th International Tri-Annual Conference on Optimization - Techniques and Applications (ICOTA)

Included Journals:SCIE、EI、CPCI-S、Scopus

Volume:56

Issue:4,SI

Page Number:1457-1462

ISSN No.:0925-5001

Key Words:Equilibrium; Bin packing; Approximation ratio

Abstract:In this paper, we consider a selfish bin packing problem, where each item is a selfish player and wants to minimize its cost. In our new model, if there are k items packed in the same bin, then each item pays a cost 1/k, where k a parts per thousand yen 1. First we find a Nash Equilibrium (NE) in time O(n log n) within a social cost at most 1.69103OPT + 3, where OPT is the social cost of an optimal packing; where n is the number of items or players; then we give tight bounds for the worst NE on the social cost; finally we show that any feasible packing can be converged to a Nash Equilibrium in O(n (2)) steps without increasing the social cost.