Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Andrew Searns"'
In fair division of indivisible goods, $\ell$-out-of-$d$ maximin share (MMS) is the value that an agent can guarantee by partitioning the goods into $d$ bundles and choosing the $\ell$ least preferred bundles. Most existing works aim to guarantee to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c820aaf8747f4ad5bf92a3703b91ffd
http://arxiv.org/abs/2109.01925
http://arxiv.org/abs/2109.01925
Autor:
Andrew Searns, Hadi Hosseini
Publikováno v:
IJCAI
The maximin share (MMS) guarantee is a desirable fairness notion for allocating indivisible goods. While MMS allocations do not always exist, several approximation techniques have been developed to ensure that all agents receive a fraction of their m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70b3ea33492852f59812159fc5f7685b
Publikováno v:
IJCAI
We initiate the study of multi-layered cake cutting with the goal of fairly allocating multiple divisible resources (layers of a cake) among a set of agents. The key requirement is that each agent can only utilize a single resource at each time inter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aee5d9271eefed66538aae8566dc5074
Autor:
Andrew Searns, Hadi Hosseini
Publikováno v:
AAAI
Fair division is a subfield of multiagent systems that is concerned with object distribution. When objects are indivisible, the Maximin Share Guarantee (MMS) is a desirable fairness notion; however, it is not guaranteed to exist. While MMS allocation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc10ec2498c14e82e6d7a1e1144e2885
https://doi.org/10.1609/aaai.v34i10.7228
https://doi.org/10.1609/aaai.v34i10.7228
