Set systems related to a house allocation problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | D´aniel Gerbner | - |
dc.contributor.author | Bal´azs Keszegh | - |
dc.contributor.author | Abhishek Methuku | - |
dc.contributor.author | D´aniel T. Nagy | - |
dc.contributor.author | Bal´azs Patk´os | - |
dc.contributor.author | Casey Tompkins | - |
dc.contributor.author | Chuanqi Xiao. | - |
dc.date.accessioned | 2020-12-22T02:58:55Z | - |
dc.date.accessioned | 2020-12-22T02:58:56Z | - |
dc.date.available | 2020-12-22T02:58:55Z | - |
dc.date.available | 2020-12-22T02:58:56Z | - |
dc.date.created | 2020-04-20 | - |
dc.date.issued | 2020-07 | - |
dc.identifier.issn | 0012-365X | - |
dc.identifier.uri | https://pr.ibs.re.kr/handle/8788114/7793 | - |
dc.description.abstract | © 2020 Elsevier B.V. We are given a set A of buyers, a set B of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping τ from A to B, and τ is strictly better than another house allocation τ′≠τ if for every buyer i, τ′(i) does not come before τ(i) in the preference list of i. A house allocation is Pareto optimal if there is no strictly better house allocation. Let s(τ) be the image of τ i.e., the set of houses sold in the house allocation τ. We are interested in the largest possible cardinality f(m) of the family of sets s(τ) for Pareto optimal mappings τ taken over all sets of preference lists of m buyers and all sets of houses. This maximum exists since in a Pareto optimal mapping with m buyers, each buyer will always be assigned one of their top m choices. We improve the earlier upper bound on f(m) given by Asinowski et al. (2016), by making a connection between this problem and some problems in extremal set theory | - |
dc.language | 영어 | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Set systems related to a house allocation problem | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.wosid | 000532825100024 | - |
dc.identifier.scopusid | 2-s2.0-85081545923 | - |
dc.identifier.rimsid | 71715 | - |
dc.contributor.affiliatedAuthor | Abhishek Methuku | - |
dc.contributor.affiliatedAuthor | Casey Tompkins | - |
dc.identifier.doi | 10.1016/j.disc.2020.111886 | - |
dc.identifier.bibliographicCitation | DISCRETE MATHEMATICS, v.343, no.7 | - |
dc.relation.isPartOf | DISCRETE MATHEMATICS | - |
dc.citation.title | DISCRETE MATHEMATICS | - |
dc.citation.volume | 343 | - |
dc.citation.number | 7 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Disjointly representable | - |
dc.subject.keywordAuthor | Pareto optimal matching | - |
dc.subject.keywordAuthor | Set pairs | - |
dc.subject.keywordAuthor | Set system | - |