Stochastic on-line knapsack problems
Mathematical Programming: Series A and B
On the asymptotic worst case behavior of harmonic fit
Journal of Algorithms
Average-case analysis of off-line and on-line knapsack problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Resource Augmentation for Online Bounded Space Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Online Bin Packing Problem
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Optimal Resource Augmentations for Online Knapsack
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Selling ad campaigns: online algorithms with cancellations
Proceedings of the 10th ACM conference on Electronic commerce
Online Knapsack Problems with Limited Cuts
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the sum minimization version of the online bin covering problem
Discrete Applied Mathematics
Online knapsack with resource augmentation
Information Processing Letters
Online removable knapsack with limited cuts
Theoretical Computer Science
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Online removable square packing
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Online minimization knapsack problem
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Finite-State online algorithms and their automated competitive analysis
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Priority algorithms for the subset-sum problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce an on-line model for a class of hand-making games such as Rummy and Mah-Jang. An input is a sequence of items, u1, . . . , ui, . . . such that 0 ui| 驴 1.0. When ui is given, the on-line player puts it into the bin and can discard any selected items currently in the bin (including ui) under the condition that the total size of the remaining items is at most one. The goal is to make this total size as close to 1.0 as possible when the game ends. We also discuss the multibin model, where the player can select a bin out of the k ones which ui is put into. We prove tight bounds for the competitive ratio of this problem, both for k = 1 and k 驴 2.