Conference item
Computing an approximately optimal agreeable set of items
- Abstract:
-
We study the problem of finding a small subset of items that is agreeable to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with a given number of agents and items, on the number of items that may need to be included in such a subset. Our goal in this paper is to efficiently compute an agreeable subset whose size approximates the size of the smallest agreeable subset for a given instance. W...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Publisher:
- International Joint Conferences on Artificial Intelligence Publisher's website
- Journal:
- 26th International Joint Conference on Artificial Intelligence (IJCAI 2017) Journal website
- Host title:
- IJCAI International Joint Conference on Artificial Intelligence
- Publication date:
- 2017-08-21
- Acceptance date:
- 2017-04-23
- DOI:
- ISSN:
-
1045-0823
- Source identifiers:
-
922617
- ISBN:
- 9780999241103
Item Description
- Pubs id:
-
pubs:922617
- UUID:
-
uuid:4e3c03a9-a937-46f8-8cdf-f7e6e08d3698
- Local pid:
- pubs:922617
- Deposit date:
- 2018-11-16
Terms of use
- Copyright holder:
- International Joint Conferences on Artificial Intelligence
- Copyright date:
- 2017
- Notes:
- © 2018 International Joint Conferences on Artificial Intelligence. All right reserved. This is the accepted manuscript version of the article. The final version is available online from International Joint Conferences on Artificial Intelligence at: https://doi.org/10.24963/ijcai.2017/48
If you are the owner of this record, you can report an update to it here: Report update to this record