37 citations · 61 across the 15 of their papers we have counts for
18 papers
Online Learning in the Random Order Model
Martino Bernasconi, Andrea Celli, Riccardo Colini-Baldeschi +3
In the random-order model for online learning, the sequence of losses is chosen upfront by an adversary and presented to the learner after a random permutation. Any random-order in…
Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets
Riccardo Colini-Baldeschi, Sophie Klumper, Twan Kroll +3
Online advertising systems have recently transitioned to autobidding, allowing advertisers to delegate bidding decisions to automated agents. Each advertiser directs their agent to…
To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model
Riccardo Colini-Baldeschi, Sophie Klumper, Guido Schäfer +1
The realm of algorithms with predictions has led to the development of several new algorithms that leverage (potentially erroneous) predictions to enhance their performance guarant…
Fully Dynamic Online Selection through Online Contention Resolution Schemes
Vashist Avadhanula, Andrea Celli, Riccardo Colini-Baldeschi +2
We study fully dynamic online selection problems in an adversarial/stochastic setting that includes Bayesian online selection, prophet inequalities, posted price mechanisms, and st…
Fair Equilibria in Sponsored Search Auctions: The Advertisers' Perspective
Georgios Birmpas, Andrea Celli, Riccardo Colini-Baldeschi +1
In this work we introduce a new class of mechanisms composed of a traditional Generalized Second Price (GSP) auction and a fair division scheme, in order to achieve some desired le…
The Parity Ray Regularizer for Pacing in Auction Markets
Andrea Celli, Riccardo Colini-Baldeschi, Christian Kroer +1
Budget-management systems are one of the key components of modern auction markets. Internet advertising platforms typically offer advertisers the possibility to pace the rate at wh…
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising
Vashist Avadhanula, Riccardo Colini-Baldeschi, Stefano Leonardi +2
We study the problem of an online advertising system that wants to optimally spend an advertiser's given budget for a campaign across multiple platforms, without knowing the value…
Equilibria in Auctions With Ad Types
Hadi Elzayn, Riccardo Colini-Baldeschi, Brian Lan +1
This paper studies equilibrium quality of semi-separable position auctions (known as the Ad Types setting) with greedy or optimal allocation combined with generalized second-price…
Envy, Regret, and Social Welfare Loss
Riccardo Colini-Baldeschi, Stefano Leonardi, Okke Schrijvers +1
Incentive compatibility (IC) is one of the most fundamental properties of an auction mechanism, including those used for online advertising. Recent methods by Feng et al. and Lahai…
The Ad Types Problem
Riccardo Colini-Baldeschi, Julián Mestre, Okke Schrijvers +1
The Ad Types Problem (without gap rules) is a special case of the assignment problem in which there are types of nodes on one side (the ads), and an ordered set of nodes on the…
Fixed Price Approximability of the Optimal Gain From Trade
Riccardo Colini-Baldeschi, Paul Goldberg, Bart de Keijzer +2
Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions…
Demand-Independent Optimal Tolls
Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini
Wardrop equilibria in nonatomic congestion games are in general inefficient as they do not induce an optimal flow that minimizes the total travel time. Network tolls are a prominen…
When is selfish routing bad? The price of anarchy in light and heavy traffic
Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos +1
This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nonatomic congestion games with multiple origin-destination (O/D) pairs. Empirical s…
Approximately Efficient Two-Sided Combinatorial Auctions
Riccardo Colini-Baldeschi, Paul Goldberg, Bart de Keijzer +3
Mechanism design for one-sided markets has been investigated for several decades in economics and in computer science. More recently, there has been an increased attention on mecha…
Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets
Riccardo Colini-Baldeschi, Stefano Leonardi, Qiang Zhang
We study envy-free pricing mechanisms in matching markets with items and budget constrained buyers. Each buyer is interested in a subset of the items on sale, and she appra…
Variance Allocation and Shapley Value
Riccardo Colini-Baldeschi, Marco Scarsini, Stefano Vaccari
Motivated by the problem of utility allocation in a portfolio under a Markowitz mean-variance choice paradigm, we propose an allocation criterion for the variance of the sum of …
On the Price of Anarchy of Highly Congested Nonatomic Network Games
Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini
We consider nonatomic network games with one source and one destination. We examine the asymptotic behavior of the price of anarchy as the inflow increases. In accordance with some…
On Multiple Round Sponsored Search Auctions with Budgets
Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi +1
In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be…