Riccardo Colini Baldeschi
Riccardo Colini Baldeschi
Facebook Research
Adresse e-mail validée de fb.com - Page d'accueil
Titre
Citée par
Citée par
Année
Approximately efficient double auctions with strong budget balance
R Colini-Baldeschi, B Keijzer, S Leonardi, S Turchetta
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
412016
Approximately efficient two-sided combinatorial auctions
R Colini-Baldeschi, PW Goldberg, B Keijzer, S Leonardi, T Roughgarden, ...
ACM Transactions on Economics and Computation (TEAC) 8 (1), 1-29, 2020
302020
On the price of anarchy of highly congested nonatomic network games
R Colini-Baldeschi, R Cominetti, M Scarsini
International Symposium on Algorithmic Game Theory, 117-128, 2016
242016
On multiple keyword sponsored search auctions with budgets
R Colini-Baldeschi, S Leonardi, M Henzinger, M Starnberger
ACM Transactions on Economics and Computation (TEAC) 4 (1), 1-34, 2015
212015
The asymptotic behavior of the price of anarchy
R Colini-Baldeschi, R Cominetti, P Mertikopoulos, M Scarsini
International Conference on Web and Internet Economics, 133-145, 2017
192017
Variance allocation and Shapley value
R Colini-Baldeschi, M Scarsini, S Vaccari
Methodology and Computing in Applied Probability 20 (3), 919-933, 2018
162018
Revenue maximizing envy-free fixed-price auctions with budgets
R Colini-Baldeschi, S Leonardi, P Sankowski, Q Zhang
International Conference on Web and Internet Economics, 233-246, 2014
152014
Fixed price approximability of the optimal gain from trade
R Colini-Baldeschi, P Goldberg, B de Keijzer, S Leonardi, S Turchetta
International Conference on Web and Internet Economics, 146-160, 2017
132017
On the asymptotic behavior of the price of anarchy: Is selfish routing bad in highly congested networks
R Colini-Baldeschi, R Cominetti, P Mertikopoulos, M Scarsini
ArXiv e-prints, 2017
92017
Revenue maximizing envy-free pricing in matching markets with budgets
R Colini-Baldeschi, S Leonardi, Q Zhang
International Conference on Web and Internet Economics, 207-220, 2016
82016
Price of anarchy for highly congested routing games in parallel networks
R Colini-Baldeschi, R Cominetti, M Scarsini
Theory of Computing Systems 63 (1), 90-113, 2019
62019
Demand-independent optimal tolls
R Colini-Baldeschi, M Klimm, M Scarsini
arXiv preprint arXiv:1708.02737, 2017
6*2017
Envy, regret, and social welfare loss
R Colini-Baldeschi, S Leonardi, O Schrijvers, E Sodomka
Proceedings of The Web Conference 2020, 2913-2919, 2020
52020
When is selfish routing bad? The price of anarchy in light and heavy traffic
R Colini-Baldeschi, R Cominetti, P Mertikopoulos, M Scarsini
Operations Research 68 (2), 411-434, 2020
42020
On multiple round sponsored search auctions with budgets
R Colini-Baldeschi, M Henzinger, S Leonardi, M Starnberger
arXiv preprint arXiv:1112.6361, 2011
42011
The ad types problem
R Colini-Baldeschi, J Mestre, O Schrijvers, CA Wilkens
International Conference on Web and Internet Economics, 45-58, 2020
32020
The price of anarchy in light and heavy traffic: When is selfish routing bad?
R Colini-Baldeschi, R Cominetti, P Mertikopoulos, M Scarsini
Book of Abstracts, 39, 2017
22017
Stochastic Bandits for Multi-platform Budget Optimization in Online Advertising
V Avadhanula, R Colini-Baldeschi, S Leonardi, KA Sankararaman, ...
arXiv preprint arXiv:2103.10246, 2021
2021
Equilibria in Auctions With Ad Types
H Elzayn, R Colini-Baldeschi, B Lan, O Schrijvers
arXiv preprint arXiv:2103.06177, 2021
2021
Sponsored search auctions
R Colini-Baldeschi
Proceedings of the sixth ACM international conference on Web search and data …, 2013
2013
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20