default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAfshin Nikzad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Afshin Nikzad
, Philipp Strack:
Equity and Efficiency in Dynamic Matching: Extreme Waitlist Policies. Manag. Sci. 70(8): 5187-5207 (2024)- 2023
- [c13]Samantha Robertson, Tonya Nguyen, Cathy Hu, Catherine Albiston, Afshin Nikzad, Niloufar Salehi:
Expressiveness, Cost, and Collectivism: How the Design of Preference Languages Shapes Participation in Algorithmic Decision-Making. CHI 2023: 600:1-600:16 - 2022
- [c12]Afshin Nikzad:
Constrained Majorization: Applications in Mechanism Design. EC 2022: 330-331 - 2021
- [j7]Afshin Nikzad:
Persuading a pessimist: Simplicity and robustness. Games Econ. Behav. 129: 144-157 (2021) - [c11]Itai Ashlagi, Faidra Georgia Monachou, Afshin Nikzad:
Optimal Dynamic Allocation: Simplicity through Information Design. EC 2021: 101-102 - 2020
- [j6]Itai Ashlagi, Afshin Nikzad:
What matters in school choice tie-breaking? How competition guides design. J. Econ. Theory 190: 105120 (2020)
2010 – 2019
- 2019
- [j5]Itai Ashlagi, Afshin Nikzad, Assaf Romm:
Assigning more students to their top choices: A comparison of tie-breaking rules. Games Econ. Behav. 115: 167-187 (2019) - 2018
- [j4]Nima Anari, Gagan Goel, Afshin Nikzad:
Budget Feasible Procurement Auctions. Oper. Res. 66(3): 637-652 (2018) - 2017
- [j3]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ACM Trans. Algorithms 13(4): 52:1-52:28 (2017) - 2016
- [c10]Gagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme:
Reservation Exchange Markets for Internet Advertising. ICALP 2016: 142:1-142:13 - [c9]Itai Ashlagi, Afshin Nikzad:
What Matters in School Choice Tie-breakings?: How Competition Guides Design. EC 2016: 767-768 - 2015
- [c8]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. ICALP (1) 2015: 39-51 - [c7]Itai Ashlagi, Afshin Nikzad, Assaf Romm:
Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison. EC 2015: 755-756 - [i2]Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. CoRR abs/1503.00941 (2015) - 2014
- [c6]Takuro Fukunaga, Afshin Nikzad, R. Ravi:
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. APPROX-RANDOM 2014: 209-225 - [c5]Nima Anari, Gagan Goel, Afshin Nikzad:
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets. FOCS 2014: 266-275 - [c4]Gagan Goel, Afshin Nikzad, Adish Singla:
Mechanism Design for Crowdsourcing Markets with Heterogeneous Tasks. HCOMP 2014: 77-86 - [c3]Afshin Nikzad, R. Ravi:
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems. ICALP (2) 2014: 568-607 - [c2]Gagan Goel, Afshin Nikzad, Adish Singla:
Allocating tasks to workers with matching constraints: truthful mechanisms for crowdsourcing markets. WWW (Companion Volume) 2014: 279-280 - [i1]Nima Anari, Gagan Goel, Afshin Nikzad:
Mechanisms Design for Crowdsourcing: An Optimal 1-1/e Approximate Budget-Feasible Mechanism for Large Markets. CoRR abs/1405.2452 (2014) - 2012
- [j2]Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad:
Optimal online pricing with network externalities. Inf. Process. Lett. 112(4): 118-123 (2012) - 2011
- [j1]Saieed Akbari, Vahid Liaghat, Afshin Nikzad:
Colorful Paths in Vertex Coloring of Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [c1]Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad:
Optimal Iterative Pricing over Social Networks (Extended Abstract). WINE 2010: 415-423
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
