On-line Packing and Covering Problems
Developments from a June 1996 seminar on Online algorithms: the state of the art
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
On the structure and complexity of worst-case equilibria
Theoretical Computer Science
Algorithmica
The class constrained bin packing problem with applications to video-on-demand
Theoretical Computer Science
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Theoretical Computer Science
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
How hard is it to find extreme Nash equilibria in network congestion games?
Theoretical Computer Science
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Algorithmica
Comparing online algorithms for bin packing problems
Journal of Scheduling
Computer Science Review
Hi-index | 0.00 |
The bin packing problem, a classical problem in combinatorial optimization, has recently been studied from the viewpoint of algorithmic game theory. In this bin packing game each item is controlled by a selfish player minimizing its personal cost, which in this context is defined as the relative contribution of the size of the item to the total load in the bin.We introduce a related game, the so-called bin coloring game, in which players control colored items and each player aims at packing its item into a bin with as few different colors as possible.We establish existence of Nash and strong as well as weakly and strictly Pareto optimal equilibria in these games in the cases of capacitated and uncapacitated bins. For both kinds of games we determine the prices of anarchy and stability concerning those four equilibrium concepts. Furthermore, we show that extreme Nash equilibria, representatives of the set of Nash equilibria with minimal or maximal number of colors in a bin, can be found in time polynomial in the number of items for the uncapacitated case.