◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sanath Kumar Krishnamurthy

7 papers hereh-index 8271 citations20 works total

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

author position
  • first author3
  • middle author3
  • last author1

Across the 7 of 7 papers where every author was matched, so the position is known.

fields
  • cs.LG4
  • cs.GT2
  • econ.EM1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedGroupwise Maximin Fair Allocation of Indivisible Goods

11 citations · 18 across the 4 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.LG2020

Tractable contextual bandits beyond realizability

Sanath Kumar Krishnamurthy, Vitor Hadad, Susan Athey

Tractable contextual bandit algorithms often rely on the realizability assumption - i.e., that the true expected reward model belongs to a known class, such as linear functions. In…

cs.LG2020

Survey Bandits with Regret Guarantees

Sanath Kumar Krishnamurthy, Susan Athey

We consider a variant of the contextual bandit problem. In standard contextual bandits, when a user arrives we get the user's complete feature vector and then assign a treatment (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.