{"id":"https://openalex.org/W3084669832","doi":"https://doi.org/10.5555/1314498.1314575","title":"The On-Line Shortest Path Problem Under Partial Monitoring","display_name":"The On-Line Shortest Path Problem Under Partial Monitoring","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W3084669832","doi":"https://doi.org/10.5555/1314498.1314575","mag":"3084669832"},"language":"en","primary_location":{"id":"mag:3084669832","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/1314498.1314575","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Machine Learning Research","raw_type":null},"type":"article","indexed_in":[],"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/A5007693475","display_name":"Gy\u00f6rgyAndr\u00e1s","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gy\u00f6rgyAndr\u00e1s","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058457960","display_name":"LinderTam\u00e1s","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"LinderTam\u00e1s","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009452411","display_name":"LugosiG\u00e1bor","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"LugosiG\u00e1bor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072667762","display_name":"Ottucs\u00e0kGy\u00f6rgy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ottucs\u00e0kGy\u00f6rgy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5007693475"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6733,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.77660414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9786999821662903,"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.9786999821662903,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7354223728179932},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.6052892208099365},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5570147633552551},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47835108637809753},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3792129158973694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37195277214050293},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3362465500831604},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18818363547325134},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08410653471946716},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06566458940505981}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7354223728179932},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.6052892208099365},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5570147633552551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47835108637809753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3792129158973694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37195277214050293},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3362465500831604},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18818363547325134},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08410653471946716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06566458940505981},{"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":"mag:3084669832","is_oa":false,"landing_page_url":"https://dl.acm.org/doi/10.5555/1314498.1314575","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Machine Learning Research","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2034315760","https://openalex.org/W2133099431","https://openalex.org/W2028341270","https://openalex.org/W3116340421","https://openalex.org/W1817899449","https://openalex.org/W2120070962","https://openalex.org/W2069295656","https://openalex.org/W1982884812","https://openalex.org/W1504745067","https://openalex.org/W1497433128","https://openalex.org/W3054150437","https://openalex.org/W267514296","https://openalex.org/W2125205064","https://openalex.org/W2394468358","https://openalex.org/W2016824557","https://openalex.org/W3122972250","https://openalex.org/W2960648513","https://openalex.org/W2281976069","https://openalex.org/W2365021834","https://openalex.org/W1564964551"],"abstract_inverted_index":{"The":[0],"on-line":[1],"shortest":[2],"path":[3],"problem":[4],"is":[5],"considered":[6],"under":[7],"various":[8],"models":[9],"of":[10],"partial":[11],"monitoring.":[12],"Given":[13],"a":[14],"weighted":[15],"directed":[16],"acyclic":[17],"graph":[18],"whose":[19],"edge":[20],"weights":[21],"can":[22],"change":[23],"in":[24],"an":[25],"arbitrary":[26],"(adversarial)":[27],"way,":[28],"...":[29]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":53},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}