Logarithmic algorithms for fair division problems

Alexandr Grebennikov; Andrei V. Malyutin; Mikhail Mikhailov; Oleg R. Musin; Xenia Isaeva

REVIEW

Logarithmic algorithms for fair division problems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.13622 v4 pith:P2JBTPYG submitted 2021-12-27 math.CO math.MG

Alexandr Grebennikov , Xenia Isaeva , Andrei V. Malyutin , Mikhail Mikhailov , Oleg R. Musin This is my paper · ORCID

classification math.COmath.MG

keywords divisionfairproblemsaccuracylogarithmicnumberqueriesalgorithmic

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools