Bid for Position, LLC v. AOL, LLC

601 F.3d 1311, 94 U.S.P.Q. 2d (BNA) 1368, 2010 U.S. App. LEXIS 7163, 2010 WL 1337733
CourtCourt of Appeals for the Federal Circuit
DecidedApril 7, 2010
Docket2009-1068
StatusPublished
Cited by9 cases

This text of 601 F.3d 1311 (Bid for Position, LLC v. AOL, LLC) is published on Counsel Stack Legal Research, covering Court of Appeals for the Federal Circuit primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
Bid for Position, LLC v. AOL, LLC, 601 F.3d 1311, 94 U.S.P.Q. 2d (BNA) 1368, 2010 U.S. App. LEXIS 7163, 2010 WL 1337733 (Fed. Cir. 2010).

Opinion

BRYSON, Circuit Judge.

Plaintiff Bid for Position, LLC, appeals from a final judgment of noninfringement entered in its patent infringement suit against defendants Google, Inc., and AOL, LLC. The patent-in-suit, U.S. Patent No. 7,225,151 Bl, describes a method for conducting a continuous auction, such as a consumers’ auction on the internet for goods or services, or a vendors’ auction for positions in an internet advertising display. The claimed method allows a bidder to select a position of priority in the auction and automatically adjusts the bidder’s bid so as to maintain that chosen priority status. The accused system is Google’s internet advertising system, AdWords, which runs continuous auctions to determine the placement of advertisements on Google’s search results pages. 1

I

A

In the accused AdWords system, advertisers choose keywords to trigger the display of their advertisements. When a keyword is used in a search performed on Google.com, AdWords runs an auction to determine the order in which the advertisements will be placed next to the search results. Each advertiser submits a bid in the form of a Maximum Cost-Per-Click (“CPC”), i.e., the maximum price the advertiser is willing to pay each time its advertisement is “clicked” by a user of the search engine. AdWords then multiplies each bid by a “Quality Score,” also known as the estimated Click Through Rate (“eCTR”), which predicts the likelihood that a user searching for the designated keyword will click on the subject advertisement, based on a confidential algorithm that considers various historical factors.

The product of the bid (Maximum CPC) and the Quality Score (eCTR) yields an “Ad Rank” for each advertisement. The Ad Ranks are then used to sort and place advertisements in descending order on the corresponding results page. Once the advertisements have been sorted, the actual cost paid by an advertiser per click is discounted to the lowest price the advertis *1313 er could have bid to achieve the same position, using a formula known as generalized second-price auction. Those computations are repeated each time a new search is conducted.

AdWords also offers a “Position Preference” feature that allows advertisers to specify a preferred position or range of positions for the placement of their advertisements. The Position Preference feature enables advertisers to select a position or range of positions for AdWords to target, such as position 4, positions 1 through 5, or positions 5 through 10. If the advertiser activates the Position Preference feature, AdWords ensures that the advertisement will never appear below the lowest preferred position, although it may appear above the highest preferred position. AdWords monitors the advertisement’s average position over a period of time, as auctions are triggered by relevant keyword searches, and it submits an adjusted proxy bid every 24 hours as needed to keep the advertisement at or above the target position. Other than the periodic substitution of a new proxy bid, the auctions are conducted in the same manner whether or not the Position Preference feature is activated.

B

The T51 patent builds on prior art involving continuous auctions for priority placement in internet search results. An early search engine called Goto.com offered auctions in which advertisers could compete for the top positions on the search results for any given keyword. The highest bidder would appear first in the search results, and each successive entry would be awarded to the next highest bidder. The purported novelty of the ’151 patent is that it enables bidders to pursue positions other than the highest available position. It does so by determining whether a bidder’s bid is too high for a specific position of priority that the bidder wishes to maintain in the auction. If it is, the system automatically reduces the bidder’s bid to avoid exceeding the amount necessary to maintain the bidder’s desired position of priority. If the bidder’s bid is too low for a specific position of priority that the bidder wishes to maintain, the system automatically increases the bidder’s bid, up to a maximum level set by the bidder. Thus, even though the auction is continuous, the process allows the bidder to maintain a relatively constant position over time, as long as the bidder’s maximum bid is not exceeded.

The two claims at issue in this appeal are a method claim and a corresponding system claim. Claim 1 of the T51 patent reads as follows (emphases added):

A method 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, comprising:
receiving bid management data from a first bidder for managing bidding by the first bidder in the auction, the auction having at least two or more positions of priority, the received bid management data including information for selecting one of the two or more positions of priority that the first bidder wishes to maintain in the auction;
checking for if a second bidder holds the selected position of priority, and
checking for whether a first bid from the first bidder exceeds a second bid from the second bidder in the auction for determining continuing priority for providing an ongoing service for the first and second bidder, wherein the relative position of 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 position of priority for providing the service for the second *1314 bidder is dependent on whether the value of the second bid exceeds the value of the first bid;
according to the bid management data received from the first bidder, automatically incrementing the first bid to a value exceeding the second bid if the first bid does not exceed the second bid, to thereby maintain the selected position of priority for providing the service for the first bidder;
checking for whether the first bid is higher than needed to maintain the selected position of priority that the first bidder wishes to maintain in the auction, and
if the first bid is higher than needed to maintain the selected position of priority that the first bidder wishes to maintain in the auction, automatically reducing the first bid to a minimum which allows the bidder to keep the selected position of priority.

Claim 11, the system claim, is identical to claim 1 in all relevant respects except that in the first subparagraph, claim 11 reads, “the received bid management data including selected one of the two or more positions of priority,” while claim 1 reads, “the received bid management data including information for selecting one of the two or more positions of priority.” 2

Following a Markman hearing, the district court issued a claim construction order on July 11, 2008.

Free access — add to your briefcase to read the full text and ask questions with AI

Related

Cite This Page — Counsel Stack

Bluebook (online)
601 F.3d 1311, 94 U.S.P.Q. 2d (BNA) 1368, 2010 U.S. App. LEXIS 7163, 2010 WL 1337733, Counsel Stack Legal Research, https://law.counselstack.com/opinion/bid-for-position-llc-v-aol-llc-cafc-2010.