A Truthful Mechanism for Offline Ad Slot Scheduling
From MaRDI portal
(Redirected from Publication:5459983)
Recommendations
Cites work
- A Level Algorithm for Preemptive Scheduling
- A Truthful Mechanism for Offline Ad Slot Scheduling
- AdWords and generalized online matching
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Efficiency Loss in a Network Resource Allocation Game
- Existence of an Equilibrium for a Competitive Economy
- Market equilibrium via a primal-dual algorithm for a convex program
- On the complexity of equilibria
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Scheduling of Uniform Processor Systems
- Sponsored search auctions
Cited in
(13)- Truthfulness in advertising? Approximation mechanisms for knapsack bidders
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- Truthfulness and approximation with value-maximizing bidders
- On the Hardness of Truthful Online Auctions with Multidimensional Constraints
- Truthful auction for CPU time slots
- scientific article; zbMATH DE number 7051298 (Why is no real title available?)
- Improved revenue bounds for posted-price and second-price mechanisms
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Advertisement allocation for generalized second-pricing schemes
- Threshold mechanisms for dynamic procurement with abandonment
- The power of proportional fairness for nonclairvoyant polytope scheduling
- A near Pareto optimal auction with budget constraints
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
This page was built for publication: A Truthful Mechanism for Offline Ad Slot Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459983)