Afshin Nikzad

According to our database, Afshin Nikzad authored at least 20 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Expressiveness, Cost, and Collectivism: How the Design of Preference Languages Shapes Participation in Algorithmic Decision-Making.

Samantha Robertson, Tonya Nguyen, Cathy Hu, Catherine Albiston, Afshin Nikzad, Niloufar Salehi

Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, 2023

2022

Constrained Majorization: Applications in Mechanism Design.

Afshin Nikzad

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021

Persuading a pessimist: Simplicity and robustness.

Afshin Nikzad

Games Econ. Behav., 2021

Optimal Dynamic Allocation: Simplicity through Information Design.

Itai Ashlagi, Faidra Georgia Monachou, Afshin Nikzad

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

2020

What matters in school choice tie-breaking? How competition guides design.

Itai Ashlagi, Afshin Nikzad

J. Econ. Theory, 2020

2019

Assigning more students to their top choices: A comparison of tie-breaking rules.

Itai Ashlagi, Afshin Nikzad, Assaf Romm

Games Econ. Behav., 2019

2018

Budget Feasible Procurement Auctions.

Nima Anari, Gagan Goel, Afshin Nikzad

Oper. Res., 2018

2017

Approximation Algorithms for Computing Maximin Share Allocations.

Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi

ACM Trans. Algorithms, 2017

2016

What Matters in School Choice Tie-breakings?: How Competition Guides Design.

Itai Ashlagi, Afshin Nikzad

Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Reservation Exchange Markets for Internet Advertising.

Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison.

Itai Ashlagi, Afshin Nikzad, Assaf Romm

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014

Mechanisms Design for Crowdsourcing: An Optimal 1-1/e Approximate Budget-Feasible Mechanism for Large Markets.

Nima Anari, Gagan Goel, Afshin Nikzad

CoRR, 2014

Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets.

Gagan Goel, Afshin Nikzad, Adish Singla

Proceedings of the 23rd International World Wide Web Conference, 2014

Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems.

Afshin Nikzad, R. Ravi

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Mechanism Design for Crowdsourcing Markets with Heterogeneous Tasks.

Gagan Goel, Afshin Nikzad, Adish Singla

Proceedings of the Seconf AAAI Conference on Human Computation and Crowdsourcing, 2014

Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets.

Nima Anari, Gagan Goel, Afshin Nikzad

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem.

Takuro Fukunaga, Afshin Nikzad, R. Ravi

Proceedings of the Approximation, 2014

2012

Optimal online pricing with network externalities.

Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad

Inf. Process. Lett., 2012

2011

Colorful Paths in Vertex Coloring of Graphs.

Saieed Akbari, Vahid Liaghat, Afshin Nikzad

Electron. J. Comb., 2011

2010

Optimal Iterative Pricing over Social Networks (Extended Abstract).

Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010