{"id":"https://openalex.org/W3148050248","doi":"https://doi.org/10.1109/ipdps.2006.1639283","title":"On the packing of selfish items","display_name":"On the packing of selfish items","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W3148050248","doi":"https://doi.org/10.1109/ipdps.2006.1639283","mag":"3148050248"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2006.1639283","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027632307","display_name":"Vittorio Bil\u00f2","orcid":"https://orcid.org/0000-0001-7848-4904"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]},{"id":"https://openalex.org/I4210095193","display_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Lecce","ror":"https://ror.org/00qrf6g60","country_code":"IT","type":"facility","lineage":["https://openalex.org/I160013858","https://openalex.org/I4210095193"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"V. Bilo","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di L''Aquila, L'Aquila, Italy","Dipartimento di Matemat, Universit\u00e0 di Lecce, Lecce, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di L''Aquila, L'Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]},{"raw_affiliation_string":"Dipartimento di Matemat, Universit\u00e0 di Lecce, Lecce, Italy","institution_ids":["https://openalex.org/I4210095193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027632307"],"corresponding_institution_ids":["https://openalex.org/I26415053","https://openalex.org/I4210095193"],"apc_list":null,"apc_paid":null,"fwci":1.20567739,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.82300191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"9 pp.","last_page":"9 pp."},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.980400025844574,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9794999957084656,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.868142306804657},{"id":"https://openalex.org/keywords/price-of-anarchy","display_name":"Price of anarchy","score":0.8064532279968262},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.7923751473426819},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5300402641296387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5144500732421875},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.5119501352310181},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5019354820251465},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4924369752407074},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.45634233951568604},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43027615547180176},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.42059075832366943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38723063468933105},{"id":"https://openalex.org/keywords/price-of-stability","display_name":"Price of stability","score":0.3334171772003174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16950294375419617},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.1311652958393097}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.868142306804657},{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.8064532279968262},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.7923751473426819},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5300402641296387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5144500732421875},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.5119501352310181},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5019354820251465},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4924369752407074},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.45634233951568604},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43027615547180176},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.42059075832366943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38723063468933105},{"id":"https://openalex.org/C188466206","wikidata":"https://www.wikidata.org/wiki/Q7242626","display_name":"Price of stability","level":3,"score":0.3334171772003174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16950294375419617},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.1311652958393097},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C556758197","wikidata":"https://www.wikidata.org/wiki/Q580018","display_name":"Monetary economics","level":1,"score":0.0},{"id":"https://openalex.org/C126285488","wikidata":"https://www.wikidata.org/wiki/Q178476","display_name":"Monetary policy","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2006.1639283","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2006.1639283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 20th IEEE International Parallel & Distributed Processing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1512190528","https://openalex.org/W1518233575","https://openalex.org/W1532725322","https://openalex.org/W1547756683","https://openalex.org/W1579673954","https://openalex.org/W1587360560","https://openalex.org/W1635399934","https://openalex.org/W1663599709","https://openalex.org/W1753330597","https://openalex.org/W1994032071","https://openalex.org/W2012552037","https://openalex.org/W2014071862","https://openalex.org/W2030914480","https://openalex.org/W2053387401","https://openalex.org/W2054129049","https://openalex.org/W2061145134","https://openalex.org/W2067050450","https://openalex.org/W2103802594","https://openalex.org/W2112269231","https://openalex.org/W2129639820","https://openalex.org/W2145297839","https://openalex.org/W2153541270","https://openalex.org/W6631508959","https://openalex.org/W6631888713","https://openalex.org/W6637766671","https://openalex.org/W6648749382","https://openalex.org/W6683114956"],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W2768536740","https://openalex.org/W1551616199","https://openalex.org/W2109158305","https://openalex.org/W1600256550","https://openalex.org/W1996249306","https://openalex.org/W201420632","https://openalex.org/W2145335304","https://openalex.org/W2569002229"],"abstract_inverted_index":{"In":[0],"the":[1,6,20,23,31,35,39,50,77,80,91,106,111,120,145,167,170],"non":[2,176],"cooperative":[3,177],"version":[4],"of":[5,22,38,49,76,82,93,108,110,119,161,169],"classical":[7],"minimum":[8],"bin":[9,25],"packing":[10,75],"problem,":[11],"an":[12,99],"item":[13,125],"is":[14],"charged":[15],"a":[16,62,67,102,116,143,151],"cost":[17,172],"according":[18],"to":[19,54,66,85,128],"percentage":[21],"used":[24],"space":[26],"it":[27],"requires.":[28],"We":[29,58],"study":[30,160],"game":[32,63,147],"induced":[33,146],"by":[34],"selfish":[36],"behavior":[37],"items":[40],"which":[41,123],"are":[42],"interested":[43],"in":[44,47,122,131,141,166,175],"being":[45],"packed":[46,130],"one":[48,87,135],"bins":[51],"so":[52],"as":[53],"minimize":[55],"their":[56],"cost.":[57],"prove":[59,90],"that":[60,140],"such":[61,88,142],"always":[64],"converges":[65],"pure":[68,152],"Nash":[69,153],"equilibrium":[70,154],"starting":[71],"from":[72],"any":[73],"initial":[74],"items,":[78],"estimate":[79],"number":[81],"steps":[83],"needed":[84],"reach":[86],"equilibrium,":[89],"hardness":[92],"computing":[94],"good":[95],"equilibria":[96],"and":[97,101],"give":[98],"upper":[100],"lower":[103],"bound":[104],"for":[105],"price":[107],"anarchy":[109],"game.":[112],"Then,":[113],"we":[114,138],"consider":[115],"multidimensional":[117],"extension":[118],"problem":[121,174],"each":[124],"can":[126],"require":[127],"be":[129],"more":[132],"than":[133],"just":[134],"bin.":[136],"Unfortunately,":[137],"show":[139],"case":[144],"may":[148],"not":[149],"admit":[150],"even":[155],"under":[156],"particular":[157],"restrictions.":[158],"The":[159],"these":[162],"games":[163],"finds":[164],"applications":[165],"analysis":[168],"bandwidth":[171],"sharing":[173],"networks":[178]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}