Следене
Riccardo Colini Baldeschi
Riccardo Colini Baldeschi
Central Applied Science, Meta
Потвърден имейл адрес: meta.com - Начална страница
Заглавие
Позовавания
Позовавания
Година
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
652016
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
482020
Variance allocation and Shapley value
R Colini-Baldeschi, M Scarsini, S Vaccari
Methodology and Computing in Applied Probability 20, 919-933, 2018
352018
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
342020
Stochastic bandits for multi-platform budget optimization in online advertising
V Avadhanula, R Colini Baldeschi, S Leonardi, KA Sankararaman, ...
Proceedings of the Web Conference 2021, 2805-2817, 2021
322021
The asymptotic behavior of the price of anarchy
R Colini-Baldeschi, R Cominetti, P Mertikopoulos, M Scarsini
Web and Internet Economics: 13th International Conference, WINE 2017 …, 2017
302017
Fixed price approximability of the optimal gain from trade
R Colini-Baldeschi, P Goldberg, B de Keijzer, S Leonardi, S Turchetta
Web and Internet Economics: 13th International Conference, WINE 2017 …, 2017
282017
On the price of anarchy of highly congested nonatomic network games
R Colini-Baldeschi, R Cominetti, M Scarsini
Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool …, 2016
242016
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
192014
Price of anarchy for highly congested routing games in parallel networks
R Colini-Baldeschi, R Cominetti, M Scarsini
Theory of Computing Systems 63, 90-113, 2019
172019
On multiple keyword sponsored search auctions with budgets
R Colini-Baldeschi, M Henzinger, S Leonardi, M Starnberger
International Colloquium on Automata, Languages, and Programming, 1-12, 2012
162012
The parity ray regularizer for pacing in auction markets
A Celli, R Colini-Baldeschi, C Kroer, E Sodomka
Proceedings of the ACM Web Conference 2022, 162-172, 2022
152022
Demand-independent optimal tolls
R Colini-Baldeschi, M Klimm, M Scarsini
arXiv preprint arXiv:1708.02737, 2017
142017
Revenue maximizing envy-free pricing in matching markets with budgets
R Colini-Baldeschi, S Leonardi, Q Zhang
Web and Internet Economics: 12th International Conference, WINE 2016 …, 2016
112016
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
112015
Envy, regret, and social welfare loss
R Colini-Baldeschi, S Leonardi, O Schrijvers, E Sodomka
Proceedings of The Web Conference 2020, 2913-2919, 2020
82020
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
82017
The ad types problem
R Colini-Baldeschi, J Mestre, O Schrijvers, CA Wilkens
International Conference on Web and Internet Economics, 45-58, 2020
72020
On multiple round sponsored search auctions with budgets
R Colini-Baldeschi, M Henzinger, S Leonardi, M Starnberger
arXiv preprint arXiv:1112.6361, 2011
52011
Equilibria in auctions with ad types
H Elzayn, R Colini Baldeschi, B Lan, O Schrijvers
Proceedings of the ACM Web Conference 2022, 68-78, 2022
42022
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20