AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Multiobjective Submodular Maximization with Concave Aggregation

Fabian Spaeh, Atsushi Miyauchi

NeurIPS 2026 · Learning theory and algorithms › Submodular and game algorithms · approach: Monotone submodular maximization

Read the paperCheck your idea against 137,217 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies multiobjective submodular maximization using a concave aggregation of submodular objectives instead of the conservative max-min formulation.

Problem

Multiobjective submodular maximization seeks one set performing well across several submodular objectives; the standard max-min formulation is overly conservative because it depends only on the worst objective.

Approach

Replaces max-min aggregation with a concave function applied to the multiple submodular objectives, so improvements in non-minimum objectives still count.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy