{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:22Z","timestamp":1767338722077,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1109\/ipdps.2006.1639283","type":"proceedings-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T19:59:56Z","timestamp":1152561596000},"page":"9 pp.","source":"Crossref","is-referenced-by-count":38,"title":["On the packing of selfish items"],"prefix":"10.1109","author":[{"given":"V.","family":"Bilo","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30474-6_6"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380846"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.36.1.48"},{"key":"15","first-page":"547","article-title":"A new model for selfish routing","volume":"2996","author":"lucking","year":"2004","journal-title":"LNCS"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45138-9_49"},{"key":"13","first-page":"387","article-title":"Worst-case equilibria","volume":"1563","author":"koutsoupias","year":"1999","journal-title":"LNCS"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016770831869"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1131-5"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959923"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01737559"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380783"},{"key":"23","first-page":"203","article-title":"How unfair is optimal routing?","author":"roughgarden","year":"2002","journal-title":"Proc of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509971"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"3","first-page":"502","article-title":"Convergence time to nash equilibria","volume":"2719","author":"even-dar","year":"0","journal-title":"LNCS"},{"key":"2","first-page":"413","article-title":"Tight bound for the worst-case equilibria","author":"czumaj","year":"2002","journal-title":"Proc of the 18th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA)"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45208-9_1"},{"journal-title":"Handbook of Scheduling chapter Selfish Routing on the Internet","year":"2004","author":"czumaj","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007446"},{"key":"6","first-page":"123","article-title":"The structure and complexity of nash equilibria for a selfish routing game","author":"fotakis","year":"2002","journal-title":"LNCS"},{"key":"5","first-page":"514","article-title":"Nashification and the coordination ratio for a selfish routing game","author":"feldmann","year":"2003","journal-title":"LNCS"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_55"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_44"}],"event":{"name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","start":{"date-parts":[[2006,4,25]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2006,4,29]]}},"container-title":["Proceedings 20th IEEE International Parallel & Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10917\/34366\/01639283.pdf?arnumber=1639283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T23:14:30Z","timestamp":1489533270000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1639283\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2006.1639283","relation":{},"subject":[],"published":{"date-parts":[[2006]]}}}