{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:13:51Z","timestamp":1648512831838},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2005,12]]},"abstract":"<jats:p> We study the problem of fair resource allocation in a simple cooperative multi-agent setting where we have k agents and a set of n objects to be allocated to those agents. Each object is associated with a weight represented by a positive integer or real number. We would like to allocate all objects to the agents so that each object is allocated to only one agent and the weight is distributed fairly. We adopt the fairness index popularized by the networking community as our measure of fairness, and study centralized algorithms for fair resource allocation. Based on the relationship between our problem and number partitioning, we devise a greedy algorithm for fair resource allocation that runs in polynomial time but is not guaranteed to find the optimal solution, and a complete anytime algorithm that finds the optimal solution but runs in exponential time. Then we study the phase transition behavior of the complete algorithm. Finally, we demonstrate that the greedy algorithm actually performs very well and returns almost perfectly fair allocations. <\/jats:p>","DOI":"10.1142\/s0218213005002454","type":"journal-article","created":{"date-parts":[[2005,12,7]],"date-time":"2005-12-07T06:03:35Z","timestamp":1133935415000},"page":"887-899","source":"Crossref","is-referenced-by-count":2,"title":["FAIR RESOURCE ALLOCATION IN A SIMPLE MULTI-AGENT SETTING: SEARCH ALGORITHMS AND EXPERIMENTAL EVALUATION"],"prefix":"10.1142","volume":"14","author":[{"given":"PARASKEVI","family":"RAFTOPOULOU","sequence":"first","affiliation":[{"name":"Department of Electronic and  Computer Engineering, Technical University of Crete,  Kounoupidiana, Chania, 73100, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MANOLIS","family":"KOUBARAKIS","sequence":"additional","affiliation":[{"name":"Department of Electronic and  Computer Engineering, Technical University of Crete,  Kounoupidiana, Chania, 73100, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KOSTAS","family":"STERGIOU","sequence":"additional","affiliation":[{"name":"Department of Information and  Communication Systems Engineering, Aegean University,  Karlovasi, Samos, 83200, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PETER","family":"TRIANTAFILLOU","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering  and Informatics, University of Patras, Rio,  Patra, 26500, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.2307\/2223525"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2003.1249168"},{"key":"rf4","series-title":"Mathematical Sciences","volume-title":"Computers and Intractability: A guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1111\/0824-7935.00069"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1752"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00086-1"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.2307\/2276207"},{"key":"rf15","series-title":"Mathematics in Science and Engineering","volume-title":"Inequalities: theory of majorization and its applications","volume":"143","author":"Marshall A. W.","year":"1979"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213005002454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:31:30Z","timestamp":1565130690000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213005002454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":8,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1142\/S0218213005002454"],"URL":"https:\/\/doi.org\/10.1142\/s0218213005002454","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}