{"id":"https://openalex.org/W2124584369","doi":"https://doi.org/10.1109/gamenets.2009.5137378","title":"Minimum cut tree games","display_name":"Minimum cut tree games","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2124584369","doi":"https://doi.org/10.1109/gamenets.2009.5137378","mag":"2124584369"},"language":"en","primary_location":{"id":"doi:10.1109/gamenets.2009.5137378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gamenets.2009.5137378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Conference on Game Theory for Networks","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/A5052192208","display_name":"Anne M. Schwahn","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Anne M. Schwahn","raw_affiliation_strings":["Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","University of Kaiserslautern, Department of Mathematics, P.O.Box 3049, 67653, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]},{"raw_affiliation_string":"University of Kaiserslautern, Department of Mathematics, P.O.Box 3049, 67653, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052192208"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16833595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":"25"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958000183105469,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9904999732971191,"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/shapley-value","display_name":"Shapley value","score":0.6981942057609558},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.637668251991272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5418155789375305},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5371046662330627},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.48391515016555786},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48156288266181946},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47257697582244873},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46895474195480347},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.45401066541671753},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4522651731967926},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.443070650100708},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4221877455711365},{"id":"https://openalex.org/keywords/terminal","display_name":"Terminal (telecommunication)","score":0.41582125425338745},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3768148124217987},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3706682324409485},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.3044728934764862},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.1532631814479828}],"concepts":[{"id":"https://openalex.org/C199022921","wikidata":"https://www.wikidata.org/wiki/Q240046","display_name":"Shapley value","level":3,"score":0.6981942057609558},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.637668251991272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5418155789375305},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5371046662330627},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.48391515016555786},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48156288266181946},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47257697582244873},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46895474195480347},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.45401066541671753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4522651731967926},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.443070650100708},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4221877455711365},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.41582125425338745},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3768148124217987},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3706682324409485},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3044728934764862},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.1532631814479828},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/gamenets.2009.5137378","is_oa":false,"landing_page_url":"https://doi.org/10.1109/gamenets.2009.5137378","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Conference on Game Theory for Networks","raw_type":"proceedings-article"},{"id":"pmh:oai:kluedo.ub.rptu.de:2049","is_oa":false,"landing_page_url":"https://kluedo.ub.rptu.de/frontdoor/index/index/docId/2049","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"},{"id":"pmh:oai:kluedo.ub.uni-kl.de:2049","is_oa":false,"landing_page_url":"https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2049","pdf_url":null,"source":{"id":"https://openalex.org/S4306402046","display_name":"Publication Server of Kaiserslautern University of Technology (Kaiserslautern University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I153267046","host_organization_name":"University of Kaiserslautern","host_organization_lineage":["https://openalex.org/I153267046"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"report"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1562095019","https://openalex.org/W1562353621","https://openalex.org/W1965680834","https://openalex.org/W1966848756","https://openalex.org/W1986207529","https://openalex.org/W1995443028","https://openalex.org/W1999587457","https://openalex.org/W2002531683","https://openalex.org/W2017927472","https://openalex.org/W2028847614","https://openalex.org/W2034333234","https://openalex.org/W2046116913","https://openalex.org/W2076332815","https://openalex.org/W2093595418","https://openalex.org/W2099463627","https://openalex.org/W2115049345","https://openalex.org/W2115064460","https://openalex.org/W2117934716","https://openalex.org/W4213060883","https://openalex.org/W4255306344","https://openalex.org/W6722226382"],"related_works":["https://openalex.org/W2121204510","https://openalex.org/W2095284441","https://openalex.org/W3141688457","https://openalex.org/W3155269421","https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2141353198","https://openalex.org/W2078695342","https://openalex.org/W2039086323","https://openalex.org/W2188409860"],"abstract_inverted_index":{"In":[0,24],"this":[1,66],"paper":[2],"we":[3,136],"introduce":[4],"a":[5,25,28,36,43,54,85],"cooperative":[6],"game":[7,119],"based":[8],"on":[9],"the":[10,46,70,104,107,118,142,145],"minimum":[11,55,60,71],"cut":[12,72,75],"tree":[13,76],"problem":[14],"which":[15],"is":[16,100,120,127],"also":[17],"known":[18],"as":[19],"multi-terminal":[20],"maximum":[21],"flow":[22],"problem.":[23,111],"routing":[26],"situation":[27],"network":[29,44],"with":[30],"capacities":[31],"induced":[32],"by":[33,42],"vertices":[34],"of":[35,57,106,134,144],"coalition":[37],"has":[38],"to":[39,65,80,103],"be":[40,81,91],"substituted":[41],"providing":[45],"same":[47],"capacity":[48],"for":[49,128,132,141],"non-simultaneous":[50],"flows":[51],"but":[52],"having":[53],"number":[56],"edges":[58],"and":[59,84,131],"total":[61],"capacity.":[62],"The":[63],"solutions":[64],"requirement":[67],"are":[68,78],"exactly":[69],"trees.":[73],"Minimum":[74],"games":[77],"shown":[79],"totally":[82],"balanced":[83],"solution":[86,105],"in":[87,93,123],"their":[88],"core":[89,98],"can":[90],"obtained":[92],"polynomial":[94],"time.":[95],"This":[96],"special":[97,129],"allocation":[99],"closely":[101],"related":[102],"original":[108],"graph":[109],"theoretical":[110],"We":[112],"give":[113,137],"an":[114,138],"example":[115],"showing":[116],"that":[117],"not":[121],"supermodular":[122],"general,":[124],"however,":[125],"it":[126],"cases":[130],"some":[133],"those":[135],"explicit":[139],"formula":[140],"calculation":[143],"Shapley":[146],"value.":[147]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}