| Approximation algorithms for computing maximin share allocations G Amanatidis, E Markakis, A Nikzad, A Saberi ACM Transactions on Algorithms (TALG) 13 (4), 1-28, 2017 | 143 | 2017 |
| Mechanism design for crowdsourcing markets with heterogeneous tasks G Goel, A Nikzad, A Singla Second AAAI Conference on Human Computation and Crowdsourcing, 2014 | 124* | 2014 |
| Optimal iterative pricing over social networks H Akhlaghpour, M Ghodsi, N Haghpanah, VS Mirrokni, H Mahini, ... International workshop on internet and network economics, 415-423, 2010 | 79 | 2010 |
| Budget feasible procurement auctions N Anari, G Goel, A Nikzad Operations Research 66 (3), 637-652, 2018 | 67* | 2018 |
| Thickness and Competition in On-demand Service Platforms A Nikzad | 61* | 2020 |
| What matters in school choice tie-breaking? How competition guides design I Ashlagi, A Nikzad Journal of Economic Theory 190, 105120, 2020 | 54* | 2020 |
| Approximate random allocation mechanisms M Akbarpour, A Nikzad The Review of Economic Studies 87 (6), 2473-2510, 2020 | 45 | 2020 |
| Assigning more students to their top choices: A tiebreaking rule comparison I Ashlagi, A Nikzad, AI Romm Games and Economic Behavior, 2019 | 38* | 2019 |
| Colorful paths in vertex coloring of graphs S Akbari, V Liaghat, A Nikzad the electronic journal of combinatorics, P17-P17, 2011 | 19 | 2011 |
| Optimal online pricing with network externalities S Ehsani, M Ghodsi, A Khajenezhad, H Mahini, A Nikzad Information Processing Letters 112 (4), 118-123, 2012 | 18 | 2012 |
| Financing transplants’ costs of the poor: A dynamic model of global kidney exchange A Nikzad, M Akbarpour, MA Rees, AE Roth Semantic Scholar Corpus ID 173722, 2017 | 14 | 2017 |
| Optimal dynamic allocation: Simplicity through information design I Ashlagi, F Monachou, A Nikzad Proceedings of the 22nd ACM Conference on Economics and Computation, 101-102, 2021 | 12 | 2021 |
| Matching in dynamic imbalanced markets I Ashlagi, A Nikzad, P Strack arXiv preprint arXiv:1809.06824, 2018 | 12 | 2018 |
| Deliver or hold: approximation algorithms for the periodic inventory routing problem T Fukunaga, A Nikzad, R Ravi Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014 | 11 | 2014 |
| Sending secrets swiftly: Approximation algorithms for generalized multicast problems A Nikzad, R Ravi International Colloquium on Automata, Languages, and Programming, 568-607, 2014 | 10 | 2014 |
| Colorful paths in vertex coloring of graphs S Akbari, V Liaghat, A Nikzad | 6 | 2016 |
| Reservation exchange markets for internet advertising G Goel, S Leonardi, V Mirrokni, A Nikzad, R Paes-Leme 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 6 | 2016 |
| Global kidney chains A Nikzad, M Akbarpour, MA Rees, AE Roth Proceedings of the National Academy of Sciences 118 (36), 2021 | 2 | 2021 |
| Persuading a pessimist: Simplicity and robustness A Nikzad Games and Economic Behavior 129, 144-157, 2021 | 2 | 2021 |
| Constrained majorization: Applications in mechanism design A Nikzad Available at SSRN 4030091, 2022 | 1 | 2022 |
Itai AshlagiStanford UniversityVerified email at stanford.edu
