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.

Comments

Original published version available at https://doi.org/10.1137/22M1511564

Publication Title

SIAM Journal on Discrete Mathematics

DOI

10.1137/22M1511564

Download

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.