Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Erel Segal-Halevi"'
Autor:
Fedor Sandomirskiy, Erel Segal-Halevi
Publikováno v:
Operations Research. 70:1762-1782
A collection of objects, some of which are good and some are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects cannot be shared, so that each of them must be entirely allocated to a
Autor:
Erel Segal-Halevi
Publikováno v:
The American Mathematical Monthly. 129:403-414
Rental Harmony is the problem of assigning rooms in a rented house to tenants with different preferences, and simultaneously splitting the rent among them, such that no tenant envies the bundle (room+price) given to another tenant. Different papers h
Publikováno v:
Social Choice and Welfare. 59:467-493
Autor:
Erel Segal-Halevi, Elad Aigner-Horev
Publikováno v:
Information Sciences. 587:164-187
A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but envy-free matchings exist even when perfect matchings do not. We prove
Publikováno v:
IJCAI
This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements originating from the division of land estates: (1) each agent should
Autor:
Erel Segal-Halevi
Publikováno v:
Scopus-Elsevier
IJCAI
IJCAI
The paper considers fair allocation of resources that are already allocated in an unfair way. This setting requires a careful balance between the fairness considerations and the rights of the present owners. The paper presents re-division algorithms
Publikováno v:
SSRN Electronic Journal.
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
Publikováno v:
AAMAS
Fair division of land is an important practical problem that is commonly handled either by hiring assessors or by selling and dividing the proceeds. A third way to divide land fairly is via algorithms for fair cake-cutting. However, the current theor
Autor:
Erel Segal-Halevi, Shmuel Nitzan
Publikováno v:
Social Choice and Welfare. 53:709-740
We study the fair division of a continuous resource, such as a land-estate or a time-interval, among pre-specified groups of agents, such as families. Each family is given a piece of the resource and this piece is used simultaneously by all family me