{"id":"https://openalex.org/W2111072608","doi":"https://doi.org/10.1137/050646408","title":"A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game","display_name":"A Group-Strategyproof Cost Sharing Mechanism for the Steiner Forest Game","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2111072608","doi":"https://doi.org/10.1137/050646408","mag":"2111072608"},"language":"en","primary_location":{"id":"doi:10.1137/050646408","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050646408","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/7c82b48b-1938-46ed-b59f-51f754e5d581","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jochen K\u00f6nemann","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Leonardi","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \"La Sapienza,\" Via Salaria 113, 00198 Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 di Roma \"La Sapienza,\" Via Salaria 113, 00198 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067080233","display_name":"Guido Sch\u00e4fer","orcid":"https://orcid.org/0000-0002-1923-4902"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Guido Sch\u00e4fer","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Stra\u00dfe des 17. Juni 136, 10623 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046528024","display_name":"Stefan H. M. van Zwam","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Stefan H. M. van Zwam","raw_affiliation_strings":["Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3815,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.95763968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"37","issue":"5","first_page":"1319","last_page":"1341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9966999888420105,"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.9948999881744385,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8174656629562378},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6227367520332336},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5346808433532715},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.53085857629776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.502450704574585},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.48568305373191833},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4708414077758789},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4262849688529968},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41040918231010437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4046200215816498},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3972371816635132},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.37355953454971313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3654029369354248},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.284879595041275},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.26877138018608093},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.17152610421180725}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8174656629562378},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6227367520332336},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5346808433532715},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.53085857629776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.502450704574585},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.48568305373191833},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4708414077758789},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4262849688529968},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41040918231010437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4046200215816498},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3972371816635132},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.37355953454971313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3654029369354248},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.284879595041275},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.26877138018608093},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.17152610421180725},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"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":7,"locations":[{"id":"doi:10.1137/050646408","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050646408","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/7c82b48b-1938-46ed-b59f-51f754e5d581","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/7c82b48b-1938-46ed-b59f-51f754e5d581","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"K\u00f6nemann, J, Leonardi, S, Sch\u00e4fer, G & Zwam, van, S H M 2008, 'A group-strategyproof cost sharing mechanism for the Steiner forest game', SIAM Journal on Computing, vol. 37, no. 5, pp. 1319-1341. https://doi.org/10.1137/050646408","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:649117","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=649117","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.8112","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.8112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~schaefer/ftp/pdf/klsz.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/103743","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-55249095319&partnerID=65&md5=613a3ee66db97329aeae3894bc036996","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:library.tue.nl:649117","is_oa":false,"landing_page_url":"http://repository.tue.nl/649117","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/7c82b48b-1938-46ed-b59f-51f754e5d581","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/7c82b48b-1938-46ed-b59f-51f754e5d581","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 37(5), 1319 - 1341. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/7c82b48b-1938-46ed-b59f-51f754e5d581","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/7c82b48b-1938-46ed-b59f-51f754e5d581","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"K\u00f6nemann, J, Leonardi, S, Sch\u00e4fer, G & Zwam, van, S H M 2008, 'A group-strategyproof cost sharing mechanism for the Steiner forest game', SIAM Journal on Computing, vol. 37, no. 5, pp. 1319-1341. https://doi.org/10.1137/050646408","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1592626066","https://openalex.org/W1990199392","https://openalex.org/W2001139415","https://openalex.org/W2007503572","https://openalex.org/W2011823863","https://openalex.org/W2070664846","https://openalex.org/W2095969632","https://openalex.org/W2107390991","https://openalex.org/W2148352980","https://openalex.org/W2544805158","https://openalex.org/W2621312118","https://openalex.org/W3123380468","https://openalex.org/W4246185962","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W132011890","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688"],"abstract_inverted_index":{"We":[0,77,133],"consider":[1],"a":[2,17,44,66,80,92,117],"game-theoretical":[3],"variant":[4],"of":[5,16,19,30,47,53,96],"the":[6,48,101,123,130,142,148],"Steiner":[7,50,102,124,149],"forest":[8,51,125,150],"problem":[9,126],"in":[10,32],"which":[11,127],"each":[12],"player":[13],"j,":[14],"out":[15],"set":[18],"k":[20],"players,":[21],"strives":[22],"to":[23,116],"connect":[24],"his":[25],"terminal":[26],"pair":[27],"$(s_j,":[28],"t_j)$":[29],"vertices":[31],"an":[33],"undirected,":[34],"edge-weighted":[35],"graph":[36],"G.":[37],"In":[38],"this":[39,75,136],"paper":[40],"we":[41,128],"show":[42,134],"that":[43,84,107,135],"natural":[45],"adaptation":[46],"primal-dual":[49],"algorithm":[52,113],"Agrawal,":[54],"Klein,":[55],"and":[56,69],"Ravi":[57],"[SIAM":[58],"J.":[59],"Comput.,":[60],"24":[61],"(1995),":[62],"pp.":[63],"445\u2013456]":[64],"yields":[65],"2-budget":[67],"balanced":[68],"cross-monotonic":[70,86],"cost":[71,87],"sharing":[72,88],"method":[73,89],"for":[74,100,122,147],"game.":[76,104],"also":[78],"present":[79],"negative":[81],"result,":[82],"arguing":[83],"no":[85],"can":[90],"achieve":[91],"budget":[93],"balance":[94],"factor":[95],"less":[97],"than":[98,141],"2":[99],"tree":[103],"This":[105],"shows":[106],"our":[108],"result":[109],"is":[110,139],"tight.":[111],"Our":[112],"gives":[114],"rise":[115],"new":[118,137],"linear":[119],"programming":[120],"relaxation":[121,138,146],"term":[129],"lifted-cut":[131],"relaxation.":[132],"stronger":[140],"standard":[143],"undirected":[144],"cut":[145],"problem.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}