Stefano Leonardi 0001
32 publications
17 venues
H Index 15
Affiliation
Sapienza University of Rome, Department of Computer, Control and Management Engineering, ItalyMax Planck Institute for Informatics, Saarbr cken, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Online Learning in the Random-Order Model.
|
ICML | 2025 | 0 |
| Algorithmically Fair Maximization of Multiple Submodular Objective Functions.
|
AAMAS | 2025 | 0 |
| Online Learning with Sublinear Best-Action Queries.
|
NIPS/NeurIPS | 2024 | 1 |
| Regret Analysis of Bilateral Trade with a Smoothed Adversary.
|
JMLR | 2024 | 13 |
| Fully Dynamic Online Selection through Online Contention Resolution Schemes.
|
AAAI | 2023 | 1 |
| Repeated Bilateral Trade Against a Smoothed Adversary.
|
COLT | 2023 | 18 |
| Prophet Inequalities via the Expected Competitive Ratio.
|
WINE | 2023 | 0 |
| FbMultiLingMisinfo: Challenging Large-Scale Multilingual Benchmark for Misinformation Detection.
|
IJCNN | 2022 | 15 |
| Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective.
|
IJCAI | 2022 | 0 |
| Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
|
JAIR | 2022 | 0 |
| Online revenue maximization for server pricing.
|
Autonomous Agents and Multi-Agent Systems | 2022 | 0 |
| Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity.
|
ICML | 2021 | 16 |
| Stochastic bandits for multi-platform budget optimization in online advertising.
|
WWW | 2021 | 39 |
| Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness.
|
WINE | 2021 | 19 |
| Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint.
|
NIPS/NeurIPS | 2020 | 49 |
| Online Revenue Maximization for Server Pricing.
|
IJCAI | 2020 | 0 |
| Envy, Regret, and Social Welfare Loss.
|
WWW | 2020 | 0 |
| Algorithms for Hiring and Outsourcing in the Online Labor Market.
|
KDD | 2018 | 24 |
| Fixed Price Approximability of the Optimal Gain from Trade.
|
WINE | 2017 | 32 |
| Network-Aware Recommendations of Novel Tweets.
|
SIGIR | 2016 | 16 |
| Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets.
|
WINE | 2016 | 8 |
| Community Detection on Evolving Graphs.
|
NIPS/NeurIPS | 2016 | 24 |
| Bidding Strategies for Fantasy-Sports Auctions.
|
WINE | 2016 | 5 |
| Competitive Influence in Social Networks: Convergence, Submodularity, and Competition Effects.
|
AAMAS | 2015 | 8 |
| Sequential Posted Price Mechanisms with Correlated Valuations.
|
WINE | 2015 | 0 |
| Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.
|
WINE | 2014 | 19 |
| Reduce and aggregate: similarity ranking in multi-categorical bipartite graphs.
|
WWW | 2014 | 11 |
| Online team formation in social networks.
|
WWW | 2012 | 346 |
| Stochastic query covering.
|
WSDM | 2011 | 16 |
| Power in unity: forming teams in large-scale community systems.
|
CIKM | 2010 | 143 |
| Mining Large Networks with Subgraph Counting.
|
ICDM | 2008 | 75 |
| Game-Theoretic Analysis of Internet Switching with Selfish Users.
|
WINE | 2005 | 51 |