Riccardo Colini-Baldeschi

According to our database, Riccardo Colini-Baldeschi authored at least 26 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model.

Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer, Artem Tsikiridis

CoRR, 2024

2023

Fully Dynamic Online Selection through Online Contention Resolution Schemes.

Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi, Matteo Russo

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Equilibria in Auctions with Ad Types.

Hadi Elzayn, Riccardo Colini-Baldeschi, Brian Lan, Okke Schrijvers

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

The Parity Ray Regularizer for Pacing in Auction Markets.

Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer, Eric Sodomka

Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Explicitly Simple Near-Tie Auctions.

Reshef Meir, Riccardo Colini-Baldeschi

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective.

Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Learning Fair Equilibria in Sponsored Search Auctions.

Andrea Celli, Riccardo Colini-Baldeschi, Stefano Leonardi

CoRR, 2021

Stochastic bandits for multi-platform budget optimization in online advertising.

Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi, Karthik Abinav Sankararaman, Okke Schrijvers

Proceedings of the WWW '21: The Web Conference 2021, 2021

2020

Approximately Efficient Two-Sided Combinatorial Auctions.

Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Tim Roughgarden, Stefano Turchetta

ACM Trans. Economics and Comput., 2020

When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic.

Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini

Oper. Res., 2020

Envy, Regret, and Social Welfare Loss.

Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers, Eric Sodomka

Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

The Ad Types Problem.

Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers, Christopher A. Wilkens

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

2019

Price of Anarchy for Highly Congested Routing Games in Parallel Networks.

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini

Theory Comput. Syst., 2019

2018

Demand-Independent Optimal Tolls.

Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Demand-Independent Tolls.

Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini

CoRR, 2017

On the asymptotic behavior of the price of anarchy: Is selfish routing bad in highly congested networks?

Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini

CoRR, 2017

Fixed Price Approximability of the Optimal Gain from Trade.

Riccardo Colini-Baldeschi, Paul W. Goldberg, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

The Asymptotic Behavior of the Price of Anarchy.

Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

2016

Variance Allocation and Shapley Value.

Riccardo Colini-Baldeschi, Marco Scarsini, Stefano Vaccari

CoRR, 2016

Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets.

Riccardo Colini-Baldeschi, Stefano Leonardi, Qiang Zhang

Proceedings of the Web and Internet Economics - 12th International Conference, 2016

Approximately Efficient Double Auctions with Strong Budget Balance.

Riccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On the Price of Anarchy of Highly Congested Nonatomic Network Games.

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015

On Multiple Keyword Sponsored Search Auctions with Budgets.

Riccardo Colini-Baldeschi, Stefano Leonardi, Monika Henzinger, Martin Starnberger

ACM Trans. Economics and Comput., 2015

2014

Revenue Maximizing Envy-Free Fixed-Price Auctions with Budgets.

Riccardo Colini-Baldeschi, Stefano Leonardi, Piotr Sankowski, Qiang Zhang

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013

Sponsored search auctions.

Riccardo Colini-Baldeschi

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

2011

On Multiple Round Sponsored Search Auctions with Budgets

Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger

CoRR, 2011