A constant-factor approximation algorithm and universally truthful randomized mechanism for position auctions with heterogeneous ad sizes and capacity constraints.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
cs.GT 3years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
Presents the PO-ASL mechanism that synthesizes profit-optimal social laws for strategic agents by compactly representing ATL valuations, reducing payments to allocation, and solving the resulting FP^NP-complete problem with integer linear programming.
A proportional weight-update rule creates implicit binary evaluation signals that propagate losslessly through hierarchical selectors while preserving algebraic market integrity and admitting unique interior equilibria.
citing papers explorer
-
Position Auctions with a Capacity Constraint
A constant-factor approximation algorithm and universally truthful randomized mechanism for position auctions with heterogeneous ad sizes and capacity constraints.
-
A Truthful Multiunit Profit-Optimal Mechanism for Synthesizing Social Laws
Presents the PO-ASL mechanism that synthesizes profit-optimal social laws for strategic agents by compactly representing ATL valuations, reducing payments to allocation, and solving the resulting FP^NP-complete problem with integer linear programming.
-
Implicit Evaluation Under Minimal Information: Price Formation in Hierarchical Component Selection
A proportional weight-update rule creates implicit binary evaluation signals that propagate losslessly through hierarchical selectors while preserving algebraic market integrity and admitting unique interior equilibria.