Back to results
US 8,799,139 B1Granted
Position-based auction
AssigneeGoogle Inc.
InventorsGagan Aggarwal, Jon Feldman, Shanmugavelayutham Muthukrishnan, Rohit Rao, Adam Wildavsky
Life of this patent
Estimating the term…
Abstract
A method is described that includes accessing bids for ranked goods and minimum rank indicators that each specifies a lowest rank for a good that is acceptable to a bidder, assigning a ranked good to a first bidder based on a first bid and a first minimum rank indicator each associated with the first bidder, and outputting a signal indicative of a cost of the assigned rank good based on a second bid associated with a next highest bidder having a second minimum rank indicator that specifies a rank that is inclusive of a rank of the ranked good assigned to the first bidder.
Claims31
A computer implemented method, comprising:
- receiving a plurality of bids for advertising positions that are associated with a keyword;
- generating, by one or more processors, a first minimum rank indicator associated with a bid from the plurality of bids and specifying a lowest advertising position rank that is acceptable to a first bidder;
- receiving a query and one or more keywords associated with the query;
- performing an auction based at least in part on the query, the one or more keywords that are associated with the query, and the plurality of bids;
- based on the bid from the plurality of bids and on the auction, assigning, by the one or more processors, an advertising position rank to the first bidder;
- determining, based on the first minimum rank indicator, that the advertising position rank assigned to the first bidder is not acceptable to the first bidder;
- and
- based on determining that the advertising position rank assigned to the first bidder is not acceptable to the first bidder, preventing, by the one or more processors, the advertising position rank from being assigned to the first bidder.
5 more elements
A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
- receiving a plurality of bids for advertising positions that are associated with a keyword;
- generating, by one or more processors, for each of a plurality of bidders, a minimum position indicator that specifies a lowest ranked advertisement position that is acceptable for advertisement placement in a ranked advertisement position;
- receiving a query and one or more keywords associated with the query;
- performing an auction based at least in part on the query, the one or more keywords that are associated with the query, and the plurality of bids;
- assigning, by the one or more processors, a ranked advertisement position for placement of an advertisement associated with a first bidder based on a first bid from the plurality of bids from the first bidder;
- determining, based on the minimum position indicator, that the ranked advertisement position assigned for placement of the advertisement is not acceptable to the first bidder;
- and
- based on determining that the ranked advertisement position assigned for placement of the advertisement is not acceptable to the first bidder, preventing, by the one or more processors, the ranked advertisement position from being assigned to the first bidder.
5 more elements
A system, comprising:
- a processor for generating a first minimum rank indicator specifying a lowest advertising position rank of an advertising position that is acceptable to a first bidder;
- and
- an assigning module for assigning an advertising position to the first bidder based on a first bid associated with the first bidder and the first minimum rank indicator, for determining that the advertising position rank is not acceptable to the first bidder, and for preventing, based on determining that the advertising position rank is not acceptable to the first bidder, the advertising position from being assigned with the first bidder.
A computer implemented method, comprising:
- accessing, by one or more processors, a plurality of bids for advertising positions;
- generating, by the one or more processors, minimum rank indicators that each specify a lowest rank for a respective advertising position that is acceptable to a respective bidder;
- ranking, by the one or more processors, the plurality of bids;
- assigning, by the one or more processors, a first bid from the plurality of bids with a first advertising position, the first bid being a highest-ranked bid and the first advertising position being a highest-ranked good;
- determining, by the one or more processors, that a rank of a second advertising position is not acceptable to a second bidder associated with a second bid from the plurality of bids based on a minimum rank indicator associated with the second bidder, the second bid being ranked lower than the first bid and the rank of the second advertising position being a lower-ranked than the first advertising position;
- determining, by the one or more processors, that the rank of the second advertising position is acceptable to a third bidder associated with a third bid from the plurality of bids based on a minimum rank indicator associated with the third bidder, the third bid being ranked lower than the second bid;
- and
- assigning, by the one or more processors and based on determining that the rank of the second advertising position is acceptable to a third bidder, the third bid to the second advertising position.
5 more elements
Dependencies are inferred from the claim text.