Riccardo Colini-Baldeschi

46 papers A* 13A 1B 2Journal 24Unranked 6
YearRankTypeTitle / Venue / Authors
2026 A* conf
Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets.
SODA
Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi, Guido Schäfer, Artem Tsikiridis
2025 J jnl
Multicalibration yields better matchings.
CoRR
Riccardo Colini-Baldeschi, Simone Di Gregorio, Simone Fioravanti, Federico Fusco, Ido Guy, Daniel Haimovich, Stefano Leonardi, Fridolin Linder, Lorenzo Perini, Matteo Russo, Niek Tax
2025 J jnl
Online Learning in the Random Order Model.
CoRR
Martino Bernasconi, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco, Stefano Leonardi, Matteo Russo
2025 A* conf
Online Learning in the Random-Order Model.
ICML
Martino Bernasconi, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco, Stefano Leonardi, Matteo Russo
2025 J jnl
Smoothness Meets Autobidding: Tight Price of Anarchy Bounds for Simultaneous First-Price Auctions.
CoRR
Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll, Stefano Leonardi, Guido Schäfer, Artem Tsikiridis
2024 A* conf
Online Learning with Sublinear Best-Action Queries.
NeurIPS
Matteo Russo, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco, Daniel Haimovich, Dima Karamshuk, Stefano Leonardi, Niek Tax
2024 J jnl
Online Learning with Sublinear Best-Action Queries.
CoRR
Matteo Russo, Andrea Celli, Riccardo Colini-Baldeschi, Federico Fusco, Daniel Haimovich, Dima Karamshuk, Stefano Leonardi, Niek Tax
2024 A* conf
To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model.
EC
Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
2024 J jnl
To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model.
CoRR
Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer, Artem Tsikiridis
2023 A* conf
Fully Dynamic Online Selection through Online Contention Resolution Schemes.
AAAI
Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo
2023 J jnl
Fully Dynamic Online Selection through Online Contention Resolution Schemes.
CoRR
Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo
2022 A* conf
Equilibria in Auctions with Ad Types.
WWW
Hadi Elzayn, Riccardo Colini-Baldeschi, Brian Lan, Okke Schrijvers
2022 B conf
Explicitly Simple Near-Tie Auctions.
SAGT
Reshef Meir, Riccardo Colini-Baldeschi
2022 A* conf
Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective.
IJCAI
Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi
2022 A* conf
The Parity Ray Regularizer for Pacing in Auction Markets.
WWW
Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer, Eric Sodomka
2021 J jnl
Equilibria in Auctions With Ad Types.
CoRR
Hadi Elzayn, Riccardo Colini-Baldeschi, Brian Lan, Okke Schrijvers
2021 J jnl
Learning Fair Equilibria in Sponsored Search Auctions.
CoRR
Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi
2021 J jnl
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising.
CoRR
Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
2021 A* conf
Stochastic bandits for multi-platform budget optimization in online advertising.
WWW
Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers
2021 J jnl
The Parity Ray Regularizer for Pacing in Auction Markets.
CoRR
Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer, Eric Sodomka
2020 J jnl
Approximately Efficient Two-Sided Combinatorial Auctions.
ACM Trans. Economics and Comput.
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2020 A* conf
Envy, Regret, and Social Welfare Loss.
WWW
Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka
2020 — conf
The Ad Types Problem.
WINE
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens
2020 J jnl
When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic.
Oper. Res.
Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini
2019 J jnl
Envy, Regret, and Social Welfare Loss.
CoRR
Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka
2019 J jnl
Price of Anarchy for Highly Congested Routing Games in Parallel Networks.
Theory Comput. Syst.
Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini
2019 J jnl
The Ad Types Problem.
CoRR
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens
2018 A* conf
Demand-Independent Optimal Tolls.
ICALP
Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
2017 A* conf
Approximately Efficient Two-Sided Combinatorial Auctions.
EC
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2017 J jnl
Demand-Independent Tolls.
CoRR
Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
2017 J jnl
Fixed Price Approximability of the Optimal Gain From Trade.
CoRR
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta
2017 — conf
Fixed Price Approximability of the Optimal Gain from Trade.
WINE
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta
2017 J jnl
On the asymptotic behavior of the price of anarchy: Is selfish routing bad in highly congested networks?
CoRR
Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini
2017 — conf
The Asymptotic Behavior of the Price of Anarchy.
WINE
Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini
2016 A* conf
Approximately Efficient Double Auctions with Strong Budget Balance.
SODA
Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta
2016 J jnl
Approximately Efficient Two-Sided Combinatorial Auctions.
CoRR
Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta
2016 B conf
On the Price of Anarchy of Highly Congested Nonatomic Network Games.
SAGT
Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini
2016 J jnl
On the Price of Anarchy of Highly Congested Nonatomic Network Games.
CoRR
Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini
2016 — conf
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets.
WINE
Riccardo Colini-Baldeschi, Stefano Leonardi, Qiang Zhang
2016 J jnl
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets.
CoRR
Riccardo Colini-Baldeschi, Stefano Leonardi, Qiang Zhang
2016 J jnl
Variance Allocation and Shapley Value.
CoRR
Riccardo Colini-Baldeschi, Marco Scarsini, Stefano Vaccari
2015 J jnl
On Multiple Keyword Sponsored Search Auctions with Budgets.
ACM Trans. Economics and Comput.
Riccardo Colini-Baldeschi, Stefano Leonardi, Monika Henzinger, Martin Starnberger
2014 — conf
Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.
WINE
Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski, Qiang Zhang
2013 A conf
Sponsored search auctions.
WSDM
Riccardo Colini-Baldeschi
2012 — conf
On Multiple Keyword Sponsored Search Auctions with Budgets.
ICALP (2)
Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger
2011 J jnl
On Multiple Round Sponsored Search Auctions with Budgets
CoRR
Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger