Logarithmic algorithms for fair division problems
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 logarithm...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Grebennikov, Alexandr Isaeva, Xenia Malyutin, Andrei V Mikhailov, Mikhail Musin, Oleg R |
| description | 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. |
| doi_str_mv | 10.48550/arxiv.2112.13622 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2112_13622</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2112_13622</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-eab2bdf335bc241a5ef7e5ff4e2e41d3bf324dc5e8b7fbaba909895f8bcb7d513</originalsourceid><addsrcrecordid>eNotzrFuwjAUhWEvDIj2AZjwCyTE1zZJxgoBRYrEwh7dG_uCpQQjB6H27RFpp_NPR58QS1XkprK2WGP6Cc8clIJc6Q3AXKgmXjCFx3UIncT-EqceJcckGUOSLjzDGOJN3lOk3g_jh5gx9qP__N-FOO935-131pwOx-1Xk-GmhMwjATnW2lIHRqH1XHrLbDx4o5wm1mBcZ31FJRMS1kVd1ZYr6qh0VumFWP3dTub2nsKA6bd929vJrl9AmEBP</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Logarithmic algorithms for fair division problems</title><source>arXiv.org</source><creator>Grebennikov, Alexandr ; Isaeva, Xenia ; Malyutin, Andrei V ; Mikhailov, Mikhail ; Musin, Oleg R</creator><creatorcontrib>Grebennikov, Alexandr ; Isaeva, Xenia ; Malyutin, Andrei V ; Mikhailov, Mikhail ; Musin, Oleg R</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2112.13622</identifier><language>eng</language><subject>Mathematics - Combinatorics ; Mathematics - Metric Geometry</subject><creationdate>2021-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2112.13622$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2112.13622$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Grebennikov, Alexandr</creatorcontrib><creatorcontrib>Isaeva, Xenia</creatorcontrib><creatorcontrib>Malyutin, Andrei V</creatorcontrib><creatorcontrib>Mikhailov, Mikhail</creatorcontrib><creatorcontrib>Musin, Oleg R</creatorcontrib><title>Logarithmic algorithms for fair division problems</title><description>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.</description><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Metric Geometry</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrFuwjAUhWEvDIj2AZjwCyTE1zZJxgoBRYrEwh7dG_uCpQQjB6H27RFpp_NPR58QS1XkprK2WGP6Cc8clIJc6Q3AXKgmXjCFx3UIncT-EqceJcckGUOSLjzDGOJN3lOk3g_jh5gx9qP__N-FOO935-131pwOx-1Xk-GmhMwjATnW2lIHRqH1XHrLbDx4o5wm1mBcZ31FJRMS1kVd1ZYr6qh0VumFWP3dTub2nsKA6bd929vJrl9AmEBP</recordid><startdate>20211227</startdate><enddate>20211227</enddate><creator>Grebennikov, Alexandr</creator><creator>Isaeva, Xenia</creator><creator>Malyutin, Andrei V</creator><creator>Mikhailov, Mikhail</creator><creator>Musin, Oleg R</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20211227</creationdate><title>Logarithmic algorithms for fair division problems</title><author>Grebennikov, Alexandr ; Isaeva, Xenia ; Malyutin, Andrei V ; Mikhailov, Mikhail ; Musin, Oleg R</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-eab2bdf335bc241a5ef7e5ff4e2e41d3bf324dc5e8b7fbaba909895f8bcb7d513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Metric Geometry</topic><toplevel>online_resources</toplevel><creatorcontrib>Grebennikov, Alexandr</creatorcontrib><creatorcontrib>Isaeva, Xenia</creatorcontrib><creatorcontrib>Malyutin, Andrei V</creatorcontrib><creatorcontrib>Mikhailov, Mikhail</creatorcontrib><creatorcontrib>Musin, Oleg R</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Grebennikov, Alexandr</au><au>Isaeva, Xenia</au><au>Malyutin, Andrei V</au><au>Mikhailov, Mikhail</au><au>Musin, Oleg R</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Logarithmic algorithms for fair division problems</atitle><date>2021-12-27</date><risdate>2021</risdate><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.</abstract><doi>10.48550/arxiv.2112.13622</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2112.13622 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2112_13622 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics Mathematics - Metric Geometry |
| title | Logarithmic algorithms for fair division problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T07%3A43%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Logarithmic%20algorithms%20for%20fair%20division%20problems&rft.au=Grebennikov,%20Alexandr&rft.date=2021-12-27&rft_id=info:doi/10.48550/arxiv.2112.13622&rft_dat=%3Carxiv_GOX%3E2112_13622%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |