Abstract We discuss a game theoretic variant of the subset sum problem, in which two players compete for common resource represented by knapsack. Each player owns private set items, pack items alternately, and each either wants to maximize total weight his own packed into knapsack or minimize other player. show that finding best packing strategy against hostile selfish adversary is PSPACE-compl...

introduction: amajor problem in the treatment of cancer is the lack of an appropriate method for the early diagnosis of the disease. the chemical reaction within an organ may be reflected in the form of proteomic patterns in the serum, sputum, or urine. laser mass spectrometry is a valuable tool for extracting the proteomic patterns from biological samples. a major challenge in extracting such ...

In this paper, we consider the problem of heterogeneous subset sampling. Each element in a domain set has different probabilities of being included in a sample, which is a subset of the domain set. Drawing a sample from a domain set of size n takes O(n) time if a Naive algorithm is employed. We propose a Hybrid algorithm, which requires O(n) preprocessing time and O(n) extra space. It draws a s...