Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
From MaRDI portal
Publication:903629
DOI10.1016/j.ins.2013.08.033zbMath1329.91057OpenAlexW1977484781MaRDI QIDQ903629
Mohammadreza Razzazi, Ali Esmaeeli
Publication date: 14 January 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.08.033
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- The decomposition principle and algorithms for linear programming
- Polyhedral Clinching Auctions and the AdWords Polytope
- On Multiple Keyword Sponsored Search Auctions with Budgets
- Decomposition Principle for Linear Programs
- AdWords and generalized online matching
- A Level Algorithm for Preemptive Scheduling
- Preemptive Scheduling of Uniform Processor Systems
- A Truthful Mechanism for Offline Ad Slot Scheduling
This page was built for publication: Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions