{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:11:19Z","timestamp":1710349879959},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,18]],"date-time":"2010-02-18T00:00:00Z","timestamp":1266451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10878-010-9302-1","type":"journal-article","created":{"date-parts":[[2010,2,17]],"date-time":"2010-02-17T15:10:02Z","timestamp":1266419402000},"page":"531-548","source":"Crossref","is-referenced-by-count":4,"title":["Selfish bin coloring"],"prefix":"10.1007","volume":"22","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[]},{"given":"Heike","family":"Sperber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,18]]},"reference":[{"issue":"2","key":"9302_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman N, Feldman M, Mansour Y (2009) Strong price of anarchy. Games Econ Behav 65(2):289\u2013317","journal-title":"Games Econ Behav"},{"key":"9302_CR2","doi-asserted-by":"crossref","first-page":"77","DOI":"10.4086\/toc.2008.v004a004","volume":"4","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich E, Dasgupta A, Tard\u00f3s E, Wexler T (2008) Near-optimal network design with selfish agents. Theory Comput 4:77\u2013109","journal-title":"Theory Comput"},{"key":"9302_CR3","first-page":"287","volume-title":"Contributions to the theory of games","author":"RJ Aumann","year":"1959","unstructured":"Aumann RJ (1959) Acceptable points in general cooperative n-person games. In: Luce RD, Tucker AW (eds) Contributions to the theory of games, vol IV. Princeton University Press, Princeton, pp 287\u2013324"},{"key":"9302_CR4","first-page":"25","volume-title":"Proceedings of the 20th international parallel symposium on distributed processing (IPDPS)","author":"V Bil\u00f2","year":"2006","unstructured":"Bil\u00f2 V (2006) On the packing of selfish items. In: Proceedings of the 20th international parallel symposium on distributed processing (IPDPS). IEEE Press, New York, pp 25\u201329"},{"key":"9302_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-642-02927-1_24","volume-title":"Proceedings of the 36th international colloquium on automata, languages and programming (ICALP)","author":"S Chien","year":"2009","unstructured":"Chien S, Sinclair A (2009) Strong and Pareto price of anarchy in congestion games. In: Albers S, Marchetti-Spaccamela A, Matias Y, Nikoletseas S, Thomas W (eds) Proceedings of the 36th international colloquium on automata, languages and programming (ICALP). LNCS, vol 5555. Springer, Berlin, pp 279\u2013291"},{"key":"9302_CR6","volume-title":"Handbook of approximation algorithms and metaheuristics","author":"EG Coffman Jr","year":"2007","unstructured":"Coffman EG Jr, Csirik J (2007) Performance guarantees for one-dimensional bin packing. In: Gonzales TF (ed) Handbook of approximation algorithms and metaheuristics. Chapman & Hall, London. Chap\u00a032"},{"key":"9302_CR7","volume-title":"Handbook of approximation algorithms and metaheuristics","author":"J Csirik","year":"2007","unstructured":"Csirik J, Leung JYT (2007) Variants of classical one-dimensional bin packing. In: Gonzalez TF (ed) Handbook of approximation algorithms and metaheuristics. Chapman & Hall, London. Chap\u00a033"},{"key":"9302_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online algorithms: the state of the art","author":"J Csirik","year":"1998","unstructured":"Csirik J, Woeginger GJ (1998) On-line packing and covering problems. In: Fiat A, Woeginger GJ (eds) Online algorithms: the state of the art. LNCS, vol 1442. Springer, Berlin, pp 147\u2013177. Chap\u00a07"},{"issue":"1","key":"9302_CR9","doi-asserted-by":"crossref","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj A, V\u00f6cking B (2007) Tight bounds for worst-case equilibria. ACM Trans Algorithms 3(1):4","journal-title":"ACM Trans Algorithms"},{"key":"9302_CR10","author":"L Epstein","year":"2009","unstructured":"Epstein L, Kleiman E (2009) Selfish bin packing. Algorithmica. doi: 10.1007\/s00453-009-9348-6","journal-title":"Algorithmica"},{"issue":"1","key":"9302_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.geb.2008.04.011","volume":"66","author":"A Epstein","year":"2009","unstructured":"Epstein A, Feldman M, Mansour Y (2009) Efficient graph topologies in network routing games. Games Econ Behav 66(1):115\u2013125","journal-title":"Games Econ Behav"},{"key":"9302_CR12","author":"L Epstein","year":"2009","unstructured":"Epstein L, Favrholdt LM, Kohrt JS (2009) Comparing online algorithms for bin packing problems. J Sched. doi: 10.1007\/s10951-009-0129-5","journal-title":"J Sched"},{"key":"9302_CR13","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Proceedings of the 30th international colloquium on automata, languages and programming (ICALP)","author":"R Feldmann","year":"2003","unstructured":"Feldmann R, Gairing M, L\u00fccking T, Monien B, Rode M (2003) Nashification and the coordination ratio for a selfish routing game. In: Baeten JCM, Lenstra JK, Parrow J, Woeginger GJ (eds) Proceedings of the 30th international colloquium on automata, languages and programming (ICALP). LNCS, vol 2719. Springer, Berlin, pp 514\u2013526"},{"issue":"2","key":"9302_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.tcs.2007.02.019","volume":"378","author":"S Fischer","year":"2007","unstructured":"Fischer S, V\u00f6cking B (2007) On the structure and complexity of worst-case equilibria. Theor Comput Sci 378(2):165\u2013174","journal-title":"Theor Comput Sci"},{"issue":"36","key":"9302_CR15","doi-asserted-by":"crossref","first-page":"3305","DOI":"10.1016\/j.tcs.2008.01.004","volume":"410","author":"D Fotakis","year":"2009","unstructured":"Fotakis D, Kontogiannis S, Koutsoupias E, Mavronicolas M, Spirakis P (2009) The structure and complexity of Nash equilibria for a selfish routing game. Theor Comput Sci 410(36):3305\u20133326","journal-title":"Theor Comput Sci"},{"issue":"47\u201349","key":"9302_CR16","doi-asserted-by":"crossref","first-page":"4989","DOI":"10.1016\/j.tcs.2009.07.046","volume":"410","author":"E Gassner","year":"2009","unstructured":"Gassner E, Hatzl J, Krumke SO, Sperber H, Woeginger GJ (2009) How hard is it to find extreme Nash equilibria in network congestion games? Theor Comput Sci 410(47\u201349):4989\u20134999. doi: 10.1016\/j.tcs.2009.07.046","journal-title":"Theor Comput Sci"},{"key":"9302_CR17","series-title":"LNCS","first-page":"528","volume-title":"Proceedings of the 16th annual European symposium on algorithms (ESA)","author":"B Hiller","year":"2008","unstructured":"Hiller B, Vredefeld T (2008) Probabilistic analysis of online bin coloring algorithms via stochastic comparison. In: Halperin D, Mehlhorn K (eds) Proceedings of the 16th annual European symposium on algorithms (ESA). LNCS, vol 5193. Springer, Berlin, pp 528\u2013539"},{"issue":"1\u20132","key":"9302_CR18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"R Holzman","year":"1997","unstructured":"Holzman R, Law-Yone N (1997) Strong equilibrium in congestion games. Games Econ Behav 21(1\u20132):85\u2013101","journal-title":"Games Econ Behav"},{"key":"9302_CR19","unstructured":"Kamin N (1998) On-line optimization of order picking in an automated warehouse. Ph.D. thesis, Technische Universit\u00e4t Berlin"},{"key":"9302_CR20","series-title":"LNCS","first-page":"404","volume-title":"Proceedings of the 16th international symposium on theoretical aspects of computer science (STACS)","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. In: Meinel C, Tison S (eds) Proceedings of the 16th international symposium on theoretical aspects of computer science (STACS). LNCS, vol 1563. Springer, Berlin, pp 404\u2013413"},{"key":"9302_CR21","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput Sci Rev 3:65\u201369","journal-title":"Comput Sci Rev"},{"issue":"1\u20133","key":"9302_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.tcs.2008.05.022","volume":"407","author":"SO Krumke","year":"2008","unstructured":"Krumke SO, de Paepe WE, Stougie L, Rambau J (2008) Bincoloring. Theor Comput Sci 407(1\u20133):231\u2013241","journal-title":"Theor Comput Sci"},{"issue":"1","key":"9302_CR23","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s10878-007-9094-0","volume":"16","author":"M Lin","year":"2008","unstructured":"Lin M, Lin Z, Xu J (2008) Almost optimal solutions for bin coloring problems. J Comb Optim 16(1):16\u201327","journal-title":"J Comb Optim"},{"key":"9302_CR24","volume-title":"Microeconomic theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell A, Whinston MD, Green JG (1995) Microeconomic theory. Oxford University Press, London"},{"issue":"1","key":"9302_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M Mavronicolas","year":"2007","unstructured":"Mavronicolas M, Spirakis P (2007) The price of selfish routing. Algorithmica 48(1):91\u2013126","journal-title":"Algorithmica"},{"key":"9302_CR26","volume-title":"The economics of welfare","author":"AC Pigou","year":"1920","unstructured":"Pigou AC (1920) The economics of welfare. Macmillan Co, New York"},{"key":"9302_CR27","unstructured":"Schm\u00e4hler P (2010) Bin coloring games. Master thesis (teaching qualification), University of Kaiserslautern"},{"issue":"6","key":"9302_CR28","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/jos.86","volume":"4","author":"H Shachnai","year":"2001","unstructured":"Shachnai H, Tamir T (2001) Polynomial time approximation schemes for class-constrained packing problems. J Sched 4(6):313\u2013338","journal-title":"J Sched"},{"issue":"1","key":"9302_CR29","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.tcs.2003.05.006","volume":"321","author":"H Shachnai","year":"2004","unstructured":"Shachnai H, Tamir T (2004) Tight bounds for online class-constrained packing. Theor Comput Sci 321(1):103\u2013123","journal-title":"Theor Comput Sci"},{"issue":"1\u20133","key":"9302_CR30","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.tcs.2008.01.001","volume":"393","author":"EC Xavier","year":"2008","unstructured":"Xavier EC, Miyazawa FK (2008) The class constrained bin packing problem with applications to video-on-demand. Theor Comput Sci 393(1\u20133):240\u2013259","journal-title":"Theor Comput Sci"},{"key":"9302_CR31","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-540-92185-1_50","volume-title":"Proceedings of the 4th international workshop on Internet and network economics (WINE)","author":"G Yu","year":"2008","unstructured":"Yu G, Zhang G (2008) Bin packing of selfish items. In: Papadimitriou C, Zhang S (eds) Proceedings of the 4th international workshop on Internet and network economics (WINE). LNCS, vol 5385. Springer, Berlin, pp 446\u2013453"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9302-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9302-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9302-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:15Z","timestamp":1559261895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9302-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,18]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9302"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9302-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,18]]}}}