
School of Mathematical and Statistical Sciences Faculty Publications and Presentations
Document Type
Article
Publication Date
2024
Abstract
We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under certain natural conditions on sets of preferences, a logarithmic number of queries with respect to accuracy is sufficient.
Recommended Citation
Grebennikov, Alexandr, Xenia Isaeva, Andrei Malyutin, Mikhail Mikhailov, and Oleg Musin. "Logarithmic algorithms for fair division problems." SIAM Journal on Discrete Mathematics 38, no. 4 (2024): 2926-2939. https://doi.org/10.1137/22M1511564
Publication Title
SIAM Journal on Discrete Mathematics
DOI
10.1137/22M1511564
Comments
Original published version available at https://doi.org/10.1137/22M1511564