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
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 196.2KB)
-
- Publisher copy:
- 10.24963/ijcai.2017/48
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
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