CN111861567A

CN111861567A - Advertisement space bidding method and system

Info

Publication number: CN111861567A
Application number: CN202010714774.6A
Authority: CN
Inventors: 许�鹏
Original assignee: Individual
Current assignee: Individual
Priority date: 2020-07-23
Filing date: 2020-07-23
Publication date: 2020-10-30

Abstract

The invention provides an advertisement space bidding method and system, wherein the method comprises the following steps: collecting advertisement position information to be leased released by an operator, and allocating a unique code to each advertisement position; generating a price list P of the advertisement position and issuing the price list P to a client; updating the price of each advertisement position in the price list according to the bidding information of the client, and then releasing the updated price list P; and the client determines whether to continue to quote and change the quote according to the updated price list. The invention can rapidly update the quotes of different advertisement positions according to the bid of the bidder, and provides the quotes to the advertisement position operator and the bidder for bidding reference. By the technical scheme provided by the invention, a fair bidding opportunity can be obtained for bidders, and the lease price can be maximized for operators.

Description

Advertisement space bidding method and system

Technical Field

The invention relates to the field of data processing, in particular to a method and a system for bidding an advertisement space.

Background

In the prior art, an advertisement space operator needs to release advertisement space information to be rented on a current platform, price the advertisement space at each position, and then obtain the renting requirement fed back by a client. Generally, the customers who contact first can obtain the lease right of the related advertising spots according to the pricing of the operator, and then the customers who contact later often cannot take the advertising spots which want to be leased even if the prices are higher. This situation can cause losses to both the customer and the operator.

Disclosure of Invention

The purpose of the invention is as follows: in order to make up for the defects of the prior art, the invention provides an advertisement space bidding method and system.

The technical scheme is as follows: the invention provides an advertisement space bidding method, which comprises the following steps:

(1) collecting advertisement position information to be leased released by an operator, distributing a unique code for each advertisement position, and combining the coded advertisement positions into an advertisement position lease set; generating a price list P for the advertisement space lease set, wherein the price of each advertisement space in the price list P is an initial price at the beginning;

(2) issuing a price list P to the client participating in bidding;

(3) the client selects the number of the advertisement position to be bid according to the price list P, and gives a quote: if the bidding price is a single advertisement position, the single advertisement position is quoted, and the quoted price is larger than the price of the corresponding single advertisement position recorded in the price list P; if a plurality of advertisement positions are required to be packed and bid, the bid price is larger than the sum of the prices of the corresponding advertisement positions recorded in the price list P;

(4) if the current quotation is only the quotation of a single advertisement position, updating the price of the corresponding advertisement position in the P to be the quotation price; if the current quotation is the set quotation of a plurality of advertisement positions, adding a price record on a price list P, wherein the items in the price record are the sets of the plurality of advertisement positions, and the prices in the price record are the quotation of the sets; at the same time, for all the individual slots falling within the scope of the set, the corresponding price is updated in the quotation P to the price of the combination;

(5) the client continues to quote based on the updated price list, individual items on the price list can be quoted during the quotation, a plurality of items can be combined to quote, the quoted price is larger than the sum of the prices of the individual items, and the items of the combined quotation need to meet the following conditions at the same time:

condition 1: there are no cross terms between any two items of the combined quote;

condition 2: the set formed by any two items cannot have cross items with an existing advertisement space set item in the P;

if a certain client quotes an advertisement space set X based on the condition 1 and the condition 2, finding out all advertisement space set items in P, and if a certain advertisement space set falls into the range of X, deleting the corresponding advertisement space set and the quotation thereof from P; then recording the advertisement space set X and the quotation thereof into P to form a new price record;

if a client quotes an independent advertisement space A, deleting all advertisement space set items and prices related to the advertisement space from P, recovering the initial prices of the rest independent advertisement spaces in the deleted set, and updating the price of the advertisement space A in P as the current quote;

(6) and (5) repeating the step until one round of bidding is finished, and the client-side which does not quit the bidding obtains the lease right of the corresponding advertisement space according to the bidding.

In another aspect, the present invention further provides an advertisement slot bidding system, including: the system comprises an operator information acquisition module, a bidder information acquisition module, a service processing module and an information release module;

an operator information acquisition module acquires advertisement position information to be leased, which is released by an operator and comprises an address and an initial price of an advertisement position;

the bidding party information acquisition module acquires bidding information of a bidding party, wherein the bidding information comprises advertisement positions to be bid and the bidding of the advertisement positions, if only one advertisement position is bid, the bidding is the bidding of the single advertisement position, and if a plurality of advertisement positions are bid, the bidding is the total price of the plurality of advertisement positions;

the business process module performs the specific steps of the bidding method according to claim 1, and issues each updated price ticket and final bid result through the information issuing module during the bidding process.

Several alternatives are provided below, but not as an additional limitation to the above general solution, but merely as a further addition or preference, each alternative being combinable individually for the above general solution or among several alternatives without technical or logical contradictions.

Optionally, the business processing module includes a memory for storing at least one instruction and a processor for executing the at least one instruction to implement the bidding method.

Optionally, the advertisement publishing system further comprises a GIS module, the GIS module is configured to draw an advertisement delivery site distribution map according to an advertisement site address in the advertisement site information to be rented, and the service processing module publishes the advertisement site distribution map through the information publishing module.

Optionally, before the service processing module issues the advertisement space distribution map, the following steps are further performed:

and associating each advertisement space in the advertisement space distribution map with the corresponding code, and matching the price in the price list to each advertisement space in the advertisement space distribution map according to the ID every time the price list is updated.

Optionally, the advertisement slot information to be leased further includes a description file for describing information of a corresponding advertisement slot and environment information, and the description file may be read by a service processor and generates an image file of the corresponding advertisement slot through a virtual display technology; the service processor module stores the image files, establishes virtual icons for the advertisement positions in the advertisement position distribution map, and associates the virtual icons with the corresponding image files; the client selects the virtual icon, the associated image file can be downloaded, and scene reconstruction is carried out on the image file at the client, so that the self image and the environment image of the corresponding advertisement space can be displayed.

Has the advantages that: compared with the prior art, the invention has the following advantages:

the invention provides an advertisement position bidding method and system, which can quickly update the bids of different advertisement positions according to the bids of bidders and provide the bids for advertisement position operators and bidders for bidding reference. By the technical scheme provided by the invention, a fair bidding opportunity can be obtained for bidders, and the lease price can be maximized for operators.

Drawings

Fig. 1 is a diagram illustrating a structure of an advertisement slot bidding system according to an embodiment of the present invention.

Detailed Description

The present invention will be further described with reference to the accompanying drawings.

The invention aims to provide an advertisement space bidding method and system which can realize fair bidding and ensure the maximum lease price of an operator.

In view of the above, the present invention provides a method for bidding an advertisement space, comprising the following steps:

(2) issuing a price list P to the client participating in bidding;

The above method is explained below by means of specific examples.

Example (b):

suppose the ad spots that the operator wants to sell are: a, b, c, d, e, 5 total, the initial price of 5 ad slots is 1 yuan. The price list P at this time is:

a	1 Yuan
		b	1 Yuan
c	1 Yuan
		d	1 Yuan
e	1 Yuan

The existing client-side A quotes, and the quoted information is as follows: a, b, c, 4-membered. Indicating that the first wants to package rentals a, b, c for 3 ad slots at a price of 4 dollars. The price list P at this time is updated as:

this price list represents: the individual ad slots a, b, c are now 4-ary at a minimum, and the combined ad slot of abc is also 4-ary, and subsequent bidders can only bid on the individual ad slots a, b, c, or the combined ad slot of abc.

At this time, the client side B quotes, and the quote information is as follows: d, e, 3-membered. Indicating that b wants to package lease d, e for 2 ad slots at a price of 3 dollars. The bidding object of the client B has no relation with the client A, so the bidding of the client A is not influenced. The price sheet P at this time is updated as:

a	4 yuan
		b	4 yuan
c	4 yuan
		d	3 yuan
e	3 yuan
		abc	4 yuan
de	3 yuan

Assuming that there is a third price quoted by the client after the price list is updated, the third price can be quoted separately for the existing items on the price list, and the quoted price is only higher than the current price of the items, for example: bid on a, then bid above 4, bid on abc, then bid above 4, bid on de, bid above 3, and so on.

If one wants to make a packaged offer for each item on the price sheet, then these packaged items must satisfy the following conditions:

the packaged items must have no cross-relationship with each other, e.g., a and abc are not packageable;

in a packaged item, a set composed of any two items cannot have cross items with existing set items, for example: ab. ac and bc are cross items a with the existing collection item abc, so that the quotation cannot be packaged; the ad and ae have cross parts with the existing collection item de, and can not pack the quotation; however, abc and de do not overlap, so the bid for abcde may be greater than abc + de, i.e., greater than 7-yuan.

Here we assume that the client has 8 x bid for abcde, and the updated price list P is:

a	8 yuan
		b	8 yuan
c	8 yuan
		d	8 yuan
e	8 yuan
		abcde	8 yuan

The bid of C results in a failure to bid for A and B, at which point the system will prompt a failure to bid for A and B. If no one bids on the advertisement slot within the third bidding price range in the current bidding round, the third bidding price is successful.

If a client side D bids on the ad and bids 9 yuan at the moment, the bid is exceeded, the single ad slot irrelevant to the ad returns to the original price, and the price of each combined ad slot is the sum of the updated prices of the single ad slot. The updated price list P is:

a	9 yuan
		b	1 Yuan
c	1 Yuan
		d	1 Yuan
e	1 Yuan
		abcde	13 Yuan

In the invention, the sum of the prices of the sub-ranges is equal to the initial price of the parent range, the price of the parent range is used for determining the independent prices of all the sub-ranges, the price of the sub-ranges is increased, and the price of the parent range is increased. The price is in the range of parent and child, so that different ranges can bid on the same platform, thus ensuring that the system can obtain the highest price in each bidding round.

The invention also provides an advertisement space bidding system for realizing the method. This is explained in more detail in example 2 below.

Example 2

FIG. 1 illustrates an ad placement bidding system, comprising: the system comprises an operator information acquisition module, a bidder information acquisition module, a service processing module, an information release module and a GIS module;

the business processing module executes the concrete steps of the bidding method and releases the price list and the final bidding result after each update through the information release module in the bidding process;

the GIS module is used for drawing an advertisement delivery position distribution map according to the advertisement position addresses in the advertisement position information to be leased, and the business processing module issues the advertisement position distribution map through the information issuing module.

In particular, the business processing module is implemented by a memory, which is essentially a computer-readable storage medium, for storing at least one instruction, and a processor for executing the at least one instruction to implement the bidding method.

Preferably, before the service processing module issues the advertisement space distribution map, the following steps are further executed:

Preferably, the advertisement slot information to be leased further includes a description file for describing information of the corresponding advertisement slot itself and environment information, and the description file may be read by a service processor and generates an image file of the corresponding advertisement slot through a virtual display technology; the service processor module stores the image files, establishes virtual icons for the advertisement positions in the advertisement position distribution map, and associates the virtual icons with the corresponding image files; the client selects the virtual icon, the associated image file can be downloaded, and scene reconstruction is carried out on the image file at the client, so that the self image and the environment image of the corresponding advertisement space can be displayed.

The above description is only of the preferred embodiments of the present invention, and it should be noted that: it will be apparent to those skilled in the art that various modifications and adaptations can be made without departing from the principles of the invention and these are intended to be within the scope of the invention.

Claims

1. An advertisement space bidding method is characterized by comprising the following steps:

(2) issuing a price list P to the client participating in bidding;

2. An ad spot bidding system, comprising: the system comprises an operator information acquisition module, a bidder information acquisition module, a service processing module and an information release module;

3. The system of claim 2, wherein the business processing module comprises a memory for storing at least one instruction and a processor for executing the at least one instruction to implement the bidding method.

4. The advertisement spot bidding system according to claim 3, further comprising a GIS module, wherein the GIS module is configured to draw an advertisement spot distribution map according to the advertisement spot address in the advertisement spot information to be rented, and the service processing module issues the advertisement spot distribution map through the information issuing module.

5. The advertisement spot bidding system of claim 4, wherein before the service processing module issues the advertisement spot distribution map, the following steps are further executed:

6. The advertisement spot bidding system of claim 5, wherein the advertisement spot information to be rented further comprises a description file for describing the information of the corresponding advertisement spot itself and the environmental information, the description file can be read by the service processor, and an image file of the corresponding advertisement spot is generated by the virtual display technology; the service processor module stores the image files, establishes virtual icons for the advertisement positions in the advertisement position distribution map, and associates the virtual icons with the corresponding image files; the client selects the virtual icon, the associated image file can be downloaded, and scene reconstruction is carried out on the image file at the client, so that the self image and the environment image of the corresponding advertisement space can be displayed.