| WeBuildAI: Participatory framework for algorithmic governance MK Lee, D Kusbit, A Kahng, JT Kim, X Yuan, A Chan, D See, ... Proceedings of the ACM on human-computer interaction 3 (CSCW), 1-35, 2019 | 354 | 2019 |
| Formal barriers to longest-chain proof-of-stake protocols J Brown-Cohen, A Narayanan, A Psomas, SM Weinberg Proceedings of the 2019 ACM Conference on Economics and Computation, 459-473, 2019 | 124 | 2019 |
| The sample complexity of auctions with side information NR Devanur, Z Huang, CA Psomas Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 124 | 2016 |
| Fair division with binary valuations: One rule to rule them all D Halpern, AD Procaccia, A Psomas, N Shah Web and Internet Economics: 16th International Conference, WINE 2020 …, 2020 | 95 | 2020 |
| Strategyproof allocation of discrete jobs on multiple machines E Friedman, A Ghodsi, CA Psomas Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 71 | 2014 |
| How to make envy vanish over time G Benade, AM Kazachkov, AD Procaccia, CA Psomas Proceedings of the 2018 ACM Conference on Economics and Computation, 593-610, 2018 | 69 | 2018 |
| Fairness-efficiency tradeoffs in dynamic fair division D Zeng, A Psomas Proceedings of the 21st ACM Conference on Economics and Computation, 911-912, 2020 | 59 | 2020 |
| On the complexity of dynamic mechanism design C Papadimitriou, G Pierrakos, CA Psomas, A Rubinstein Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 56 | 2016 |
| On worst-case allocations in the presence of indivisible goods E Markakis, CA Psomas International Workshop on Internet and Network Economics, 278-289, 2011 | 48 | 2011 |
| On the competition complexity of dynamic mechanism design S Liu, CA Psomas Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 46* | 2018 |
| Statistical foundations of virtual democracy A Kahng, MK Lee, R Noothigattu, A Procaccia, CA Psomas International Conference on Machine Learning, 3173-3182, 2019 | 45 | 2019 |
| Dynamic fair division with minimal disruptions E Friedman, CA Psomas, S Vardi Proceedings of the sixteenth ACM conference on Economics and Computation …, 2015 | 42 | 2015 |
| Controlled dynamic fair division E Friedman, CA Psomas, S Vardi Proceedings of the 2017 ACM Conference on Economics and Computation, 461-478, 2017 | 41 | 2017 |
| Achieving a fairer future by changing the past J He, A Psomas, AD Procaccia, D Zeng Proceedings of the 28th International Joint Conference on Artificial …, 2019 | 35 | 2019 |
| Leakage inversion: Towards quantifying privacy in searchable encryption EM Kornaropoulos, N Moyer, C Papamanthou, A Psomas Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022 | 31 | 2022 |
| Explainable voting D Peters, AD Procaccia, A Psomas, Z Zhou NeurIPS, 2020 | 29 | 2020 |
| Optimal multi-unit mechanisms with private demands NR Devanur, N Haghpanah, CA Psomas Proceedings of the 2017 ACM Conference on Economics and Computation, 41-42, 2017 | 26 | 2017 |
| Beyond beyond dominant resource fairness: Indivisible resource allocation in clusters CA Psomas, J Schwartz Tech Report Berkeley, Tech. Rep., 2013 | 25 | 2013 |
| Fair and efficient allocations without obvious manipulations A Psomas, P Verma Advances in Neural Information Processing Systems 35, 13342-13354, 2022 | 22 | 2022 |
| Fair and efficient online allocations with normalized valuations V Gkatzelis, A Psomas, X Tan Proceedings of the AAAI conference on artificial intelligence 35 (6), 5440-5447, 2021 | 22 | 2021 |
Ariel ProcacciaGordon McKay Professor of Computer Science, Harvard University在 seas.harvard.edu 的电子邮件经过验证
