| 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 | 70 | 2016 |
| 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 | 53 | 2020 |
| 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 | 41 | 2020 |
| 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 | 40 | 2021 |
| Variance allocation and Shapley value R Colini-Baldeschi, M Scarsini, S Vaccari Methodology and Computing in Applied Probability 20, 919-933, 2018 | 35 | 2018 |
| 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 | 32 | 2017 |
| 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 | 29 | 2017 |
| 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 | 24 | 2016 |
| 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 | 19 | 2014 |
| 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 | 18 | 2022 |
| 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 | 18 | 2019 |
| 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 | 16 | 2012 |
| 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 | 14 | 2015 |
| Demand-independent optimal tolls R Colini-Baldeschi, M Klimm, M Scarsini arXiv preprint arXiv:1708.02737, 2017 | 13* | 2017 |
| 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 | 11 | 2016 |
| Envy, regret, and social welfare loss R Colini-Baldeschi, S Leonardi, O Schrijvers, E Sodomka Proceedings of The Web Conference 2020, 2913-2919, 2020 | 8 | 2020 |
| The ad types problem R Colini-Baldeschi, J Mestre, O Schrijvers, CA Wilkens International Conference on Web and Internet Economics, 45-58, 2020 | 7 | 2020 |
| 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 | 7 | 2017 |
| 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 | 4 | 2022 |
| On multiple round sponsored search auctions with budgets R Colini-Baldeschi, M Henzinger, S Leonardi, M Starnberger arXiv preprint arXiv:1112.6361, 2011 | 4 | 2011 |
Stefano LeonardiProfessor of Computer Science, Sapienza University of RomeVerified email at dis.uniroma1.it
