Interactive optimization of submodular functions under matroid constraints

DOI10.1007/978-3-030-87756-9_20OpenAlexW3208987086MaRDI QIDQ2695451

Cassandre Leroy, Nawal Benabbou, Patrice Perny, Thibaut Lust

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-87756-9_20

zbMATH Keywords

local searchsubmodular functionmatroidpreference elicitationgreedy search

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Related Items (1)

Using atomic bounds to get sub-modular approximations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Maximizing a class of submodular utility functions
• Computing approximate solutions of the maximum covering problem with GRASP
• FPT approximation schemes for maximizing submodular functions
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Constraint-based optimization and utility elicitation using the minimax decision criterion
• Combinatorial auctions with decreasing marginal utilities
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Some Abstract Pivot Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Matroids and the greedy algorithm

This page was built for publication: Interactive optimization of submodular functions under matroid constraints