Show simple item record

dc.contributor.authorArbib, C.en_US
dc.contributor.authorKaraşan, O. E.en_US
dc.contributor.authorPınar, M. Ç.en_US
dc.date.accessioned2019-02-21T16:01:29Z
dc.date.available2019-02-21T16:01:29Z
dc.date.issued2018en_US
dc.identifier.issn0166-218X
dc.identifier.urihttp://hdl.handle.net/11693/49857
dc.description.abstractConsider a situation in which individuals -the buyers -have different valuations for the products of a given set. An envy-free assignment of product items to buyers requires that the items obtained by every buyer be purchased at a price not larger than his/her valuation, and each buyer's welfare (difference between product value and price) be the largest possible. Under this condition, the problem of finding prices maximizing the seller's revenue is known to be APX-hard even for unit-demand bidders (with several other inapproximability results for different variants), that is, when each buyer wishes to buy at most one item. Here, we focus on ENVY-FREE COMPLETE ALLOCATION, the special case where a fixed number of copies of each product is available, each of the n buyers must get exactly one product item, and all the products must be sold. This case is known to be solvable in O(n4) time. We revisit a series of results on this problem and, answering a question found in Leonard (1983), show how to solve it in O(n3) time by connections to perfect matchings and shortest paths.
dc.language.isoEnglish
dc.source.titleDiscrete Applied Mathematicsen_US
dc.relation.isversionofhttps://doi.org/10.1016/j.dam.2018.03.034
dc.subjectAssignmenten_US
dc.subjectEnvy-free pricingen_US
dc.subjectPerfect matchingen_US
dc.subjectShortest path problemen_US
dc.subjectWalrasian equilibriumen_US
dc.titleOn envy-free perfect matchingen_US
dc.typeArticleen_US
dc.departmentDepartment of International Relations
dc.identifier.doi10.1016/j.dam.2018.03.034
dc.publisherElsevier B.V.
dc.embargo.release2020-04-05en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record