Abstract
A cooperative bin packing game is an N-person game, where the player set N consists of k bins of capacity 1 each and n items of sizes a 1, ⋯ ,a n . The value of a coalition of players is defined to be the maximum total size of items in the coalition that can be packed into the bins of the coalition. We adopt the taxation model proposed by Faigle and Kern (1993) [6] and show that the 1/4-core is nonempty for all instances of the bin packing game. This strengthens the main result in [3].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bilò, V.: On the packing of selfish items. In: Proceedings of the 20th International Conference on Parallel and Distributed Processing, IPDPS 2006, p. 45. IEEE Computer Society, Washington, DC (2006)
Caprara, A., Kellerer, H., Pferschy, U.: The multiple subset sum problem. SIAM Journal of Optimization 11, 308–319 (1998)
Caprara, A., Kellerer, H., Pferschy, U.: A 3/4-approximation algorithm for multiple subset sum. Journal of Heuristics 9(2), 99–111 (2003)
Epstein, L., Kleiman, E.: Selfish bin packing. Algorithmica 60, 368–394 (2011)
Faigle, U., Fekete, S., Hochstättler, W., Kern, W.: On approximately fair cost allocation in euclidean tsp games. Operations Research Spektrum 20, 29–37 (1998)
Faigle, U., Kern, W.: On some approximately balanced combinatorial cooperative games. Methods and Models of Operation Research 38, 141–152 (1993)
Faigle, U., Kern, W.: Approximate core allocation for binpacking games. SIAM J. Discrete Math. 11, 387–399 (1998)
Goemans, M.X., Skutella, M.: Cooperative facility location games. Journal of Algorithms 50(2), 194–214 (2004)
Han, X., Chin, F.Y.L., Ting, H.-F., Zhang, G., Zhang, Y.: A new upper bound 2.5545 on 2d online bin packing. ACM Trans. Algorithms 7(4), 50:1–50:18 (2011)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795–824 (2003)
Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 364–372. ACM, New York (2001)
Joosten, B.: Relaxation of 3-partition instances. Master’s thesis, Radboud University (December 2011)
Kern, W., Qiu, X.: Integrality gap analysis for bin packing games. Operations Research Letters 40(5), 360–363 (2012)
Kern, W., Qiu, X.: Note on non-uniform bin packing games. Discrete Applied Mathematics (2012) (in press)
Kuipers, J.: Bin packing games. Mathematical Methods of Operations Research 47, 499–510 (1998)
Liu, Z.: Complexity of core allocation for the bin packing game. Operations Research Letters 37(4), 225–229 (2009)
Woeginger, G.J.: On the rate of taxation in a cooperative bin packing game. Mathematical Methods of Operations Research 42, 313–324 (1995)
Yu, G., Zhang, G.: Bin packing of selfish items. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 446–453. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kern, W., Qiu, X. (2013). The 1/4-Core of the Uniform Bin Packing Game Is Nonempty. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)