On multiple keyword sponsored search auctions with budgets
From MaRDI portal
Publication:3166992
DOI10.1007/978-3-642-31585-5_1zbMATH Open1312.91055OpenAlexW1539489113MaRDI QIDQ3166992FDOQ3166992
Martin Starnberger, Monika R. Henzinger, Stefano Leonardi, Riccardo Colini-Baldeschi
Publication date: 1 November 2012
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11573/1014176
Recommendations
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- Keyword auctions with budget-constrained bidders
- Optimal bidding in multi-item multislot sponsored search auctions
- Multi-unit Bayesian auction with demand or budget constraints
- Polyhedral clinching auctions and the adwords polytope
Cited In (12)
- Polyhedral clinching auctions and the AdWords polytope
- Clustering-Based Bidding Languages for Sponsored Search
- Bidding for an optimal portfolio of keywords in sponsored search advertising: from generic to branded keywords
- On the Hardness of Truthful Online Auctions with Multidimensional Constraints
- Polyhedral clinching auctions for indivisible goods
- On the stability of generalized second price auctions with budgets
- The impact of organic links in position auctions with popular versus niche keywords
- Keyword portfolio optimization in paid search advertising
- Revenue Maximizing Envy-Free Pricing in Matching Markets with Budgets
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- Polyhedral Clinching Auctions for Two-Sided Markets
- Clinching auctions with online supply
This page was built for publication: On multiple keyword sponsored search auctions with budgets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166992)
