IDEAS home Printed from https://ideas.repec.org/f/pni462.html
   My authors  Follow this author

Afshin Nikzad

Personal Details

First Name:Afshin
Middle Name:
Last Name:Nikzad
Suffix:
RePEc Short-ID:pni462
[This author has chosen not to make the email address public]
http://afshin-nikzad.com/

Affiliation

Department of Economics
University of Southern California

Los Angeles, California (United States)
https://dornsife.usc.edu/econ/
RePEc:edi:deuscus (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Itai Ashlagi & Afshin Nikzad & Philipp Strack, 2018. "Matching in Dynamic Imbalanced Markets," Papers 1809.06824, arXiv.org, revised Jun 2019.

Articles

  1. Mohammad Akbarpour & Afshin Nikzad, 2020. "Approximate Random Allocation Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 87(6), pages 2473-2510.
  2. Ashlagi, Itai & Nikzad, Afshin, 2020. "What matters in school choice tie-breaking? How competition guides design," Journal of Economic Theory, Elsevier, vol. 190(C).
  3. Ashlagi, Itai & Nikzad, Afshin & Romm, Assaf, 2019. "Assigning more students to their top choices: A comparison of tie-breaking rules," Games and Economic Behavior, Elsevier, vol. 115(C), pages 167-187.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Itai Ashlagi & Afshin Nikzad & Philipp Strack, 2018. "Matching in Dynamic Imbalanced Markets," Papers 1809.06824, arXiv.org, revised Jun 2019.

    Cited by:

    1. Mohammad Akbarpour & Julien Combe & Yinghua He & Victor Hiller & Robert Shimer & Olivier Tercieux, 2020. "Unpaired Kidney Exchange: Overcoming Double Coincidence of Wants without Money," PSE-Ecole d'économie de Paris (Postprint) halshs-02973042, HAL.
    2. Yu-Tse Lee & Jhan-Jia Lin & Jane Yung-Jen Hsu & Ja-Ling Wu, 2020. "A Time Bank System Design on the Basis of Hyperledger Fabric Blockchain," Future Internet, MDPI, vol. 12(5), pages 1-16, May.

Articles

  1. Mohammad Akbarpour & Afshin Nikzad, 2020. "Approximate Random Allocation Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 87(6), pages 2473-2510.

    Cited by:

    1. Freeman, Rupert & Pritchard, Geoffrey & Wilson, Mark, 2021. "Order Symmetry: A New Fairness Criterion for Assignment Mechanisms," SocArXiv xt37c, Center for Open Science.
    2. Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
    3. Ramezanian, Rasoul & Feizi, Mehdi, 2022. "Robust ex-post Pareto efficiency and fairness in random assignments: Two impossibility results," Games and Economic Behavior, Elsevier, vol. 135(C), pages 356-367.
    4. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    5. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
    6. Isa Hafalir & Fuhito Kojima & M. Bumin Yenmez, 2018. "Interdistrict School Choice: A Theory of Student Assignment," Boston College Working Papers in Economics 970, Boston College Department of Economics.
    7. Demeulemeester, Tom & Goossens, Dries & Hermans, Ben & Leus, Roel, 2023. "A pessimist’s approach to one-sided matching," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1087-1099.
    8. Itai Ashlagi & Amin Saberi & Ali Shameli, 2020. "Assignment Mechanisms Under Distributional Constraints," Operations Research, INFORMS, vol. 68(2), pages 467-479, March.
    9. Paul Gölz & Dominik Peters & Ariel Procaccia, 2022. "In This Apportionment Lottery, the House Always Wins," Post-Print hal-03834513, HAL.
    10. Mehdi Feizi, 2023. "The object allocation problem with favoring upper ranks," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(2), pages 370-383, June.
    11. Eric Budish & Judd B. Kessler, 2022. "Can Market Participants Report Their Preferences Accurately (Enough)?," Management Science, INFORMS, vol. 68(2), pages 1107-1130, February.
    12. Haydar Evren & Manshu Khanna, 2021. "Affirmative Action's Cumulative Fractional Assignments," Papers 2111.11963, arXiv.org, revised Feb 2024.
    13. Jalota, Devansh & Pavone, Marco & Qi, Qi & Ye, Yinyu, 2023. "Fisher markets with linear constraints: Equilibrium properties and efficient distributed algorithms," Games and Economic Behavior, Elsevier, vol. 141(C), pages 223-260.
    14. Thanh Nguyen & Ahmad Peivandi & Rakesh Vohra, 2014. "One-Sided Matching with Limited Complementarities," PIER Working Paper Archive 14-030, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    15. Haris Aziz & Xinhang Lu & Mashbat Suzuki & Jeremy Vollen & Toby Walsh, 2023. "Best-of-Both-Worlds Fairness in Committee Voting," Papers 2303.03642, arXiv.org, revised Dec 2023.
    16. Marta Boczoń & Alistair J. Wilson, 2023. "Goals, Constraints, and Transparently Fair Assignments: A Field Study of Randomization Design in the UEFA Champions League," Management Science, INFORMS, vol. 69(6), pages 3474-3491, June.
    17. Andrew McLennan & Shino Takayama & Yuki Tamura, 2024. "An Efficient, Computationally Tractable School Choice Mechanism," Discussion Papers Series 668, School of Economics, University of Queensland, Australia.

  2. Ashlagi, Itai & Nikzad, Afshin, 2020. "What matters in school choice tie-breaking? How competition guides design," Journal of Economic Theory, Elsevier, vol. 190(C).

    Cited by:

    1. Amel Awadelkarim & Arjun Seshadri & Itai Ashlagi & Irene Lo & Johan Ugander, 2023. "Rank-heterogeneous Preference Models for School Choice," Papers 2306.01801, arXiv.org.
    2. Felipe Arteaga & Adam J Kapor & Christopher A Neilson & Seth D Zimmerman, 2022. "Smart Matching Platforms and Heterogeneous Beliefs in Centralized School Choice," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 137(3), pages 1791-1848.
    3. Estelle Cantillon & Li Chen & Juan S. Pereyra, 2022. "Respecting priorities versus respecting preferences in school choice: When is there a trade-off?," Papers 2212.02881, arXiv.org, revised Jan 2024.
    4. Ethem Akyol, 2022. "Ex-Ante Welfare Superiority of the Boston Mechanism Over the Deferred Acceptance Mechanism," Dynamic Games and Applications, Springer, vol. 12(4), pages 1189-1220, December.
    5. Max Kapur, 2021. "Characterizing nonatomic admissions markets," Papers 2107.01340, arXiv.org.
    6. André Veski & Péter Biró & Kaire Põder & Triin Lauri, 2017. "Efficiency and fair access in Kindergarten allocation policy design," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 57-104, December.
    7. Estelle Cantillon & Li Chen & Juan Sebastian Pereyra Barreiro, 2022. "Respecting priorities versus respecting preferences in school choice: When is there a trade-off ?," Working Papers ECARES 2022-39, ULB -- Universite Libre de Bruxelles.
    8. Christopher Neilson & Felipe Arteaga & Adam Kapor & Seth Zimmerman, 2021. "Smart Matching Platforms and Heterogeneous Beliefs in Centralized School ChoiceSmart Matching Platforms and Heterogeneous Beliefs in Centralized School Choice," Working Papers 650, Princeton University, Department of Economics, Industrial Relations Section..
    9. Cho, Wonki Jo & Hafalir, Isa E. & Lim, Wooyoung, 2022. "Tie-breaking and efficiency in the laboratory school choice," Journal of Economic Theory, Elsevier, vol. 205(C).

  3. Ashlagi, Itai & Nikzad, Afshin & Romm, Assaf, 2019. "Assigning more students to their top choices: A comparison of tie-breaking rules," Games and Economic Behavior, Elsevier, vol. 115(C), pages 167-187.

    Cited by:

    1. Amel Awadelkarim & Arjun Seshadri & Itai Ashlagi & Irene Lo & Johan Ugander, 2023. "Rank-heterogeneous Preference Models for School Choice," Papers 2306.01801, arXiv.org.
    2. Aziz, Haris & Brandl, Florian, 2022. "The vigilant eating rule: A general approach for probabilistic economic design with constraints," Games and Economic Behavior, Elsevier, vol. 135(C), pages 168-187.
    3. Carmelo Rodríguez-Álvarez & Antonio Romero Medina, 2020. "School Choice with Transferable Students Characteristics," Documentos de Trabajo del ICAE 2020-04, Universidad Complutense de Madrid, Facultad de Ciencias Económicas y Empresariales, Instituto Complutense de Análisis Económico.
    4. Alex Rees-Jones & Ran Shorrer & Chloe J. Tergiman, 2020. "Correlation Neglect in Student-to-School Matching," NBER Working Papers 26734, National Bureau of Economic Research, Inc.
    5. Allman, Maxwell & Ashlagi, Itai & Nikzad, Afshin, 2023. "On rank dominance of tie-breaking rules," Theoretical Economics, Econometric Society, vol. 18(2), May.
    6. Haris Aziz & Florian Brandl, 2020. "The Vigilant Eating Rule: A General Approach for Probabilistic Economic Design with Constraints," Papers 2008.08991, arXiv.org, revised Jul 2021.
    7. Nick Arnosti, 2022. "A Continuum Model of Stable Matching With Finite Capacities," Papers 2205.12881, arXiv.org.
    8. Yeon-Koo Che & Olivier Tercieux, 2019. "Efficiency and Stability in Large Matching Markets," PSE-Ecole d'économie de Paris (Postprint) halshs-02087847, HAL.
    9. Nick Arnosti, 2023. "Lottery Design for School Choice," Management Science, INFORMS, vol. 69(1), pages 244-259, January.
    10. Ashlagi, Itai & Nikzad, Afshin, 2020. "What matters in school choice tie-breaking? How competition guides design," Journal of Economic Theory, Elsevier, vol. 190(C).
    11. Li, Mengling, 2020. "Ties matter: Improving efficiency in course allocation by allowing ties," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 354-384.
    12. Kenny Peng & Nikhil Garg, 2023. "Monoculture in Matching Markets," Papers 2312.09841, arXiv.org.
    13. Mustafa Oğuz Afacan & Umut Dur, 2023. "Strategy‐proof size improvement: is it possible?," Scandinavian Journal of Economics, Wiley Blackwell, vol. 125(2), pages 321-338, April.
    14. Carmelo Rodríguez-Álvarez & Antonio Romero-Medina, 2023. "The implicit (un)healthy life expectancy used for pricing long-term care insurance and life care annuities," Documentos de Trabajo del ICAE 2023-03, Universidad Complutense de Madrid, Facultad de Ciencias Económicas y Empresariales, Instituto Complutense de Análisis Económico.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 1 paper announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-DES: Economic Design (1) 2018-10-01. Author is listed
  2. NEP-GTH: Game Theory (1) 2018-10-01. Author is listed

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Afshin Nikzad should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.