The ASC class of reward functions admits O(n²) critical values, yielding polynomial-time optimal combinatorial contracts and generalizing gross substitutes, supermodular, and ultra classes.
This is in contrast to Baldwin and Klemperer [2019], where the demand type is always non-empty
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorial Contracts Through Demand Types
The ASC class of reward functions admits O(n²) critical values, yielding polynomial-time optimal combinatorial contracts and generalizing gross substitutes, supermodular, and ultra classes.