| 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 | 202 | 2017 |
| Mechanism design for crowdsourcing markets with heterogeneous tasks G Goel, A Nikzad, A Singla Proceedings of the AAAI Conference on Human Computation and Crowdsourcing 2 …, 2014 | 158* | 2014 |
| Thickness and Competition in On-demand Service Platforms A Nikzad | 103* | 2020 |
| Budget feasible procurement auctions N Anari, G Goel, A Nikzad Operations Research 66 (3), 637-652, 2018 | 99* | 2018 |
| Optimal iterative pricing over social networks H Akhlaghpour, M Ghodsi, N Haghpanah, VS Mirrokni, H Mahini, ... Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010 | 82 | 2010 |
| What matters in school choice tie-breaking? How competition guides design I Ashlagi, A Nikzad Journal of Economic Theory 190, 105120, 2020 | 81* | 2020 |
| Assigning more students to their top choices: A tiebreaking rule comparison I Ashlagi, A Nikzad, AI Romm Games and Economic Behavior, 2019 | 58* | 2019 |
| Approximate random allocation mechanisms M Akbarpour, A Nikzad The Review of Economic Studies 87 (6), 2473-2510, 2020 | 54 | 2020 |
| Matching in dynamic imbalanced markets I Ashlagi, A Nikzad, P Strack The Review of Economic Studies 90 (3), 1084-1124, 2023 | 31 | 2023 |
| Optimal Allocation via Waitlists: Simplicity through Information Design https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4599433, 2022 | 26* | 2022 |
| Colorful paths in vertex coloring of graphs S Akbari, V Liaghat, A Nikzad the electronic journal of combinatorics, P17-P17, 2011 | 23 | 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 | 17 | 2012 |
| Rank‐optimal assignments in uniform markets A Nikzad Theoretical Economics 17 (1), 25-55, 2022 | 15 | 2022 |
| 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 |
| Sending secrets swiftly: Approximation algorithms for generalized multicast problems A Nikzad, R Ravi International Colloquium on Automata, Languages, and Programming, 568-607, 2014 | 14 | 2014 |
| 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 | 14 | 2014 |
| Constrained majorization: Applications in mechanism design A Nikzad Proceedings of the 23rd ACM Conference on Economics and Computation, 330-331, 2022 | 13 | 2022 |
| 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 | 12 | 2016 |
| Global kidney chains A Nikzad, M Akbarpour, MA Rees, AE Roth Proceedings of the National Academy of Sciences 118 (36), e2106652118, 2021 | 9 | 2021 |
| Optimal allocation via waitlists: Simplicity through information design I Ashlagi, F Monachou, A Nikzad Review of Economic Studies, rdae013, 2024 | 7 | 2024 |
Itai AshlagiStanford University在 stanford.edu 的电子邮件经过验证
