{"id":"https://openalex.org/W2103802594","doi":"https://doi.org/10.1145/1007352.1007446","title":"Computing Nash equilibria for scheduling on restricted parallel links","display_name":"Computing Nash equilibria for scheduling on restricted parallel links","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2103802594","doi":"https://doi.org/10.1145/1007352.1007446","mag":"2103802594"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5046658423","display_name":"Martin Gairing","orcid":"https://orcid.org/0000-0002-0569-7113"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Gairing","raw_affiliation_strings":["University of Paderborn, Furstenallee, Germany","University of Paderborn, Furstenallee, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Furstenallee, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"University of Paderborn, Furstenallee, Germany#TAB#","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041351482","display_name":"Thomas L\u00fccking","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas L\u00fccking","raw_affiliation_strings":["University of Paderborn, Furstenallee, Germany","University of Paderborn, Furstenallee, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Furstenallee, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"University of Paderborn, Furstenallee, Germany#TAB#","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066537602","display_name":"Marios Mavronicolas","orcid":"https://orcid.org/0009-0009-0115-3045"},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Marios Mavronicolas","raw_affiliation_strings":["University of Cyprus, Nicosia CY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cyprus, Nicosia CY","institution_ids":["https://openalex.org/I34771391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086678348","display_name":"Burkhard Monien","orcid":"https://orcid.org/0000-0003-2334-6795"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Burkhard Monien","raw_affiliation_strings":["University of Paderborn, Furstenallee, Germany","University of Paderborn, Furstenallee, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Paderborn, Furstenallee, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"University of Paderborn, Furstenallee, Germany#TAB#","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9155,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.97517952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"613","last_page":"622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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.9987000226974487,"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/T11031","display_name":"Game Theory and Applications","score":0.998199999332428,"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/T11182","display_name":"Auction Theory and Applications","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.7967053651809692},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6880943775177002},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6839567422866821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6545085906982422},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6162876486778259},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5281370282173157},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5116081833839417},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46024104952812195},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4502618908882141},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4298498034477234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25889357924461365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24948707222938538},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16539263725280762}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7967053651809692},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6880943775177002},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6839567422866821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6545085906982422},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6162876486778259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5281370282173157},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5116081833839417},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46024104952812195},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4502618908882141},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4298498034477234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25889357924461365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24948707222938538},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16539263725280762},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007352.1007446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1493391054","https://openalex.org/W1518233575","https://openalex.org/W1537316992","https://openalex.org/W1577377413","https://openalex.org/W1579673954","https://openalex.org/W1668637896","https://openalex.org/W1753330597","https://openalex.org/W1949395038","https://openalex.org/W1976009178","https://openalex.org/W1977545325","https://openalex.org/W1992734168","https://openalex.org/W1994772417","https://openalex.org/W2044437461","https://openalex.org/W2052586468","https://openalex.org/W2056606651","https://openalex.org/W2061145134","https://openalex.org/W2067050450","https://openalex.org/W2088559962","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2100699015","https://openalex.org/W2100862433","https://openalex.org/W2102201348","https://openalex.org/W2102736491","https://openalex.org/W2104680817","https://openalex.org/W2125537511","https://openalex.org/W2153541270","https://openalex.org/W2154518750","https://openalex.org/W2330024298","https://openalex.org/W3014052784","https://openalex.org/W3124735991","https://openalex.org/W4234761190","https://openalex.org/W6789153387","https://openalex.org/W6992951189"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W2142195909","https://openalex.org/W1966261337","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,170,190],"consider":[1],"the":[2,13,33,36,41,121,124,140,166,197],"problem":[3,37,44],"of":[4,29,45,76,156,181],"routing":[5],"n":[6,47],"users":[7,122],"on":[8,22,196],"m":[9,50],"parallel":[10,51],"links,":[11,162,176],"under":[12],"restriction":[14],"that":[15,117],"each":[16],"user":[17,59,112,168],"may":[18,60],"only":[19],"be":[20],"routed":[21],"a":[23,26,54,85,95,106,115,146],"link":[24,72],"from":[25,73,91,130],"certain":[27],"set":[28,75],"allowed":[30,77],"links":[31],"for":[32,160,200],"user.":[34],"Thus,":[35],"is":[38,118,165],"equivalent":[39],"to":[40,49,70,89,144,174],"correspondingly":[42],"restricted":[43],"assigning":[46],"jobs":[48],"machines.":[52],"In":[53],"pure":[55,96,201],"Nash":[56,97,202],"equilibrium,":[57],"no":[58],"improve":[61],"its":[62,74],"own":[63],"individual":[64],"cost":[65],"(delay)":[66],"by":[67,109,120],"unilaterally":[68],"switching":[69],"another":[71],"links.":[78,125],"As":[79],"our":[80],"main":[81],"result,":[82],"we":[83,127,134],"introduce":[84],"polynomial":[86,188],"time":[87],"algorithm":[88,103,143],"compute":[90],"any":[92],"given":[93,107],"assignment":[94,108],"equilibrium":[98],"with":[99,148,192],"non-increased":[100],"makespan.":[101],"The":[102],"gradually":[104],"changes":[105],"pushing":[110],"unsplittable":[111],"traffics":[113],"through":[114],"network":[116],"defined":[119],"and":[123],"Here,":[126],"use":[128,135],"ideas":[129],"blocking":[131],"flows.":[132],"Furthermore,":[133],"similar":[136],"techniques":[137],"as":[138],"in":[139,187],"generic":[141],"Preflow-Push":[142],"approximate":[145],"schedule":[147],"minimum":[149],"makespan,":[150],"gaining":[151,177],"an":[152,178],"improved":[153],"approximation":[154,179,184],"factor":[155,180],"2":[157],"-":[158],"1/w1":[159],"identical":[161],"where":[163],"w1":[164],"largest":[167],"traffic.":[169],"extend":[171],"this":[172],"result":[173],"related":[175],"2.":[182],"Our":[183],"algorithms":[185],"run":[186],"time.":[189],"close":[191],"tight":[193],"upper":[194],"bounds":[195],"coordination":[198],"ratio":[199],"equilibria.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}