On multiple keyword sponsored search auctions with budgets

DOI10.1007/978-3-642-31585-5_1MaRDI QIDQ3166992zbMATH OpenOpenAlexFDO

Authors Riccardo Colini-Baldeschi, Martin Starnberger, Monika R. Henzinger, Stefano Leonardi

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

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

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

Cited in

(12)

• Clustering-Based Bidding Languages for Sponsored Search
• Polyhedral clinching auctions for two-sided markets
• Bidding for an optimal portfolio of keywords in sponsored search advertising: from generic to branded keywords
• Revenue maximizing envy-free pricing in matching markets with budgets
• On the Hardness of Truthful Online Auctions with Multidimensional Constraints
• Polyhedral clinching auctions for indivisible goods
• The impact of organic links in position auctions with popular versus niche keywords
• Keyword portfolio optimization in paid search advertising
• Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
• Keyword auctions with budget-constrained bidders
• Sponsored search, market equilibria, and the Hungarian method
• 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)