Paid search engine bid management
Paid Search Engine Tools, LLCPatent 7,043,450 (the '450 patent) has been asserted by Paid Search Engine Tools, LLC against Microsoft Corp. and Google, Inc. in federal district court alleging patent infringement. The '450 patent pertains to a system for monitoring keyword bids across one or more search engines so that that marketers can make adjustments to their pay-per-click bids. This patent may impact any party that is in the business of selling keywords for advertising and marketing. The challenge is to determine whether the patent is valid.
Last updated: about 1 year ago
Summary / Description
| Summary / Description | (1) Abstract - A method and system for automatically managing an auction for determining relative priority for a service in a system wherein priority is based on the relative value of related bids is disclosed. The method comprises checking for whether a first bid exceeds a second bid in an auction for determining continuing priority for providing an ongoing service for at least a first and second bidder, wherein the relative priority for providing the service for the first bidder is dependent on whether the value of the first bid exceeds the value of the second bid, and wherein the relative priority for providing the service for the second bidder is dependent on whether the value of the second bid exceeds the value of the first bid. The method further comprises incrementing the first bid to a value exceeding the second bid if the first bid does not exceed the second bid, thereby causing the relative priority for providing service for the first bidder to exceed the priority for providing service for the second bidder. The steps of checking and incrementing may be executed a plurality of times. The system may pause for a fixed period of time between each series of steps of checking and incrementing. |
Basic Information
| Type of Prior Art | Issued Patents - US |
| Country | United States of America |
| Patent/Application # | 7,225,151 |
| Kind Code | United States (US) - United STATES Patent - A |
| Patentee Name | Assignee - Bid For Position, LLC |
| Relevant Pages, Columns, or Lines | (1) Abstract; (2) col. 1, ln 1 |
| URL | http://patft.uspto.gov/netacgi/... |
| Publication Date | January 27, 2000 |
| Additional Information | Date listed is filing date |
Notes / To Do
| Notes | |
Excerpt
(2) col. 1, ln 10-22 - Continuous auctions include those for bidding for Internet search engine key-phrases in order to achieve the highest possible rankings on a search engine. The search engine found at GOTO.COM by Goto.com, Inc. of Pasadena, Calif. is an exemplary continuous auction. In this type of auction, the search engine lists web-page search results for a key-phrase search in the order of bid prices from advertisers. The advertiser with the highest bid for a given key-phrase appears first in the list, the next highest bidder appears second, etc. Since key-phrases are intangible, the same key-phrase can be sold to an unlimited number of users and the auction runs continuously with the rankings changing according to the current bids from advertisers.
(3) col. 1, ln 55 - col. 2, ln 31 - The service provided to the bidders may comprise providing ranking of hypertext links to web pages in search results in an on-line web page search engine, wherein ranking of a first hypertext link to a first web page for the first bidder is higher than the ranking of a second hypertext link to a second web page for the second bidder if the first bid is higher than the second bid.
The method may comprise placing bids on a plurality of search terms which may be typed into the search engine by search engine users wherein different ranking is determined for each search term, wherein the ranking of the first hypertext link is higher than the second hypertext link if the first bid is higher than the second bid for each of the plurality of search terms. The steps of checking and incrementing are executed for a plurality of search engines for the plurality of search terms.
A system for automatically managing the auction for determining relative priority for the service in a system wherein priority is based on the relative value of related bids is further disclosed. The system may comprise a processor electrically connected to a network, which is electrically connected to the plurality of search engines. A database is electrically connected to the system for storing and managing the bids. . .
(4) col. 3, ln 33 - col. 4, ln 2 - The server 100 may further comprise a database 104 comprising a relational database management system (RDBMS) 104 for storing bids and data relating to the service provided to the bidders. Bidders may further enter maximum and/or minimum bids into the bidder terminals 175. The online bid management system 102 keeps track of the maximum and minimum bids for each user who enters bids into the bidder terminals 175 into RDBMS 104. The online bid management system 102 will increment the lower bids until they reach desired bidding positions entered by the bidders as long as the bids do not exceed maximum values entered by the respective bidders. Thus, the online bid management system 102 causes the relative priority for providing service to each bidder to exceed the priority for providing service with respect to other bidders as long as the maximum bid is not exceeded, or until a desired position is reached. The online bid management system 102 is further programmed to check and increment the bids a plurality of times, pausing for a fixed period of time between each checking and incrementing. . .
Relevance
Claims
Managing an offeror's offer for a keyword
A method of managing an offeror's offer for a keyword made to a search engine, said offer identifying an amount said offeror will pay upon a searcher's use of an offeror-supplied reference located upon the keyword within said search engine, comprising receiving an authorization from said offeror, after receipt of said authorization, monitoring keyword offers at one or more Internet search engines to identify a change in said offeror's offer of interest to said offeror, and implementing said change in said offeror's offer on behalf of said offeror based upon the previously received authorization without further intervention of said offeror.
Relevance
References 1-4 above
References 1-4 above
Claim Chart
All
Second method for managing offers for keywords
A method of managing offers for a keyword made to a search engine, said offers identifying an amount an offeror will pay upon a searcher's use of an offeror-supplied reference located using the keyword within said search engine, comprising presenting adjacently-ranked authorized payment amounts for a plurality of target keywords at one or more Internet search engines on a single display screen, each keyword comprising one or more words, in a manner that distinctively identifies one or more selected authorized payments of interest.
Relevance
References 1-4 above
References 1-4 above
Claim Chart
All
Managing offers for a keyword
A method of managing offers for a keyword made to a search engine, said offers identifying an amount an offeror will pay upon a searcher's use of an offeror-supplied reference located using the keyword within said search engine, comprising accumulating adjacently-ranked authorized payment amounts for a plurality of target keywords, each target keyword comprising one or more words, each authorized payment amount representing an offeror's authorized payment for one of said keywords at one or more Internet search engines, and presenting the adjacently-ranked authorized payment amounts for a plurality of target keywords on a single display screen to a user.
Relevance
References 1-4 above
References 1-4 above
Claim Chart
All


