The following pages link to Afshin Nikzad (Q413255):
Displaying 15 items.
- Optimal online pricing with network externalities (Q413256) (← links)
- Colorful paths in vertex coloring of graphs (Q625379) (← links)
- Persuading a pessimist: simplicity and robustness (Q2049474) (← links)
- What matters in school choice tie-breaking? How competition guides design (Q2220932) (← links)
- Assigning more students to their top choices: a comparison of tie-breaking rules (Q2416641) (← links)
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem (Q2969619) (← links)
- Approximate Random Allocation Mechanisms (Q3382406) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q4554942) (← links)
- (Q4598285) (← links)
- Budget Feasible Procurement Auctions (Q4971366) (← links)
- Rank‐optimal assignments in uniform markets (Q5087336) (← links)
- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems (Q5167870) (← links)
- On rank dominance of tie‐breaking rules (Q6076906) (← links)
- Matching in Dynamic Imbalanced Markets (Q6108946) (← links)
