Joint Optimization of Bid and Budget Allocation in Paid Search
A technology of joint optimization and budget allocation, applied in the field of paid search, can solve problems such as budget allocation that has not yet been planned for activities
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0017] figure 1 A typical advertiser account structure 100 in data search (eg, paid search) is shown. Such as figure 1 As shown, an advertiser 110 may have one or more accounts 121 , 122 , 123 . Each account (eg, account 121) may have one or more groups (eg, campaign plans 131, 132, 133). In each campaign plan, the advertiser 110 sets a budget for the campaign plan, and simultaneously constructs several groups of advertisement copies, namely ad groups 141, 142, 143, and bids on certain keywords of each ad group, such as figure 1 The xbox 360 controller shown, buy xbox and so on.
[0018] Each keyword is an auction entry that is supposed to be triggered by some user query. Given a query, the search engine will first retrieve the most relevant advertisements as candidates according to the matching function between the bidding keywords and the query. These candidate ads will then enter an auction, and some ads (eg, the one with the greatest expected revenue) will win and be ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com