Introduces the multiagent matroid upgrading problem and claims the greedy algorithm is fair and efficient for minimizing a convex function over agents' basis costs.
Title resolution pending
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multiagent Matroid Upgrading: Greedy is Fair and Efficient
Introduces the multiagent matroid upgrading problem and claims the greedy algorithm is fair and efficient for minimizing a convex function over agents' basis costs.