CN111724177A

CN111724177A - Playing permission sorting method and device, storage medium and electronic equipment

Info

Publication number: CN111724177A
Application number: CN201910204587.0A
Authority: CN
Inventors: 张月
Original assignee: Beijing Wodong Tianjun Information Technology Co Ltd
Current assignee: Beijing Wodong Tianjun Information Technology Co Ltd
Priority date: 2019-03-18
Filing date: 2019-03-18
Publication date: 2020-09-29

Abstract

The disclosure relates to the technical field of internet, and provides a playing permission sorting method, a playing permission sorting device, a computer readable storage medium and electronic equipment. The playing permission sorting method comprises the following steps: when a playing request is received, acquiring a first playing numerical value and a first budget numerical value of a playing object; determining a second budget value according to the playing probability of the playing object and the first budget value; when the first playing numerical value is judged to be between the second budget numerical value and the first budget numerical value, sequencing the playing permission by the second playing numerical value; and the second playing numerical value is determined according to the playing probability and the first playing numerical value. The method and the device can effectively solve the multimedia super-broadcasting problem existing in the prior playing technology and enhance the playing effect.

Description

Playing permission sorting method and device, storage medium and electronic equipment

Technical Field

The present disclosure relates to the field of internet technologies, and in particular, to a playing permission sorting method, a playing permission sorting apparatus, a computer-readable storage medium, and an electronic device.

Background

With the development of internet technology, multimedia playing technology is increasingly widely used.

Taking advertisement playing as an example, in the existing advertisement playing technology, when an advertisement playing platform receives an advertisement playing request, relevant advertisements meeting conditions are searched, and whether to participate in bidding ranking is determined according to the bidding price of the advertisement and the budget of an advertiser, so that real-time playing of the advertisement is realized. However, in practical applications, there is a serious problem of over-seeding due to the influence of various factors. In addition, in the existing advertisement playing technology, the advertiser is difficult to know the final advertisement bid by the increasingly numerous advertisement bid calculation methods, and the budget amount and the advertisement investment cost cannot be accurately set according to the advertisement bid, so that the advertisement playing effect is influenced.

Therefore, it is necessary to provide a method and an apparatus for ordering playing permissions to solve the problems of super-broadcasting of information and poor playing effect in the prior art.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

The present disclosure aims to provide a playing permission ordering method, an apparatus, a computer-readable storage medium and an electronic device, so as to overcome the problems of super-broadcasting of information and poor playing effect in the related art at least to a certain extent.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.

According to an aspect of the present disclosure, there is provided a play permission sorting method, including:

when a playing request is received, acquiring a first playing numerical value and a first budget numerical value of a playing object;

determining a second budget value according to the playing probability of the playing object and the first budget value;

when the first playing numerical value is judged to be between the second budget numerical value and the first budget numerical value, sorting the playing permission by using a second playing numerical value of the playing object; and the second playing numerical value is determined according to the playing probability and the first playing numerical value.

In an exemplary embodiment of the present disclosure, the play right sorting method further includes: and stopping sequencing the playing permission when the first playing numerical value is judged to be larger than the first budget numerical value.

In an exemplary embodiment of the disclosure, the obtaining a first playing value and a first budget value of a playing object when the playing request is received includes: when a playing request is received, searching a corresponding playing object according to the playing request, and acquiring a first playing value and a first budget value of the playing object.

In an exemplary embodiment of the present disclosure, before the obtaining the first auction playing value and the first budget value of the playing object, the method further includes: and acquiring a corresponding playing object according to the playing request.

In an exemplary embodiment of the disclosure, before the obtaining the first playing value and the first budget value of the playing object, the method further includes: and determining the first playing numerical value according to the display coefficient of the playing object.

In an exemplary embodiment of the present disclosure, after the determining the first play value, the method further includes: and displaying the first playing numerical value.

In an exemplary embodiment of the present disclosure, after the sorting the playback right by the second playback value of the playback object, the method further includes: and determining the quality value of the playing object, and sequencing the playing permission according to the quality value of the playing object.

According to another aspect of the present invention, there is provided a playback right sorting apparatus including:

the acquisition module is used for acquiring a first playing numerical value and a first budget numerical value of a playing object when a playing request is received;

a determining module, configured to determine a second budget value according to the playing probability of the playing object and the first budget value;

a sorting module, configured to sort the playback permission with a second playback value of the playback object when it is determined that the first playback value is between the second budget value and the first budget value; and the second playing numerical value is determined according to the playing probability and the first playing numerical value.

According to yet another aspect of the disclosure, a computer-readable storage medium is provided, on which a computer program is stored, which computer program, when executed by a processor, implements the method of any of the above.

According to still another aspect of the present disclosure, there is provided an electronic device including:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform any of the methods described above via execution of the executable instructions.

Compared with the prior art, the present disclosure has at least the following differences and beneficial effects:

the disclosure provides a playing permission sorting method and a playing permission sorting device, which are used for selectively playing various kinds of information. For each object to be played, under the condition that the playing cost is closer to the preset budget (or budget balance), determining a lower price according to the playing probability and the playing cost to sequence the playing rights of the playing object, thereby playing the playing object with the highest sequence. On one hand, the method and the device can effectively control the probability of the final playing of the playing object, and reduce the arrangement sequence of the playing rights of the playing object with the playing cost closer to the budget cost so as to reduce the possibility of the final playing of the playing object. The method can reduce the loss of the multimedia playing platform caused by the problem of super-playing and obtain better playing effect. On the other hand, the playing authority is ordered with a lower price before playing and the playing fee is paid with a lower price after playing, so that the problem that the budget balance is not enough to pay the playing fee after two continuous times of playing in the prior art is solved, and the playing cost of the playing platform is reduced. In addition, the method can control the playing cost within the budget range of the user, and the user does not pay more playing cost due to the oversubscription.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the scope of the disclosure, as claimed.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is apparent that the drawings in the following description are of some embodiments of the disclosure and that other drawings may be derived from those drawings by a person of ordinary skill in the art without inventive effort. In the drawings:

fig. 1 is a flowchart illustrating a play permission sorting method in an embodiment of the present disclosure;

FIG. 2 illustrates a block diagram of an ad bid play system in an embodiment of the present disclosure;

FIG. 3 illustrates a flow chart of a method of ad bid play in an embodiment of the present disclosure;

FIG. 4 illustrates a block diagram of a bid calculation module in an embodiment of the present disclosure;

FIG. 5 illustrates a schematic diagram of a bid display interface in an embodiment of the present disclosure;

FIG. 6 illustrates a schematic diagram of another bid display interface in an embodiment of the present disclosure;

fig. 7 is a block diagram schematically illustrating a playback right sorting apparatus according to an embodiment of the present disclosure;

fig. 8 illustrates a block diagram of an electronic device in an embodiment of the disclosure.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.

Furthermore, the drawings are merely exemplary illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus, a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices. The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the steps. For example, some steps may be decomposed, and some steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation. In addition, the terms "first" and "second" of the present disclosure are for distinguishing purposes only and should not be construed as limiting the present disclosure.

The following explains the super-broadcast problem in the related art by taking advertisement playing as an example:

in the related advertisement bidding playing technology, when an advertisement playing platform receives an advertisement playing request from a client, the advertisement playing platform searches advertisements meeting conditions according to the advertisement playing request, and determines whether to perform bidding ranking according to the bidding price of the advertisements and the budget set by an advertiser so as to play the advertisement with the highest bidding ranking.

Specifically, the advertisement playing platform determines whether to bid according to the budget set by the advertiser (or the budget balance after paying the previous playing fee) and the advertisement bid calculated by the bid calculation module: when the advertisement bid is less than the budget, performing bidding ranking on the advertisement; stopping the bid ranking, i.e., stopping playing the advertisement, when the advertisement bid is greater than the budget; in the case that the bid is closer to the budget (the bid is slightly smaller than the budget), after the bid ranking is carried out and the advertisement is played, the budget balance is less than the next advertisement bid, and the next advertisement playing cost is not enough to be paid. However, since a certain time is required from entering the advertisement bid ranking to completing the fee settlement of the advertisement playing in the current playing, the fee settlement may occur between the next bid ranking and the advertisement playing, and therefore, the phenomenon of the advertisement oversubscription can occur because the current budget balance is not enough to pay the advertisement playing fee until the fee settlement of the advertisement playing is completed next time.

In addition, in the related advertisement playing technology, the types of advertisement bids are increasingly diversified, and multiple bid modes such as a common bid, a first-ranking bid, a recommended crowd bid, a keyword bid and the like can exist in the same advertisement; and the advertisement bidding calculation method is more complex, and often involves complex calculation among multiple bidding coefficients, for example, different ranking overflow coefficients and crowd overflow coefficients can be set, so as to set corresponding bids for different crowds and different time periods. In these cases, it is difficult for the user to know the final advertisement bid after setting various parameters, and it is impossible to know whether the bid is within the expected cost range and the budget set by the user is lower than the bid, which affects the advertisement playing effect.

Based on the above defects, the present disclosure provides a playing permission sorting method and device to solve the problem of super-broadcasting and the problem of poor playing effect in the related art. The playing permission sorting method comprises the following steps:

step S11: when a playing request is received, acquiring a first playing numerical value and a first budget numerical value of a playing object;

step S12: determining a second budget value according to the playing probability of the playing object and the first budget value;

step S13: when the first playing numerical value is judged to be positioned between the second budget numerical value and the first budget numerical value, carrying out playing permission sequencing on the second playing numerical value of the playing object; and the second playing numerical value is determined according to the playing probability and the first playing numerical value.

The present disclosure provides a playing permission sorting method and device, wherein the playing permission sorting is adjusted through a relationship between the playing cost and the playing budget, and when the playing cost is slightly lower than the playing budget (or budget balance), a lower price is determined according to the playing probability and the playing cost to perform the playing permission sorting, so as to play the playing object with the highest sorting. On one hand, the method and the device can effectively control the probability of the final playing of the playing object, and reduce the arrangement sequence of the playing rights of the playing object with the playing cost closer to the budget cost so as to reduce the possibility of the final playing of the playing object. The loss of the multimedia playing platform caused by the problem of super-playing can be reduced, and a better playing effect is obtained. On the other hand, the playing authority is ordered with a lower price before playing and the playing fee is paid with a lower price after playing, so that the problem that the budget balance is not enough to pay the playing fee after two continuous times of playing in the prior art is solved, and the playing cost of the playing platform is reduced. In addition, the method can control the playing cost within the budget range of the user, and the user does not pay more playing cost due to the oversubscription.

The following describes the playing permission ordering method and apparatus according to the present disclosure in detail by taking advertisement playing as an example. An embodiment of the present disclosure relates to a play permission sorting method, and fig. 1 exemplarily shows a flowchart of a play permission sorting method in an embodiment of the present disclosure. Referring to fig. 1, the play right sorting method includes the following steps:

in one embodiment of the present application, step S11 may include: the client sends a playing request to the server; and when the server receives the advertisement playing request, searching the advertisement meeting the conditions according to the advertisement playing request, and acquiring a first playing numerical value and a first budget numerical value of the advertisement meeting the conditions.

The client can be a media website provided with an advertisement display position, and can also be social and game application software provided with the advertisement display position; it should be understood that the client sending the advertisement playing request in the present disclosure may also be other network platforms provided with the advertisement display position, and the present disclosure is not limited thereto. When the server receives a play request sent by the client, a large number of advertisements can be screened according to relevant information contained in the play request, and only the advertisements meeting the play conditions are subjected to bidding sorting operation.

Specifically, the advertisement playing request may include user ID information (e.g., a user cookie of the advertisement transaction platform, a mobile device ID, etc.), user IP information, and advertisement location information (e.g., a page URL, an advertisement location, etc.); it should be understood that other information (e.g., merchandise information, etc.) related to playing the advertisement may also be included in the advertisement playing request, and the disclosure is not limited thereto.

In an exemplary embodiment of the present disclosure, the first play value is an advertising bid determined by an advertising bidding module according to a plurality of parameters. Alternatively, the first playing value may be calculated in advance and stored in the playing permission sorting system, or may be calculated in real time when the advertisement playing request is received. Exemplary, relevant parameters for calculating advertising bids include, but are not limited to: wireless bidding coefficient, display coefficient, first-ranking name premium coefficient, directional premium coefficient, highest crowd premium and first-ranking name premium, etc.

Based on this, before obtaining the first playing value and the first budget value of the advertisement, the method may further include: and determining a first playing numerical value according to the display coefficient of the playing object. Illustratively, the first playing value (advertisement bid) is determined by a bid calculation module at the advertiser end, and after the advertiser sets various bid parameters, the bid calculation module calculates a final advertisement bid according to the bid parameters and the category average bid, and transmits the advertisement bid and a budget set by the advertiser to a server for storage. Illustratively, the presentation coefficient used to determine an advertising bid may be defined by the following equation:

the display coefficient is used for adjusting the bidding price, so that the advertisement with higher historical click rate can bid for the advertisement space with less price, thereby optimizing the advertisement playing effect. In addition, under the condition that the playing sample is large enough, the total click rate of the advertisement is in a normal distribution, and the display coefficient can normalize the click rate of the advertisement and express the click rate of the advertisement in a Z-score form (the average value is 0.5, and the full score is 1), so that the playing effect that the playing cost is lower when the click rate of the advertisement is higher is realized.

In addition, after determining the first playing value, the method may further include: and displaying the first playing numerical value. Specifically, after the advertisement bids are determined, the advertisement bids, comparison conditions of the advertisement bids and the category average bids, bid adjustment information (e.g., suggesting that the bids are increased when the bids are lower than the category average bids), and the like can be displayed at the advertiser end, so that the advertiser can adjust the advertisement putting strategy in time according to the advertisement bids to achieve a better advertisement playing effect.

In one exemplary embodiment of the present disclosure, the first budget value is a currently available amount for determining whether the advertisement participates in bidding (or for paying for the advertisement play after the advertisement is played). When the playing permission sorting is carried out for the first time, the first budget value is the budget amount which is set by the advertiser and used for playing the advertisement, and in the playing permission sorting, the first budget value is the budget balance after deducting part or all of the playing cost of the previous advertisement.

Thereafter, the flow proceeds to step S12: determining a second budget value according to the playing probability and the first budget value;

in an exemplary embodiment of the present disclosure, the advertisement playing probability k is used to adjust the probability of the advertisement entering into the bidding ranking, the value range is 0< k <1, and the specific value can be manually adjusted according to the advertisement revenue control strategy; the larger the advertisement playing probability value is, the larger the probability of the advertisement entering the bidding ranking is, and the larger the probability of the advertisement being played finally is.

The second budget value can be regarded as a budget set in the play right ordering system for controlling the advertisement over-broadcasting. Illustratively, the second budget value is the product of the first budget value and the probability of advertisement playing, it being understood that the second budget value may be determined in other ways that may be implemented. For example, the second budget value may be defined as the minimum value of the occurrence of the overseeding phenomenon under the big data statistics.

Thereafter, the flow proceeds to step S13: when the first playing numerical value is judged to be between the second budget numerical value and the first budget numerical value, the playing permission sorting is carried out by the second playing numerical value; and the second playing numerical value is determined according to the playing probability and the first playing numerical value.

The interval between the second budget value and the first budget value, within which the bid is still bid ordered with the advertisement bids, may be defined as the range where the bids are closer to the budget, which may lead to an oversubscription phenomenon. Therefore, the bidding sorting method disclosed by the invention is provided with the second playing numerical value according to the relevant parameters, and the bidding sorting is carried out by using the lower second playing numerical value in the interval so as to reduce the playing probability of the advertisement and solve the problem of super-broadcasting in the prior art. Illustratively, the second play value is defined as the product of the first play value and the advertisement play probability. It should be appreciated that the second play value may also be determined in other ways that may be implemented, for example, the second play value may be defined as the highest advertising bid on a big data statistic that does not cause an oversubscription problem. It can be understood that, in the case of reducing the bid of the advertisement participating in the bidding, the playing cost to be paid after the advertisement is played is also reduced correspondingly, that is, the cost of the advertisement playing is paid by the second playing value participating in the bidding.

Specifically, a second budget value m x k is determined according to the advertisement playing probability k and the first budget value m, and a second playing value n x k is determined according to the advertisement playing probability k and the first playing value n;

if m is judged to be k < n < m, the playing authority is sequenced according to a second playing numerical value n is judged to be k; and after the advertisement is determined to be played, paying the playing fee according to a second playing numerical value n x k.

In an exemplary embodiment of the present disclosure, the play permission sorting method may further include: and stopping the playing permission sorting when the first playing numerical value is judged to be larger than the first budget numerical value. It should be understood that this step may be implemented after step S11, and may also be implemented after step S12, which is not specifically limited by the present disclosure.

Specifically, if it is determined that the first playing value n and the first budget value m satisfy n > m, the advertisement bid is greater than the current budget (or budget balance), and the advertisement is stopped participating in the bidding. If the bidding is continued and the advertisement is played, the budget (or budget balance) after the advertisement is played is insufficient to pay the playing fee. Therefore, when the bid is judged to be larger than the budget (or budget balance), the bidding ranking of the advertisement is stopped, so that the data processing task in the bidding ranking is reduced, and the server resource is saved.

In an exemplary embodiment of the present disclosure, after step S12, the method may further include: and when the first playing numerical value is judged to be smaller than the second budget numerical value, carrying out playing authority sequencing by using the first playing numerical value.

Specifically, if the first playing numerical value n and the second budget numerical value m × k satisfy n < m × k, the first playing numerical value n is used for bidding. At this time, the cost (advertisement bid) for playing the advertisement is much less than the current budget (or budget balance), and even if the next playing is performed before the settlement of the current playing, the budget (or budget balance) is sufficient for paying the current playing cost and the next playing cost. Thus, bidding at the bid of the advertisement does not cause an oversubscription problem.

In an exemplary embodiment of the present disclosure, after step S13, the method may further include: and calculating the quality value of the playing object, and sequencing the playing permission of the playing object according to the quality value.

In particular, the quality value of an advertisement may be determined based on a variety of parameters, such as the nature of the creative of the advertisement, the extent to which the advertisement meets the request, and/or advertiser historical rating information, among others. In addition, the quality value may be a score calculated according to various parameters, may be a grade, may be other comment standards, and is not particularly limited in this disclosure. For example, the playing permission may be sorted according to the determined quality value of the advertisement, for example, the higher the quality value is, the larger the playing permission is, the more forward the rank in the playing permission is, and the greater the probability of playing the advertisement is. Illustratively, the rank of the playing authority can also be determined comprehensively according to the advertisement quality value and the playing cost, so as to achieve better playing effect.

In an exemplary embodiment of the present disclosure, after step S13, the method may further include: obtaining the advertisement with the highest bidding ranking, and sending the advertisement to the client for playing; and paying the advertisement playing fee according to the first playing numerical value (or the second playing numerical value).

Specifically, if a first playing numerical value participates in bidding in the current playing permission sorting, the playing cost is paid by the first playing numerical value after the advertisement is played; if the bidding is participated in the current playing authority sorting by the second playing numerical value, the playing cost is paid by the second playing numerical value after the advertisement is played.

Fig. 2 illustrates a block diagram of an ad bid play system in an embodiment of the present disclosure. Referring to fig. 2, the system 20 includes:

the client 21 is used for sending an advertisement playing request to the gateway when the advertisement needs to be played, and receiving and playing the advertisement returned by the gateway;

a gateway (gateway)22, configured to send the received advertisement playing request to the server according to a network protocol, and send the advertisement to be played from the server to the client;

the advertisement server 23 is configured to perform bid ranking on eligible advertisements according to the received advertisement playing request, and send the advertisement to be played to the gateway;

and the bid calculation module 24 is used for calculating and displaying the advertisement bid according to various parameters set by the advertiser, and sending the advertisement bid and the budget set by the advertiser to the advertisement server.

FIG. 3 illustrates a flow chart of a method for playing an advertisement bid in an embodiment of the present disclosure. Referring to fig. 3, in the advertisement bidding system 20, the play right sorting method is implemented by the following steps:

step S311: the client sends an advertisement playing request to a gateway (gateway);

step S312: the gateway (gateway) receives the advertisement playing request and sends the advertisement playing request to the server;

step S313: the server receives an advertisement playing request, searches advertisements meeting the request condition according to the playing request, and acquires the bid information and budget information of the advertisements;

step S314: and judging whether the advertisement enters into a bidding ranking according to the playing probability k (0< k <1), the bid n and the budget m:

if n > m, the process proceeds to step S315: stopping the advertisement from entering a bid ranking; thereafter, the flow proceeds to step S316: the budget is displayed to be too low at the bid calculation module client side, so that the advertisement playing probability is low, and the budget information is adjusted in time;

if m × k < n < m, the process proceeds to step S317: carrying out bidding ranking by taking n x k as play cost; thereafter proceeding to steps S316 and S318; step S318: the server carries out fine ranking retrieval and coarse ranking retrieval on the advertisements;

if n < m × k, the process proceeds to step S319: performing bidding ranking with the bid m; thereafter, the flow proceeds to step S318;

step S320: the server returns the highest ranked advertisement to the gateway (gateway);

step S321: the gateway (gateway) returns the advertisement to the client and the client plays the advertisement.

FIG. 4 illustrates a block diagram of a bid calculation module. The bid calculation module 24 is operable to determine an advertising bid based on various parameters set by the advertiser and to display the advertising bid. Referring to fig. 4, the bid calculation module 24 includes: a data querier 41, a bid calculator 42, a data store 43, and a bid display 44.

In the bid calculation module 24 shown in fig. 4, calculating and displaying advertising bids is accomplished by: the data inquirer 41 inquires various bid information set by the advertiser and average bid information of other advertisers which are calculated by the advertisement bidding system and have the same advertisement putting category; the bid calculator 42 traverses the keyword setting according to the read bid information, searches the highest-price keyword and the first-ranking-name premium and calculates the bid; traversing the overflow price of the crowd, searching the highest overflow price and calculating the bid; and combining the results through a display coefficient to obtain final advertisement bidding information; the data storage 43 stores advertisement bid information calculated by the bid calculator 42, and an intelligent recommendation bid result, a keyword bid result, an intelligent search space bid result, etc. for display by the bid price display 44; the bid display 44 compares the bid results with the category average bid and displays information suggesting an increased bid when the bid is below the same category bid average.

Illustratively, a bid display interface of a bid display is shown in FIG. 5, which provides a bid calculator float within an RTB conventional bid advertising promotion unit. The bid calculator floating layer displays no information in an initial state and displays bid information (such as bids of PC search advertisement spaces, bids of mobile search advertisement spaces and/or bids of recommended advertisement spaces) and various bid comparison information in real time after setting. Illustratively, another bid display interface is shown in FIG. 6, in which a bid calculator button is provided that can be slid to display an advertising bid range and associated contrast information.

Another embodiment of the present disclosure relates to a play right sorting apparatus, and fig. 7 is a block diagram schematically illustrating a play right sorting apparatus according to an embodiment of the present disclosure. Referring to fig. 7, the play right sorting apparatus 70 includes:

an obtaining module 71, configured to obtain a first playing value and a first budget value of an advertisement when receiving an advertisement playing request;

a determining module 72, configured to determine a second budget value according to the advertisement playing probability and the first budget value, where the second budget value is smaller than the first budget value; and

a sorting module 73, configured to, when it is determined that the first playing value is located between the second budget value and the first budget value, sort the playing permission with the second playing value of the playing object; and the second playing numerical value is determined according to the playing probability and the first playing numerical value.

In an exemplary embodiment of the disclosure, the playing right sorting apparatus may further include a sub-module configured to stop sorting the playing right when the first playing value is determined to be greater than the first budget value; in another exemplary embodiment of the present disclosure, the playing permission sorting apparatus may further include a sub-module, configured to sort the playing permission by the first playing value when the first playing value is determined to be smaller than the second budget value; in another exemplary embodiment of the present disclosure, the playing right sorting apparatus may further include a sub-module for calculating a first playing numerical value according to the presentation coefficient of the playing object; in another exemplary embodiment of the present disclosure, the playing right sorting apparatus may further include a sub-module for displaying the first playing numerical value.

In an exemplary embodiment of the present disclosure, the obtaining module may include: the sub-module is used for searching a corresponding playing object according to the advertisement request when receiving a playing request, and the sub-module is used for acquiring a first playing numerical value and a first budget numerical value of the playing object.

Another embodiment of the present disclosure provides a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above section "exemplary methods" of the present description, when said program product is run on the terminal device.

The program product may be run on a terminal device, such as a server. In the present disclosure, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

Another embodiment of the present disclosure provides an electronic device capable of implementing the method. As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.

An electronic device 800 according to this embodiment of the disclosure is described below with reference to fig. 8. The electronic device 800 shown in fig. 8 is only an example and should not bring any limitations to the function and scope of use of the embodiments of the present invention.

As shown in fig. 8, electronic device 800 is in the form of a general purpose computing device. The components of the electronic device 800 may include, but are not limited to: the at least one processing unit 810, the at least one memory unit 820, a bus 830 connecting different system components (including the memory unit 820 and the processing unit 810), and a display unit 840.

Wherein the storage unit stores program code that is executable by the processing unit 810 to cause the processing unit 810 to perform steps according to various exemplary embodiments of the present invention as described in the above section "exemplary methods" of the present specification. For example, the processing unit 810 may perform step S11, step S12, and step S13 as shown in fig. 1.

The storage unit 820 may include readable media in the form of volatile storage units, such as a random access storage unit (RAM)821 and/or a cache storage unit 822, and may further include a read only storage unit (ROM) 823.

Storage unit 820 may also include a program/utility 824 having a set (at least one) of program modules 825, such program modules 825 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 830 may be any of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 800 may also communicate with one or more external devices 801 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 800, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 800 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 850. Also, the electronic device 800 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 860. As shown, the network adapter 860 communicates with the other modules of the electronic device 800 via the bus 830. It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

It is to be understood that the above-described drawings are merely illustrative of the processes involved in methods according to exemplary embodiments of the invention, and are not limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is to be limited only by the terms of the appended claims.

Claims

1. A method for ordering playback permissions, comprising:

2. The method for sequencing playing rights according to claim 1, further comprising: and stopping sequencing the playing permission when the first playing numerical value is judged to be larger than the first budget numerical value.

3. The method for sequencing playing rights according to claim 1, further comprising: and when the first playing numerical value is judged to be smaller than the second budget numerical value, sequencing the playing permission by the first playing numerical value.

4. The method for sequencing playing permissions according to claim 1, wherein the obtaining a first playing value and a first budget value of a playing object when receiving a playing request comprises: when a playing request is received, searching a corresponding playing object according to the playing request, and acquiring a first playing value and a first budget value of the playing object.

5. The method for sequencing playing rights according to claim 1, further comprising, before the obtaining the first playing value and the first budget value of the playing object: and determining the first playing numerical value according to the display coefficient of the playing object.

6. The method for sequencing playing rights according to claim 5, further comprising, after said determining the first playing value: and displaying the first playing numerical value.

7. The method for sequencing playing rights according to claim 1, wherein after sequencing the playing rights with the second playing value of the playing object, the method further comprises: and determining the quality value of the playing object, and sequencing the playing permission according to the quality value of the playing object.

8. A playback right sorting apparatus, comprising:

9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 1 to 7.

10. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the method of any of claims 1-7 via execution of the executable instructions.