Location price-quotation for search system paying according sequence
A search system and data technology, applied in the field of database search systems, can solve problems such as not being able to handle tie situations well
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0042] Example 1. In a first example, an advertiser with an old position of 5 at an offer amount of $0.90 requests a position of 2 and specifies an offer cap of $1.50. Based on existing offers and rules, the new rank is 2 and the offer amount is $1.00. Thus, the system receives the bid cap and the desired ranking of the selected search listing, and adjusts the corresponding bid amount of the selected search listing according to the bid cap and the desired rank. In this particular embodiment, a bubble popping process is used to reduce the offer amount from a specified amount or offer cap to an offer amount that is just high enough to achieve the desired rank.
[0043] Example 1: No problem. Give the requested rank.
[0044] Rank Original State B2P Rank Final State
[0045] 1 $1.00 Old Rank: 5 1 $1.00
[0046] 2 $0.99 Old Quote: $0.90 2 $1.00
[0047] 3 $0.98 3 $0.99
[0048] 4 $0.92 Request rank: 2 4 $0.98
[0049] 5 $0.90 Quote limit: $1.50 5 $0.92
[0050] 6 $0.80 6 ...
example 2
[0054] Example 2. In a second example, an advertiser with an old position of 5 at an offer amount of $0.90 requests a position of 2 and specifies an offer cap of $1.50. But at this time, there is a tie situation, that is, the two lists with the quoted amount of $1.00 rank first and second. Applying the above rules, since the tie situation makes the requested rank 2 unavailable, the system adjusts the new offer by increasing the offer amount by $0.01 above the tie amount, placing the search listing at rank one.
[0055] Example 2: A tie makes the new rank higher than the requested rank.
[0056] Rank Original State B2P Rank Final State
[0057] 1 $1.00 Old Rank: 5 1 $1.01
[0058] 2 $1.00 Old Quote: $0.90 2 $1.00
[0059] 3 $0.98 3 $1.00
[0060] 4 $0.92 Request rank: 2 4 $0.98
[0061] 5 $0.90 Quote limit: $1.50 5 $0.92
[0062] 6 $0.80 6 $0.80
[0063] New rank: 1
[0064] New offer: $1.01
[0065] Status: Partially successful
example 3
[0066] Example 3. In a third example, an advertiser with an old position of 5 at an offer amount of $0.90 requests position 2 and specifies an offer cap of $0.95. In this example, the $0.95 offer ceiling places the search listing at a new rank below the requested rank due to the other listings at ranks 1, 2, and 3 at bids of $1.00, $0.99, and $0.98, respectively.
[0067] Example 3: Quote capping makes the new rank lower than the requested rank.
[0068] Rank Original State B2P Rank Final State
[0069] 1 $1.00 Old Rank: 5 1 $1.00
[0070] 2 $0.99 Old offer: $0.90 2 $0.99
[0071] 3 $0.98 3 $0.98
[0072] 4 $0.92 Request Rank: 2 4 $0.93
[0073] 5 $0.90 Quote limit: $0.95 5 $0.92
[0074] 6 $0.80 6 $0.80
[0075] New rank: 4
[0076] New offer: $0.93
[0077] Status: Partially successful
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 