Agreeable sets with matroidal constraints

Laurent Gourvès ()
Additional contact information
Laurent Gourvès: Université Paris-Dauphine

Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 5, 866-888

Abstract: Abstract This article deals with the challenge of reaching an agreement for a group of agents who have heterogeneous preferences over a set of goods. In a recent work, Suksompong (in: Subbarao (ed) Proceedings of the twenty-fifth international joint conference on artificial intelligence, IJCAI 2016, New York, pp 489–495, 2016) models a problem of this kind as the search of an agreeable subset of a given ground set of goods. A subset is agreeable if it is weakly preferred to its complement by every agent of the group. Under natural assumptions on the agents’ preferences such as monotonicity or responsiveness, an agreeable set of small cardinality is guaranteed to exist, and it can be efficiently computed. This article deals with an extension to subsets which must satisfy extra matroidal constraints. Worst case upper bounds on the size of an agreeable set are shown, and algorithms for computing them are given. For the case of two agents having additive preferences, we show that an agreeable solution can also be approximately optimal (up to a multiplicative constant factor) for both agents.

Keywords: Allocation of indivisible goods; Matroids; Approximation (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0327-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0327-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0327-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().