◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

L. Andor

1 paper here

Matching runs newest-first, so older work may not be attached to this profile yet.

fields
  • cs.LG1

identity via Semantic Scholar / OpenAlex

most citedThe on-line shortest path problem under partial monitoring

158 citations · 158 across the 1 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2007★ 158 cited

The on-line shortest path problem under partial monitoring

Andras Gyorgy, Tamas Linder, Gabor Lugosi +1

The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.