Aziz, H., Moulin, H., & Sandomirskiy, F. (2020). A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Operations research letters, 48(5), 573-578. https://doi.org/10.1016/j.orl.2020.07.005
Chicago Style (17th ed.) CitationAziz, Haris, Hervé Moulin, and Fedor Sandomirskiy. "A Polynomial-time Algorithm for Computing a Pareto Optimal and Almost Proportional Allocation." Operations Research Letters 48, no. 5 (2020): 573-578. https://doi.org/10.1016/j.orl.2020.07.005.
MLA (9th ed.) CitationAziz, Haris, et al. "A Polynomial-time Algorithm for Computing a Pareto Optimal and Almost Proportional Allocation." Operations Research Letters, vol. 48, no. 5, 2020, pp. 573-578, https://doi.org/10.1016/j.orl.2020.07.005.
Warning: These citations may not always be 100% accurate.