Stefano Leonardi
11 papers · 2016–2026 · 6 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 ↓+6 more ↓ Show less ↑
🗺️ Taxonomy Completionist (24) 🏃 Academic Marathon · Half 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Silver 🐣 Hot Topic Early Bird
🏆
Keyword Champion
🧬
Topic Evolution
📈
Trend Setter
🔥
Unstoppable · Bronze
💎
Century Club · Bronze
🗃️
Keyword Collector
(67)
Top co-authors
Research topics
Keywords
regret bound
(5)
online algorithm
(4)
mechanism design
(3)
online learning
(3)
regret minimization
(2)
smoothed adversary
(2)
approximation algorithm
(2)
submodular maximization
(2)
knapsack constraint
(2)
combinatorial optimization
(2)
bilateral trade
(2)
fixed-price mechanism
(2)
combinatorial algorithm
(1)
query complexity
(1)
graph clustering
(1)
online convex optimization
(1)
variance reduction
(1)
game theory
(1)
regret analysis
(1)
multi-armed bandit
(1)
Papers
Online Convex Optimization with Sublinear Noisy Probes
COLT 2026
Online Learning in the Random-Order Model
ICML 2025
Online Learning with Sublinear Best-Action Queries
NeurIPS 2024
Regret Analysis of Bilateral Trade with a Smoothed Adversary
JMLR 2024
Fully Dynamic Online Selection through Online Contention Resolution Schemes
AAAI 2023
Repeated Bilateral Trade Against a Smoothed Adversary
COLT 2023
Fair Equilibria in Sponsored Search Auctions: The Advertisers’ Perspective
IJCAI 2022
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
NeurIPS 2020
Online Revenue Maximization for Server Pricing
IJCAI 2020
Community Detection on Evolving Graphs
NeurIPS 2016