Computationally Manageable Combinational Auctions
Management Science
On the computational power of iterative auctions
Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions
Multi-unit Auctions with Budget Limits
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Envy-free pricing in multi-item markets
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Single-parameter combinatorial auctions with partially public valuations
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Single valued combinatorial auctions with budgets
Proceedings of the 12th ACM conference on Electronic commerce
Bayesian mechanism design for budget-constrained agents
Proceedings of the 12th ACM conference on Electronic commerce
Repeated budgeted second price ad auction
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
Journal of the ACM (JACM)
Revenue maximizing envy-free multi-unit auctions with budgets
Proceedings of the 13th ACM Conference on Electronic Commerce
On multiple keyword sponsored search auctions with budgets
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Matching with sizes (or scheduling with processing set restrictions)
Discrete Applied Mathematics
| Hi-index | 0.00 |
This document describes the auction system used by Google for allocation and pricing of TV ads. It is based on a simultaneous ascending auction, and has been in use since September 2008.