The paper provides a unified ascending auction framework via discrete convex analysis to compute buyer-optimal Walrasian equilibria in combinatorial markets with strong substitutes valuations and piecewise-linear payment frictions.
The optimal value of problems (P 2) and (D2) is 2 +γlog 0.5
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
-
Ascending Auctions for Combinatorial Markets with Frictions: A Unified Framework via Discrete Convex Analysis
The paper provides a unified ascending auction framework via discrete convex analysis to compute buyer-optimal Walrasian equilibria in combinatorial markets with strong substitutes valuations and piecewise-linear payment frictions.