Bin packing games

We consider bin packing games introduced by Faigle and Kern (1993) and we restrict ourselves to the subclass of games for which all bins have unit capacity and all items are larger than 1/3. We adopt the taxation model of Faigle and Kern and we prove that for a tax-rate of epsilon = 1/7 the E-core is always non empty. The bound is sharp, since for every epsilon <1/7 them exist instances of the bin packing game within our sublass with an empty epsilon-core.