Skip to content
conftrace_

Matteo Castiglioni

37 papers · 2019–2026 · 7 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.

Jump to papers ↓
+10 more ↓ πŸ—ΊοΈ Taxonomy Completionist (29) 🌍 Conference Polyglot Β· Silver πŸƒ Academic Marathon Β· Sprint πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ”¬ Deep Specialist (14) 🧬 Topic Evolution πŸ† Keyword Champion (4) πŸ† Grand Slam 🀝 Dynamic Duo (30) πŸ‘‘ Triple Crown ⚑ Prolific Year Β· Productive πŸ”₯ Unstoppable Β· Bronze πŸ’Ž Century Club Β· Bronze πŸ—ƒοΈ Keyword Collector (136)

Papers

Truly Adapting to Adversarial Constraints in Constrained MABs COLT 2026 Contract Design Under Approximate Best Responses ICML 2025 Feature-Based Online Bilateral Trade ICLR 2025 Learning Adversarial MDPs with Stochastic Hard Constraints ICML 2025 No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization ICML 2025 Optimal Strong Regret and Violation in Constrained MDPs via Policy Optimization ICLR 2025 Policy Optimization for CMDPs with Bandit Feedback: Learning Stochastic and Adversarial Constraints ICML 2025 The Sample Complexity of Stackelberg Games AISTATS 2025 Bandits with Ranking Feedback NeurIPS 2024 Bandits with Replenishable Knapsacks: the Best of both Worlds ICLR 2024 Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints NeurIPS 2024 Graph-Triggered Rising Bandits ICML 2024 Learning Optimal Contracts: How to Exploit Small Action Spaces ICLR 2024 Online Bayesian Persuasion Without a Clue NeurIPS 2024 Online Information Acquisition: Hiring Multiple Agents ICLR 2024 Online Learning in CMDPs: Handling Stochastic and Adversarial Constraints ICML 2024 Online Learning under Budget and ROI Constraints via Weak Adaptivity ICML 2024 Constrained Phi-Equilibria ICML 2023 Online Mechanism Design for Information Acquisition ICML 2023 Optimal Rates and Efficient Algorithms for Online Bayesian Persuasion ICML 2023 Persuading Farsighted Receivers in MDPs: the Power of Honesty NeurIPS 2023 A Unifying Framework for Online Optimization with Long-Term Constraints NeurIPS 2022 Efficiency of Ad Auctions with Price Displaying AAAI 2022 Online Learning with Knapsacks: the Best of Both Worlds ICML 2022 Public Signaling in Bayesian Ad Auctions IJCAI 2022 Safe Learning in Tree-Form Sequential Decision Making: Handling Hard and Soft Constraints ICML 2022 Sequential Information Design: Learning to Persuade in the Dark NeurIPS 2022 Signaling in Posted Price Auctions AAAI 2022 The Power of Media Agencies in Ad Auctions: Improving Utility through Coordinated Bidding IJCAI 2022 Multi-Receiver Online Bayesian Persuasion ICML 2021 Persuading Voters in District-based Elections AAAI 2021 Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry AAAI 2021 Election Control in Social Networks via Edge Addition or Removal AAAI 2020 Online Bayesian Persuasion NeurIPS 2020 Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud AAAI 2020 Be a Leader or Become a Follower: The Strategy to Commit to with Multiple Leaders IJCAI 2019 Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions IJCAI 2019