APA (7th ed.) Citation

Aziz, H., Li, B., & Wu, X. (2024). Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Mathematical Programming, 203(1/2), 319. https://doi.org/10.1007/s10107-022-01855-y

Chicago Style (17th ed.) Citation

Aziz, Haris, Bo Li, and Xiaowei Wu. "Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences." Mathematical Programming 203, no. 1/2 (2024): 319. https://doi.org/10.1007/s10107-022-01855-y.

MLA (9th ed.) Citation

Aziz, Haris, et al. "Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences." Mathematical Programming, vol. 203, no. 1/2, 2024, p. 319, https://doi.org/10.1007/s10107-022-01855-y.