Afshin Nikzad
Afshin Nikzad
Assistant Professor of Economics, University of Southern California (USC)
Verified email at usc.edu - Homepage
Title
Cited by
Cited by
Year
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
1102017
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 (1), 2014
107*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
772010
Budget Feasible Procurement Auctions
N Anari, G Goel, A Nikzad
Operations Research 66 (3), 637-652, 2018
60*2018
What matters in school choice tie-breaking? How competition guides design
I Ashlagi, A Nikzad
Journal of Economic Theory 190, 105120, 2020
42*2020
Thickness and Competition in On-demand Service Platforms
A Nikzad
42*2020
Assigning more students to their top choices: A tiebreaking rule comparison
I Ashlagi, A Nikzad, AI Romm
Games and Economic Behavior, 2019
34*2019
Approximate random allocation mechanisms
M Akbarpour, A Nikzad
The Review of Economic Studies 87 (6), 2473-2510, 2020
322020
Colorful paths in vertex coloring of graphs
S Akbari, V Liaghat, A Nikzad
the electronic journal of combinatorics, P17-P17, 2011
192011
Optimal online pricing with network externalities
S Ehsani, M Ghodsi, A Khajenezhad, H Mahini, A Nikzad
Information Processing Letters 112 (4), 118-123, 2012
182012
Financing transplants’ costs of the poor: A dynamic model of global kidney exchange
A Nikzad, M Akbarpour, MA Rees, AE Roth
Technical report, Stanford University Working Paper, 2017
132017
Matching in dynamic imbalanced markets
I Ashlagi, A Nikzad, P Strack
Available at SSRN 3251632, 2019
112019
Sending secrets swiftly: Approximation algorithms for generalized multicast problems
A Nikzad, R Ravi
International Colloquium on Automata, Languages, and Programming, 568-607, 2014
82014
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
72014
Optimal Dynamic Allocation: Simplicity through Information Design
I Ashlagi, F Monachou, A Nikzad
Available at SSRN, 2020
52020
Colorful paths in vertex coloring of graphs
S Akbari, V Liaghat, A Nikzad
52016
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
42016
Persuading a Pessimist: Simplicity and Robustness
A Nikzad
Games and Economic Behavior, 2021
2021
Rank-optimal assignments in uniform markets
A Nikzad
2021
On Rank Dominance of Tie-Breaking Rules
M Allman, I Ashlagi, A Nikzad
2021
The system can't perform the operation now. Try again later.
Articles 1–20