Francesco Bacchiocchi
8 papers · 2022–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 ↓
🌍
Conference Polyglot · Silver
🌉
Interdisciplinary Bridge · Bronze
🗺️
Taxonomy Completionist
(18)
⚡
Prolific Year · Productive
Top co-authors
Research topics
Keywords
online learning
(5)
principal-agent problem
(3)
regret bound
(3)
bayesian persuasion
(2)
mechanism design
(2)
multi-armed bandit
(2)
sublinear regret
(2)
bayesian auctions
(1)
sample complexity
(1)
game theory
(1)
stochastic reward
(1)
online learning algorithm
(1)
adversarial setting
(1)
algorithm
(1)
learnability
(1)
regret minimization
(1)
sequential decision making
(1)
online algorithm
(1)
revenue optimization
(1)
no-regret learning
(1)
Papers
Contract Design Under Approximate Best Responses
ICML 2025
The Sample Complexity of Stackelberg Games
AISTATS 2025
Autoregressive Bandits
AISTATS 2024
Bandits with Ranking Feedback
NeurIPS 2024
Learning Optimal Contracts: How to Exploit Small Action Spaces
ICLR 2024
Online Bayesian Persuasion Without a Clue
NeurIPS 2024
Online Learning with Off-Policy Feedback in Adversarial MDPs
IJCAI 2024
Public Signaling in Bayesian Ad Auctions
IJCAI 2022