A polynomial-time algorithm computes exact second-price pacing equilibria for constant numbers of goods by partitioning the multiplier space into geometric cells with fixed bid orderings and reducing each to a linear feasibility program.
Proceedings of the AAAI Conference on Artificial Intelligence , pages=
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
-
Pacing Equilibria in Second-Price Auctions with Few Goods
A polynomial-time algorithm computes exact second-price pacing equilibria for constant numbers of goods by partitioning the multiplier space into geometric cells with fixed bid orderings and reducing each to a linear feasibility program.