Computing an approximately optimal agreeable set of items

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...

Mô tả đầy đủ

Chi tiết về thư mục
Những tác giả chính: Manurangsi, P, Suksompong, W
Định dạng: Conference item
Được phát hành: International Joint Conferences on Artificial Intelligence 2017

Những quyển sách tương tự