{"id":"https://openalex.org/W1981859328","doi":"https://doi.org/10.1137/s0097539792224474","title":"A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem","display_name":"A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem","publication_year":1995,"publication_date":"1995-02-01","ids":{"openalex":"https://openalex.org/W1981859328","doi":"https://doi.org/10.1137/s0097539792224474","mag":"1981859328"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792224474","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792224474","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Noga Alon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056419022","display_name":"David Peleg","orcid":"https://orcid.org/0000-0003-1590-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Peleg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Douglas West","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083469386"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5188,"has_fulltext":false,"cited_by_count":316,"citation_normalized_percentile":{"value":0.84447855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"24","issue":"1","first_page":"78","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"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.9955000281333923,"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/combinatorics","display_name":"Combinatorics","score":0.8048909902572632},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6133231520652771},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6133164167404175},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5397165417671204},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.5175599455833435},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5050180554389954},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45149514079093933},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.44572579860687256},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44213634729385376},{"id":"https://openalex.org/keywords/multigraph","display_name":"Multigraph","score":0.41203632950782776},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.21772795915603638},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.17769905924797058}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8048909902572632},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6133231520652771},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6133164167404175},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5397165417671204},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.5175599455833435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5050180554389954},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45149514079093933},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.44572579860687256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44213634729385376},{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.41203632950782776},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.21772795915603638},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.17769905924797058},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792224474","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792224474","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1489900072","https://openalex.org/W2016218947","https://openalex.org/W2018963243","https://openalex.org/W2033732243","https://openalex.org/W2047517090","https://openalex.org/W2054033098","https://openalex.org/W2082099352","https://openalex.org/W2086989193","https://openalex.org/W2092534058","https://openalex.org/W2114538202","https://openalex.org/W2139120244","https://openalex.org/W2157827214","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2964122414","https://openalex.org/W2781078086","https://openalex.org/W2114952748","https://openalex.org/W2914213999","https://openalex.org/W341486533","https://openalex.org/W1549308032","https://openalex.org/W2339534957","https://openalex.org/W2151370292","https://openalex.org/W634408543","https://openalex.org/W2081716679"],"abstract_inverted_index":{"This":[0,302],"paper":[1],"investigates":[2],"a":[3,8,30,154,158,166,175,198,203,223,276,323,331],"zero-sum":[4],"game":[5,118,140,145,189,251],"played":[6],"on":[7,119,153,190,216],"weighted":[9],"connected":[10,271],"graph":[11,122],"G":[12,168,191],"between":[13],"two":[14],"players,":[15],"the":[16,20,26,35,45,59,73,84,93,96,106,114,117,136,139,150,185,188,227,244,247,250,261,273,282,308,320,327],"tree":[17,27,32,60,74,107,278],"player":[18,28,37,47],"and":[19,34,89],"edge":[21,36,40,46,87,101,172],"player.":[22],"At":[23,243],"each":[24,171],"play,":[25],"chooses":[29,38],"spanning":[31,277],"T":[33,61,279],"an":[39,253,257],"e.":[41],"The":[42,109,144],"payoff":[43],"to":[44,105,296,307],"is":[48,83,92,103,112,123,133,141,181,192,197,222,231,252,291],"$\\textit{cost}":[49],"(T,":[50],"e)$,":[51],"defined":[52],"as":[53,165],"follows:":[54],"If":[55],"e":[56,68,88,102,173],"lies":[57],"in":[58,72,147,169],"then":[62,75,195],"$\\textit{cost}(T,":[63,76,289],"e)":[64,77],"=":[65,78],"0$;":[66],"if":[67,184],"does":[69],"not":[70],"lie":[71],"cycle(T,":[79],"e)/w(e)$,":[80],"where":[81],"$w(e)$":[82],"weight":[85,94],"of":[86,95,116,138,177,187,206,246,249,288,310,322,330],"$\\textit{cycle}(T,":[90],"e)$":[91,290],"unique":[97],"cycle":[98,328],"formed":[99],"when":[100],"added":[104],"T.":[108],"main":[110],"result":[111,303],"that":[113,135,161,201,230,255,281],"value":[115,137,186],"any":[120,212,217,268],"n-vertex":[121,218,269],"bounded":[124],"above":[125],"by":[126],"$\\exp(O(\\sqrt{\\log":[127,297],"n":[128,235,298],"\\log":[129,130,236,237,299,300],"n}))$.":[131,301],"It":[132,180,313],"conjectured":[134],"$O(\\log":[142],"n)$.":[143],"arises":[146],"connection":[148],"with":[149],"k-server":[151,228],"problem":[152,229],"road":[155,176,219],"network;":[156],"i.e.,":[157],"metric":[159],"space":[160,329],"can":[162],"be":[163],"represented":[164],"multigraph":[167],"which":[170],"represents":[174],"length":[178],"$w(e)$.":[179],"shown":[182],"that,":[183],"$\\textit{Val}(G,":[193],"w)$,":[194],"there":[196,221],"randomized":[199,224],"strategy":[200],"achieves":[202],"competitive":[204,239],"ratio":[205],"$k(1":[207],"+":[208],"\\textit{Val}(G,":[209],"w))$":[210],"against":[211,240],"oblivious":[213,241],"adversary.":[214],"Thus,":[215],"network,":[220],"algorithm":[225,254,274],"for":[226,260,267,326],"$k":[232],"\\cdot":[233],"\\exp(O(\\sqrt{\\log":[234],"n}))$":[238],"adversaries.":[242],"heart":[245],"analysis":[248],"provides":[256],"approximate":[258],"solution":[259],"simple":[262],"network":[263],"design":[264,309],"problem.":[265],"Specifically,":[266],"weighted,":[270],"multigraph,":[272],"constructs":[275],"such":[280],"average,":[283],"over":[284],"all":[285],"edges":[286],"e,":[287],"less":[292],"than":[293],"or":[294],"equal":[295],"has":[304],"potential":[305],"application":[306],"communication":[311],"networks.":[312],"also":[314],"improves":[315],"substantially":[316],"known":[317],"estimates":[318],"concerning":[319],"existence":[321],"sparse":[324],"basis":[325],"graph.":[332]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":19},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}