Envy-Free Mechanisms with Minimum Number of Cuts. R Alijani, M Farhadi, M Ghodsi, M Seddighin, AS Tajik AAAI, 312-318, 2017 | 37 | 2017 |
Predict and match: Prophet inequalities with uncertain supply R Alijani, S Banerjee, S Gollapudi, K Munagala, K Wang Proceedings of the ACM on Measurement and Analysis of Computing Systems 4 (1 …, 2020 | 13 | 2020 |
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts M Seddighin, M Farhadi, M Ghodsi, R Alijani, AS Tajik Algorithmica 81 (4), 1728-1755, 2019 | 10 | 2019 |
The limits of an information intermediary in auction design R Alijani, S Banerjee, K Munagala, K Wang Proceedings of the 23rd ACM Conference on Economics and Computation, 849-868, 2022 | 9 | 2022 |
The Segmentation-Thickness Tradeoff in Online Marketplaces R Alijani, S Banerjee, S Gollapudi, K Kollias, K Munagala | 8* | 2019 |
Algorithms for Two-sided Online Marketplaces R Alijani Duke University, 2020 | | 2020 |