| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652459 | Electronic Notes in Discrete Mathematics | 2009 | 6 Pages |
Abstract
We consider a game-theoretic bin packing problem and we study the convergence time to a Nash equilibrium. We show that, if the best-response strategy is used, then the number of steps needed to reach Nash equilibrium is and O(nkwmax), where n, m, k and wmax denotes, resp., the number of items, the number of bins, the number of distinct item sizes, and the size of a largest item.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
