American Psychological Association 6th edition

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

ISO-690 (author-date, English)

AZIZ, Haris, LI, Bo und WU, Xiaowei, 2024. Approximate and strategyproof maximin share allocation of chores with ordinal preferences. Mathematical Programming: A Publication of the Mathematical Optimization Society. 1 Januar 2024. Vol. 203, no. 1-2, p. 319-345. DOI 10.1007/s10107-022-01855-y.

Modern Language Association 9th edition

Aziz, H., B. Li, und X. Wu. „Approximate and Strategyproof Maximin Share Allocation of Chores With Ordinal Preferences“. Mathematical Programming: A Publication of the Mathematical Optimization Society, Bd. 203, Nr. 1-2, Januar 2024, S. 319-45, https://doi.org/10.1007/s10107-022-01855-y.

Mohr Siebeck - Recht (Deutsch - Österreich)

Aziz, Haris/Li, Bo/Wu, Xiaowei: Approximate and strategyproof maximin share allocation of chores with ordinal preferences, Mathematical Programming: A Publication of the Mathematical Optimization Society 2024, 319-345.

Emerald - Harvard

Aziz, H., Li, B. und Wu, X. (2024), „Approximate and strategyproof maximin share allocation of chores with ordinal preferences“, Mathematical Programming: A Publication of the Mathematical Optimization Society, Vol. 203 No. 1-2, S. 319-345.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.