{"id":"https://openalex.org/W3184916350","doi":"https://doi.org/10.1007/s00224-021-10034-z","title":"The subset sum game revisited","display_name":"The subset sum game revisited","publication_year":2021,"publication_date":"2021-02-13","ids":{"openalex":"https://openalex.org/W3184916350","doi":"https://doi.org/10.1007/s00224-021-10034-z","mag":"3184916350"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-021-10034-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-021-10034-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-021-10034-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00224-021-10034-z.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Department of Computer Science, Humboldt University Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Humboldt University Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen, Aachen, Germany"],"raw_orcid":"https://orcid.org/0000-0001-8816-2693","affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080746477"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.1601,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51799241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"65","issue":"5","first_page":"884","last_page":"900"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9934999942779541,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9423009157180786},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.6175822019577026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5923271775245667},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5732200145721436},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5712838768959045},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5168821811676025},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5052722096443176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36646220088005066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3586210608482361},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3433176577091217},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34149497747421265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3407208323478699},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07557910680770874}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9423009157180786},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.6175822019577026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5923271775245667},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5732200145721436},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5712838768959045},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5168821811676025},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5052722096443176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36646220088005066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3586210608482361},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3433176577091217},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34149497747421265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3407208323478699},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07557910680770874},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00224-021-10034-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-021-10034-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-021-10034-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:edoc.hu-berlin.de:18452/27170","is_oa":true,"landing_page_url":"http://edoc.hu-berlin.de/18452/27170","pdf_url":null,"source":{"id":"https://openalex.org/S4306400923","display_name":"edoc Publication server (Humboldt University of Berlin)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39343248","host_organization_name":"Humboldt-Universit\u00e4t zu Berlin","host_organization_lineage":["https://openalex.org/I39343248"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00224-021-10034-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00224-021-10034-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00224-021-10034-z.pdf","source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"1432-4350","issn":["1432-4350","1433-0490"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3184916350.pdf","grobid_xml":"https://content.openalex.org/works/W3184916350.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1991507217","https://openalex.org/W2011039300","https://openalex.org/W2042714866","https://openalex.org/W2046432398","https://openalex.org/W2072408036","https://openalex.org/W2136658137","https://openalex.org/W2319807324","https://openalex.org/W2339632011","https://openalex.org/W2783872100","https://openalex.org/W2962825624","https://openalex.org/W2979583942","https://openalex.org/W3088155299","https://openalex.org/W4205585032"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2981809403","https://openalex.org/W2928681278","https://openalex.org/W2158742617","https://openalex.org/W2803546930","https://openalex.org/W67104275","https://openalex.org/W2094047568","https://openalex.org/W3042483093"],"abstract_inverted_index":{"Abstract":[0],"We":[1,68],"discuss":[2],"a":[3,18,23,28,77,80,96,125,148],"game":[4,108],"theoretic":[5],"variant":[6,135],"of":[7,31,47,61,64,138,142],"the":[8,44,53,58,62,65,72,90,112,120,131,139],"subset":[9],"sum":[10],"problem,":[11],"in":[12,130],"which":[13],"two":[14],"players":[15,33],"compete":[16],"for":[17,95],"common":[19],"resource":[20],"represented":[21],"by":[22],"knapsack.":[24],"Each":[25],"player":[26,39,97],"owns":[27],"private":[29],"set":[30],"items,":[32],"pack":[34],"items":[35,50,63],"alternately,":[36],"and":[37,85,116],"each":[38],"either":[40],"wants":[41],"to":[42,56],"maximize":[43],"total":[45,59],"weight":[46,60,94],"his":[48],"own":[49],"packed":[51],"into":[52],"knapsack":[54],"or":[55,79],"minimize":[57],"other":[66],"player.":[67],"show":[69],"that":[70,86,146],"finding":[71,119],"best":[73,121],"packing":[74,122],"strategy":[75,123],"against":[76,87,124],"hostile":[78],"selfish":[81],"adversary":[82,113,127],"is":[83,114,128],"PSPACE-complete,":[84],"these":[88],"adversaries":[89],"optimal":[91],"reachable":[92],"item":[93],"cannot":[98],"be":[99],"approximated":[100],"within":[101],"any":[102],"constant":[103],"factor":[104],"(unless":[105,156],"P=NP).":[106,157],"The":[107],"becomes":[109],"easier":[110],"when":[111],"short-sighted":[115],"plays":[117],"greedily:":[118],"greedy":[126],"NP-complete":[129],"weak":[132],"sense.":[133],"This":[134],"forms":[136],"one":[137],"rare":[140],"examples":[141],"pseudo-polynomially":[143],"solvable":[144],"problems":[145],"have":[147],"PTAS,":[149],"but":[150],"do":[151],"not":[152],"allow":[153],"an":[154],"FPTAS":[155]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}