Probabilistic analysis of algorithms for dual bin packing problems
Journal of Algorithms
On the complexity of cooperative solution concepts
Mathematics of Operations Research
Two simple algorithms for bin covering
Acta Cybernetica
Linear time algorithms for knapsack problems with bounded weights
Journal of Algorithms
Better approximation algorithms for bin covering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
NP-completeness for calculating power indices of weighted majority games
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An asymptotic fully polynomial time approximation scheme for bin covering
Theoretical Computer Science
Approximate Strong Equilibrium in Job Scheduling Games
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
WINE '08 Proceedings of the 4th 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
Optimal on-line algorithms for variable-sized bin covering
Operations Research Letters
Complementary cooperation, minimal winning coalitions, and power indices
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper, we address the selfish bin covering problem, which is greatly related both to the bin covering problem, and to the weighted majority game. What we are mainly concerned with is how much the lack of central coordination harms social welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and several new equilibrium concepts. For each equilibrium concept, the corresponding PoA and PoS are given, and the problems of computing an arbitrary equilibrium, as well as approximating the best one, are also considered.