Eva Tardos
7 papers · 2015–2025 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
π Conference Polyglot Β· Silver π Academic Marathon Β· Half π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (15) π£ Hot Topic Early Bird
π§
Keyword Pioneer
Venues
Top co-authors
Research topics
Keywords
regret bound
(4)
game theory
(3)
multi-armed bandit
(2)
no-regret learning
(2)
online algorithm
(2)
resource allocation
(2)
online learning
(2)
thompson sampling
(1)
upper confidence bound
(1)
learning algorithm
(1)
randomized algorithm
(1)
repeated game
(1)
bayesian game
(1)
correlated equilibrium
(1)
competitive ratio
(1)
max-min fairness
(1)
dynamic demand
(1)
randomized strategy
(1)
coarse correlated equilibrium
(1)
price of anarchy
(1)
Papers
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
IJCAI 2025
Approximately Stationary Bandits with Knapsacks
COLT 2023
Karma: Resource Allocation for Dynamic Demands
OSDI 2023
Feedback graph regret bounds for Thompson Sampling and UCB
ALT 2020
Small-loss bounds for online learning with partial information
COLT 2018
Learning in Games: Robustness of Fast Convergence
NeurIPS 2016
No-Regret Learning in Bayesian Games
NeurIPS 2015