Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/105477
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Wu, X | en_US |
| dc.creator | Li, B | en_US |
| dc.creator | Gan, J | en_US |
| dc.date.accessioned | 2024-04-15T07:34:36Z | - |
| dc.date.available | 2024-04-15T07:34:36Z | - |
| dc.identifier.isbn | 978-0-9992411-9-6 (Online) | en_US |
| dc.identifier.uri | http://hdl.handle.net/10397/105477 | - |
| dc.language.iso | en | en_US |
| dc.publisher | International Joint Conferences on Artificial Intelligence | en_US |
| dc.rights | Copyright © 2021 International Joint Conferences on Artificial Intelligence | en_US |
| dc.rights | All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. | en_US |
| dc.rights | Posted with permission of the IJCAI Organization (https://www.ijcai.org/). | en_US |
| dc.rights | The following publication Wu, X., Li, B., & Gan, J.(2021). Budget-feasible maximum nash social welfare is almost envy-free. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, Montreal-themed Virtual Reality, 19th-26th August, 2021, p. 465-471. IJCAL, 2021 is available at https://doi.org/10.24963/ijcai.2021/65. | en_US |
| dc.title | Budget-feasible maximum Nash social welfare is almost envy-free | en_US |
| dc.type | Conference Paper | en_US |
| dc.identifier.spage | 465 | en_US |
| dc.identifier.epage | 471 | en_US |
| dc.identifier.doi | 10.24963/ijcai.2021/65 | en_US |
| dcterms.abstract | The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016 and TEAC 2019) that an allocation maximizing the NSW is envy-free up to one good (EF1). In this paper, we are interested in the fairness of the NSW in a budget-feasible allocation problem, in which each item has a cost that will be incurred to the agent it is allocated to, and each agent has a budget constraint on the total cost of items she receives. We show that a budget-feasible allocation that maximizes the NSW achieves a 1/4-approximation of EF1 and the approximation ratio is tight. The approximation ratio improves gracefully when the items have small costs compared with the agents' budgets; it converges to 1/2 when the budget-cost ratio approaches infinity. | en_US |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, Montreal-themed Virtual Reality, 19th-26th August, 2021, p. 465-471 | en_US |
| dcterms.issued | 2021 | - |
| dc.relation.conference | International Joint Conference on Artificial Intelligence [IJCAI] | en_US |
| dc.description.validate | 202402 bcch | en_US |
| dc.description.oa | Version of Record | en_US |
| dc.identifier.FolderNumber | COMP-0121 | - |
| dc.description.fundingSource | Others | en_US |
| dc.description.fundingText | Hong Kong Polytechnic University | en_US |
| dc.description.pubStatus | Published | en_US |
| dc.identifier.OPUS | 50798460 | - |
| dc.description.oaCategory | Publisher permission | en_US |
| Appears in Collections: | Conference Paper | |
Page views
104
Last Week
4
4
Last month
Citations as of Nov 9, 2025
Downloads
19
Citations as of Nov 9, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.



