Afshin Nikzad

Available identifiers

Publication	Date of Publication	Type
On rank dominance of tie‐breaking rules	2023-10-17	Paper
Matching in Dynamic Imbalanced Markets	2023-06-30	Paper
Rank‐optimal assignments in uniform markets	2022-07-11	Paper
Approximate Random Allocation Mechanisms	2021-09-21	Paper
Persuading a pessimist: simplicity and robustness	2021-08-25	Paper
What matters in school choice tie-breaking? How competition guides design	2021-01-25	Paper
Budget Feasible Procurement Auctions	2020-10-12	Paper
Assigning more students to their top choices: a comparison of tie-breaking rules	2019-05-24	Paper
Approximation Algorithms for Computing Maximin Share Allocations	2018-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4598285	2017-12-19	Paper
Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem	2017-03-22	Paper
Approximation Algorithms for Computing Maximin Share Allocations	2015-10-27	Paper
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems	2014-07-01	Paper
Optimal online pricing with network externalities	2012-05-04	Paper
Colorful paths in vertex coloring of graphs	2011-02-17	Paper

This page was built for person: Afshin Nikzad