STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Worst-case analysis of memory allocation algorithms
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Parametric Packing of Selfish Items and the Subset Sum Algorithm
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Algorithmica
Next-fit packs a list and its reverse into the same number of bins
Operations Research Letters
| Hi-index | 0.00 |
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 驴 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.