KR20100028875A - Product bidding system for limiting prduct price within step increase and method thereof - Google Patents

Abstract

PURPOSE: A product bidding system for limiting a product price within step increase and a method thereof are provided to supply a reasonable product bidding service that secures a reasonable price, by increasing the highest bidding price step by step. CONSTITUTION: An initial value registration unit(211) stores an initial value of an increase ratio that induces the step-by-step increase in price as well as the ranking of individual product and the lowest bid price. An initial value automatic setting unit(212) automatically sets up the initial value of expected price, a highest bid price and the price for each ranking. When there is the highest bid price, a highest bid price increase unit(234) sets up a bid product and increases the bid price at the increase ratio for every product. When the expected price is changed, an expected price determination unit(233) compares the each expected price with the price for each ranking. Therefore, the lower price is determined as the expected price.

Description

Product bidding system for limiting prduct price within step increase and method

The present invention proceeds to bid on a plurality of products at the same time and limits the base price and the highest price that can be bid in every bid. Whenever the highest price bid occurs for a specific product, the highest possible bid price of another product is increased by one step to limit the sudden increase in price due to overheating of the bid. In addition, even if the successful bidder is determined at the end of the bidding period, the price of the prize is determined by comparing the actual bid price of the successful bidder with the expected value of the product value that has risen step by step in proportion to the number of bids.

The auction determines the user who presented the highest auction price during the auction period as the winner. On the other hand, bidding receives bids from the user during the bidding period and determines the final winner according to the bidding criteria.

The seller hopes to offer the product at a low price base price to compete for price and leave the price competition to the judgment of the market to end at a high winning price. The buyer hopes to join the price competition quickly and preempt the product at the initial base price. However, in the highest price winning method, even if the buyer preempts the competitive product by offering a low amount, the buyer is eliminated from the competition by the high price of another buyer who bids later.

Therefore, buyers who offer low prices through preemption cannot be guaranteed the vested interest by occupying the higher price buyers later, and overheating of price competition leads to exorbitant increase in price, which is rather damaging to successful bidders. There is a problem. In addition, the increase in the successful bid price through price competition temporarily provides a profit to the seller, but in the end, the seller has been accused of being aimed at increasing profits by causing an excessive price competition, thereby being ignored by the buyer.

The present invention is to solve the above-mentioned problems, by performing simultaneous bidding on the same product, if the user preempts the highest price bid on a specific product immediately determine a successful bidder instead of raising the highest possible bid price of other products step by step In order to provide a product bidding service that ensures rational price formation by determining the final bid price by comparing the bid price of the successful bidder with the actual product value after the end of the bidding.

According to the commodity bidding system for limiting the commodity price of the present invention to the step-up to achieve the above object, the simultaneous individual bidding of the same plurality of commodities, and if the successful bid of a specific commodity occurs, the price of the remaining unsold products In the commodity bidding system that increases by step by step and determines the actual winning price of the successful bidder by the price comparison after the end of the bidding period, the initial value is set to the increase rate that induces the ranking of the individual products, the lowest bidable lowest price, and the incremental price. Means for receiving and storing; When the initial value is set, a) the highest bidding expectation, which increases in incremental units in proportion to the number of highest bids accumulated up to the ranking for each individual product, increases in increments from the possible rankings of previous ranking products. B) means for automatically setting an initial value of the expected possible price corresponding to a small value by comparing the highest possible price, which is the highest value among the total best available bidding expectations, with the highest possible price; means for setting a successful bid product when a highest price bid occurs first in n-ranked products, and increasing and storing the highest-value bid expected value by the increase ratio for every n-ranked goods or more; Means for selecting and storing the highest expected price when the highest bidding price is changed; Means for storing a small value as the expected price by comparing the highest expected price with a ranking possibility for each individual product when the maximum expected price changes; means for incrementally increasing and storing the best price of m + 1 rank by adding the expected price of m rank and the increase rate if the expected price of m rank changes and there is no bid of the highest price of m + 1 rank product; Means for determining a bidder who bids the highest price among the total bids of the individual products as a successful bidder; And a bidding server including means for determining the bidding price of the successful bidder as the highest bidding price, and comparing the successful bidding price with the highest bidding expectation price to determine a small amount as the actual successful bidding price. If this is determined, it is characterized in that to raise the price of other unsuccessful products in stages.

According to a preferred feature of the present invention, a means for providing a product bid list indicating the range of the highest price that can be immediately bid from the lowest bidable price for each individual product by ranking; Means for registering a bid and storing the highest bid as the highest price and dividing the bid into a general bid if the bid price is less than the highest price; And means for receiving the actual successful bid price from the successful bidder and providing the product.

Preferably, the bid server is characterized in that, even if the bidder is bidding the highest price and determined to be a successful bidder of the product, the bidder continues to bid during the bidding period so that other bidders can participate as a subordinated successful bidder.

Furthermore, the bid server may delete the oldest bidding product of the highest ranking every day during the bidding period at the end of the bidding period and increase the ranking of the old bidding products one by one, but selectively add new bidding products of the last ranking. It is characterized by being.

Furthermore, the bid server is characterized in that the initial price setting for the highest possible bid price of the highest priority bidding products by setting the highest bid expected price.

Preferably, the bid server, the function of deleting the bid information of the currently set successful bidder, when the bidder of the bidder is switched to the unsuccessful product without the highest price bid in the n-ranking product; a function of storing the highest price bid expected price by n by an increase ratio for each item of n or more ranks; Reselecting and storing the highest expected price when the highest bidding price decreases; A function of storing a small value as the expected price by comparing the highest expected price with a ranking price for each individual product when the maximum expected price is changed; And a bid canceling means for storing the highest price of the m + 1 rank by adding the expected price of the m rank and the increase rate if the expected price of the m rank item is changed and there is no bid of the highest price of the m + 1 rank product. It further comprises.

Preferably, the product is a plurality of reserved products having different dates or times with respect to the same product, characterized in that for setting the order in the order of date or time.

Furthermore, the product is an online or offline advertisement medium product, and bids a plurality of products on the advertisement medium in order of advertisement date or advertisement time, and an advertiser participates in a bid and receives an individual product and receives a successful bid. It is characterized in that the advertisement of the advertiser is registered and provided to the user at the advertisement time of the advertising medium.

Further, the online advertising media product designates the URL address of the site where the advertisement is registered, and the offline advertising media product designates the location of the display terminal displaying the advertisement.

Meanwhile, according to the commodity bidding method of limiting the commodity price of the present invention to the gradual increase, proceeds to the simultaneous individual bidding of the same plurality of commodities, and if a successful bid of a specific commodity occurs, the price of the remaining unsuccessful commodity is increased step by step, the bid period In the bidding method of the bidding server to determine the actual bid price of the successful bidder after the end of the bidding, (S211) the initial value of the ranking of the individual products, the lowest bidable lowest price and the increase rate that induces the step-by-step increase in price Storing; (S212) If the initial value is set, a) the highest bid expected to increase in units of the increase ratio in proportion to the highest number of bids accumulated up to the ranking for each individual product, the increase ratio unit in the possible price per ranking of the previous ranking products B) automatically setting an initial value of c) an expected available price corresponding to a small value by comparing the highest possible price with the highest expected bidding price with the highest expected bidding price among the total expected highest bidding prices; (S221) providing a product bid list displaying a range of the highest possible price immediately from the lowest bidable price for each individual product by ranking; (S222) if the bid is registered and the highest price is stored as the highest price bid, if less than the highest price input divided by the general bidding; (S231) setting the highest priced bid when the highest priced bid occurs in the n ranked products for the first time, and increasing and storing the highest priced bid expected price by the increase ratio for each of the n or more ranked products; (S232) selecting and storing the highest expected price when the highest bidding price is changed; (S233) if the highest expected price is changed, comparing the highest expected price with a possible price for each individual product and storing a small value as the expected available price; (S234) if the expected price of the m rank is changed and there is no highest price bid of the m + 1 rank product, adding and increasing the expected price of the m rank and the increase rate, increasing and storing the highest price of the m + 1 rank step by step; (S241) determining a bidder who bids the highest price among the total bids of the individual products as the best bidder; (S242) determining the bidding price of the successful bidder as the highest bidding price, and comparing the successful bidding price with the highest bidding price and determining a small amount as the actual successful bidding price; And (S243) receiving the actual successful bid price of the successful bid product and providing the corresponding product, when the successful bid is determined by the occurrence of the highest price bid in the individual product, the price of the other unsuccessful product is gradually increased. .

The commodity bidding system and the commodity bidding method according to the present invention protect the status of the successful bidder by bidding the highest price, and limit the price of the remaining unsuccessful products by stepping up each time a successful bid occurs. Even when the bidding competition is overheated, the rational price is always formed by the step-up, and the actual winning price of the successful bidder is determined based on the rational basis compared to the product value, not the bid price.

Hereinafter, with reference to the accompanying drawings looks at in detail the configuration of a preferred embodiment of the present invention.

<1. System Configuration>

1 shows a configuration of a product bidding system 1 according to the present invention.

The commodity bidding system 1 according to the present invention provides a list of commodities to bidders and connects to a bidding server 2 and a bidding server 2 that incrementally raises the price of the unsuccessful commodity each time a successful bid is generated. It is configured to include a bidder terminal (3) to participate in.

The bidding server 2 according to the present invention provides a list of products for bidders who have access to a homepage, register a bid of a specific product, and determine a successful bidder and a successful bid price when the bidding period ends.

In the present invention, bidding is performed on the same plurality of products at the same time. There is no limit to the type of product. Ten computers can be bid on at the same time, and reservation products with a specified date and time can be bid on. For example, a person with an advertising medium (e.g., a portal site, an advertising URL, or an owner of an offline advertising medium) bids for a date and timed product, and sends the advertiser's ad at that time if the advertiser wins the bid. will be.

However, plural bidding products are premised on the gradual increase in order to prevent an excessive price increase due to bidding due to over competition. In the case of a gradual increase, when one of the plurality of bidding products is bidding at the highest price that the bidder can bid, the winning price is determined to be a rise in the value of the product, and the price of the remaining bidding products is gradually improved.

To this end, a plurality of products are assigned a turn number, and it is assumed that the range of possible price increases can be gradually applied to the lower ranks. For example, product 1 can be increased to 2, product 2 can be increased to 4, and product 3 can be increased to 6. Multiple bidding products start at the same price. When the highest price bid occurs in one of the products, the product may be determined to be popular, thereby increasing the value of the remaining products, thereby raising the price in stages. Of course, since the price increases depending on the ranking, the senior products may be limited by the price increase, but the subordinate products may continue to rise. Therefore, when bidding is started, it is advantageous to bid and preempt the highest price for any commodity since all the individual bidding products start at the same price condition at the beginning, and if a successful bidding product occurs as the bidding period elapses, It is advantageous to win the prize.

In the present invention, the factor that restricts the commodity price to the gradual increase is a) limiting the price to the highest price at the time of bidding, b) limiting other commodities to the gradual increase of price at the time of bidding, and c) limiting the actual winning price by comparing the value of the commodity after the bidding ends. .

Explaining a), a bidder is presented with a minimum bid (hereinafter referred to as "the base price") and an immediate highest bid (hereinafter referred to as "the highest price") for each individual bid. Of course, the highest price is limited by a gradual rise. If the bidder bids the highest price and preempts the bidding product, the bidder is decided. Even if the successful bidder is determined, other bidders may participate in the bid until the end of the bidding period. However, the subordinate bidders reserve in advance in case the successful bidder cancels the successful bid of the product.

B), if a successful bid for one of a plurality of products occurs, the highest price of the other unsuccessful bids is raised. Because the winning bid is determined and the number of remaining winning bids is reduced, the value of the winning bid is increased. Of course, commodity value is limited to escalation.

C) Even if a bidder bids the highest price in the best order and immediately auction occurs, the successful bid price of the successful bidder may not be the bidder's bid. First, the bidder's bid is the maximum and the product value is determined in consideration of the current bid status of other products, and the bid price is determined by comparing the bid and the product value. This is to use the value of the product to limit the winner's actual winning price.

2 illustrates an initial value of a commodity bid table according to an embodiment of the present invention.

First, the administrator sets the initial value. The initial value is the base price 101 corresponding to the lowest price at which the user can participate in the bid and the increase ratio 102 for the step-up. When these two initial values are set, the rest of the initial values are automatically set in the table below. The commodity bid table illustrates ten commodities ranked by date.

All of the basic prices 103 are automatically set to "3" in accordance with the initial value setting of the administrator.

The highest price 104 sets the initial value (3 + 2 = 5) by summing the base price 103 and the increase ratio 102. In practice, the highest price 104 is the sum of the increase ratios 102 due to the increase in the price increase for the subordinated products from the expectable price 112 of the previous ranking. The base price 103 and the highest price 104 are values that bidders are provided on a bid screen (not shown). The bidder may freely input the bid amount in the range of the basic price 103 and the highest price 104. Equation 1 below defines the highest price 104.

Highest price = previous rank expected Available  + Increase

The general bidding 105 and the highest price bidding 106 set an initial value NULL before the start of bidding. If the user's bid is the highest price 104, the user's bid is stored as the value of the highest bidding 106 to set the product as a successful bid product and determine the bidder as a successful bidder. On the other hand, the bid price below the highest price 104 is stored separately by the value of the bidding bid 105.

The actual bid price 107 is a value determined by the price comparison and is a price actually paid by the successful bidder to receive the product. The actual successful bid price 107 is the lower price among the successful bid bidding price 108 and the highest bidding bidding price 109 which are bids of the successful bidder.

Actual winning price = MIN (highest bid, highest bid expected)

Therefore, the actual successful bid price 107 may be lowered by the price comparison to the bidder's bid limit. The lowered case is when the value of the product is low and the highest bidding expectation price 109 is lower than the winning bid price 108. When the number of highest price bids among the previous ranking products of the product is small, the successful bidder may purchase the product below the amount bid by the bidder.

The successful bid price 108 refers to the best bid price, with a maximum amount among the currently bid bids. When the highest bid price 108 is equal to the price of the highest price bid 106, the successful bid state is referred. Equation 3 below defines the highest bid price.

Winning price = the bidder's bid As the maximum price  Best input price

The highest price bid expected value 109 is a value in which the maximum price in real time is increased by an increase ratio that is proportional to the number of successful bids of the subordinate goods including the senior goods whenever a successful bid for the senior goods occurs. That is, it defines the price value rise of a product according to the occurrence of the highest price bid without any price limitation. Since the premise of the present invention extends the price increase to the subordinated products, the generation of the highest price bid 106 in the senior products means the increase in the value of the products due to bidder competition. Therefore, the highest price bid of the subordinated products increases the expected price 109 step by step. Equation 4 below defines the highest bid expectations 109.

Expected Highest Price Bid = Base Price + Number of Highest Price Bids in Current Rank * Increase

The highest expected price 110 is the highest price among the highest priced bidding prices 109 of all products, as shown in Equation 5 below.

Highest Expectation = Overall Highest Price Bid Expectation Value

The possible price per ranking 111 is a value in which a limit is set in advance on the maximum amount that can rise in price during the bid period for each individual product in advance. The ranking price 111 is set in increments by an increase ratio 102 from the ranking price 111 of the first product. The possible price 111 by rank of the first ranked product y-m-d1 sets the highest price bid expected value 109 of the product y-m-d1 as it is. Equation 6 below defines the general formula of the possible price 111 per ranking.

(One) first  Rank Product Rank Available  = Highest bid of the first ranked product

(2) second  By rank of products Available  = Ranking of previous ranking products Available  + Increase

(Best bid expectation <= rank Available )

Preferably, in the present invention, the product of the first rank every day during the bid period may be deleted at the end of the bid. Assuming FIG. 2 as the Today screen, tomorrow "y-m-d1" is deleted. It is also possible to add new products with subordinated items at the same time as deletion. Assuming this, "y-m-d11" is added. In both cases, since the product of "ym-d2" becomes the first ranking product, the highest price bid expected value 109 of "ym-d2" is the initial value of the possible price 111 by ranking according to Equation 6 (1). Is set. On the other hand, every time the initial value is set for each day, the possible price per ranking 111 of the first product may be lower than the initial value of tomorrow to maximize the initial value of today. For example, when there are unsold products in the previous rankings of the new first product, the more the number of unsold products, the lower the initial value of the possible price per ranking 111 per day.

The expected price 112 refers to an appropriate price that can be expected to rise in consideration of the highest price bid expected price 109 and the ranking price 111 of the corresponding product. At this time, the highest expected price 110, which is the maximum value of the highest expected bidding price 109, is used. That is, the possible price per ranking 111 refers to the highest price that can be raised on the day, and this value is compared with the highest expected price 110 to make a smaller value expected price 112. That is, to evaluate the real value of the commodity, the current highest expected price 110 and the maximum possible price per ranking 111 are compared. The expectable price 112 is a value for evaluating the real value of the commodity, and serves as a criterion for determining the highest price 104 of the next rank (see Equation 1). Equation 7 below defines the possible price 112.

Expectation Available  = MIN (highest expectations, by ranking Available )

3 shows an internal structure of a bid server 2 according to an embodiment of the present invention.

Bidding server 2 according to an embodiment of the present invention is the initial value registration means 211 for receiving and storing the initial value from the administrator, the initial value automatic setting means for automatically setting the initial value of the remaining values from the input initial value ( 212), the highest expectation of determining the maximum value as the highest expectation 110 of the expectation increasing means 231 and the expectation 109 that increases the highest bidding expectation 109 step by step due to the highest bidding 106; The maximum price 104 is increased from the expected price determining means 233 and the expected price 112 to determine the expected price 112 by comparing the determining means 232, the highest expected price 110, and the possible prices 111 according to the ranking. The highest price increasing means 234, the successful bidder determining means 241 for determining the successful bidder, and the successful bidder determining means 242 for determining the successful bid price.

Preferably, in addition to the above-described configuration means, the product list providing means 221 for providing a product list at the bidder's request, the bid registration means 222 for registering the bidder's bid, and the successful bid price determined by the price comparison from the successful bidder The successful bidder payment means 243 which receives and authenticates a process, and the successful bidder cancellation means 250 which cancels when a successful bidder gives up a successful bid are comprised.

4 illustrates an internal structure for canceling a successful bid in the successful bid cancellation means 250 of FIG.

The successful bid cancellation means 250 of the bidding server 2 has a function 251 of deleting successful bid information of successful bidders, a function of reducing the highest bidding expected value 109 by reflecting a decrease in the number of the highest bidders 252, and an expectation. The function 253 of reselecting the highest expected value 110 by changing the value 109, the function 254 of re-determining the expected value 112 by changing the highest expected value 110, and the highest price by changing the possible price 112 And a function 255 for re-determining 104.

Detailed functions and operations of the individual components constituting the bidding server 2 of the product bidding system 1 for limiting the product price above step by step will be described through the product bidding method described below.

<2. How to Configure>

The commodity bidding method of limiting commodity prices according to an embodiment of the present invention to a stepwise increase may be preferably realized through the construction of the system 1 described above.

5 is a flowchart illustrating a product bidding method according to an embodiment of the present invention.

The bidding server 2 of the present invention constructs a homepage and provides the bidding service of the present invention to the bidder terminal 3. The bidding service of the present invention can be provided to a member system or a non-member user, and a paid service or a free service can be provided to the user.

The initial value registration means 211 of the bidding server 2 receives the base price 101 and the increase ratio 102 from the manager and stores it in the DB (S211).

When the initial value input is completed, the initial value automatic setting means 212 automatically sets the initial value to the values of the remaining items 103 to 112 in the product bidding table of FIG. 2 (212). The automatic initial values are in accordance with Equations 1 to 7 described above.

When the bidding is started after the initial value is set, the product list providing means 221 provides a bidding page on which a product list is displayed at the request of a bidder accessing the homepage (S221).

The bid registration means 222 registers the bidder of the successful bidder and stores it in the DB (S222). Here, the bidder can search the entire bidding product status in the bidding page, select a specific product, and freely register the bidding amount within the range of the basic price 103 or more and the maximum price 104 or less. In addition, the bid registration unit 222 may be stored as the value of the highest bid (106) when bidding the highest price 104, and is stored separately in the general bidding 105, when the bid price is less than the maximum (104). In the general bidding 105, no incremental price increase occurs. The bidder who inputs the highest price 104 for the unsuccessful product is immediately selected as a successful bidder and pays the successful bid price determined by the price comparison after the end of the bidding period to purchase the product. A bidder who bids on a successful bid product reserves as a subordinate winner.

When the highest price bid 106 occurs, the expectation increases means 231, the highest price bid expected value 109 proportional to the number of highest price bids and the increase ratio 102 using Equation 4 for the products below the rank of the product. After stepped up to store in the DB (S231).

If the expected price is changed, the highest expected price determining unit 232 determines the maximum value of the total expected price 109 as the highest expected price 115 and stores it in the DB (S232).

When the highest expected price 115 is changed, the expected possible price determining means 233 compares the highest expected price 115 with the ranked possible prices 111 and determines a small value as the expected possible value 112 and stores it in the DB ( S233).

When the expectable price 112 changes, the highest price increasing means 234 sums the predictable price 112 and the increase ratio 102 to determine the highest price 104 of the unsuccessful bid undecided product and stores it in the DB. The reason for excluding the winning bid product is to protect the successful bidder who has already occupied the highest price 104 by excluding an increase in the highest price 104.

The successful bidder determining unit 241 determines the bidder who bids the maximum amount first among the bidders who participated in the bidding. For example, a successful bidder is the person who registered the highest price 104 first, and if there is no bidder of the highest price 104, he / she is the first person who bids the maximum amount among those who have made the general bidding 105.

The successful bidder determining means 242 stores the bidder's bid as the value of the successful bid highest price 108, and determines a small amount of the successful bid highest price 108 and the highest bid price 109 as the actual successful bid price 107. Therefore, the successful bidder may be determined to win the lower price as the number of highest bids among the products of the previous ranking is limited to the highest bid 108 that he bids.

On the other hand, the successful bidder determining means 241 and the successful bidder determining means 242 preferably calculates the successful bidder and the successful bid price whenever a bidder's bidding occurs as described above, but can also be performed after the bidding period ends.

Thereafter, when the bidding period of the product ends, the successful bid price settlement means 243 receives the actual successful bid price 107 from the successful bidder and provides the product.

Figure 6 illustrates the sequence of a successful bid cancellation process according to an embodiment of the present invention.

The successful cancellation process reduces the price that has been increased step by step while following the processing procedure of the highest price bid described above.

In the present invention, the bidder can cancel the bidding, and in the case of the successful bidder who is determined by bidding the highest price 104, the bidding cancellation is the successful bid cancellation. When a successful bidder cancels a successful bid, the subordinate bidder who bids the same amount is reselected as a successful bidder. If the highest price 104 bidder does not exist due to cancellation of the successful bidder, the price is reduced step by step in the following order.

The successful bid cancellation means 251 deletes the successful bidder information of the current successful bidder from the DB (S251).

As a result of the cancellation of a successful bid, the number of successful bids for subordinated products including canceled products is reduced by one. Accordingly, the highest price bid expected value 109 is reduced by the increase ratio 102 for the canceled goods and the subordinated goods (S252).

As the expectation decreases, the highest expected influence 110 is reselected (S253). When the bid of the product with which the successful bid is canceled is the same as the highest expected price 110, the highest expected price 110 decreases by an increase ratio 102.

According to the change in the highest expected price 110, the smallest amount is reset to the expected price 112 by comparing the highest expected price 110 with the possible price 111 according to the ranking (S254).

In accordance with the change of the expectable price 112, the increase price 102 is added to the expectable price 112 to set the highest price 104 of the subordinated product (S255).

<3. Screen example>

7 to 10 illustrate a product bid table according to the bidding and successful bid cancellation according to an embodiment of the present invention.

For convenience of explanation, in the following description, the bidding product is an advertising media product (online or offline advertising media), and the bidding product is bidding with different dates for the same time, and the advertiser becomes a bidder and receives the successful bidding media. You should be able to export your own advertising. In addition, it is assumed that the highest priority advertisement product is deleted at the end of the auction period every day. For example, a broadcaster bids for a daily advertising media product to be sent just before the 9 o'clock news.

In FIG. 2, when the administrator inputs the basic price 101 and the increase ratio 102, initial values are automatically set in the remaining items 103 to 112 of the product bidding table. It is assumed that after the initial value is set in FIG. 2, bidding is started to generate the events of FIGS. 7 to 10 below.

As shown in FIG. 7, the bidder bids “5” corresponding to the highest price 104 on the “d8” day. The bidder is determined as a successful bidder at the same time as the bidding, and the product is converted into a successful bidder product.

Since the highest price bid has occurred, the bidding server 2 gradually increases the highest price expected bid price 109 from "3" to "5" by the increase ratio 102 using "Equation 4" for the products of "d8" and subsequent rankings. To increase (S231).

As the expectation 109 changes, the highest expectation 110 also rises stepwise from "3" to "5" by Equation 5 (S232).

Expectable price 112 is changed according to Equation 7 by the change in the highest expected price 110. As a result, the expected availability 112 of the ranking after "d3" has risen step by step (S233).

According to the change in the expectable price 112, the highest price 104 of the rank after "d4" is increased by the increase ratio 102 by using Equation 1 (S234). However, since "d8" is a successful bidding state, the maximum price 104 is not increased.

Subsequently, the highest price 104 of "d3" is determined as a successful bidder (S241), and the highest bidding price 108 of "7" is determined, and the highest successful bid price 108 and the highest bidding expectation value are calculated using Equation 2 After comparing 109, a small value "5" is determined as the actual successful bid price 107 and stored (S242). That is, when the highest price bid 106 does not occur in the ranking before "d3" until the end of the bidding period, the successful bidder of "d3" pays "5", which is the actual successful bid price 107, even though the bid is "7". You can buy it.

Thereafter, as shown in FIG. 9, it is assumed that a bidder enters a bid of “9”, which is the highest price 104, in a “d5” ranking product. Of course, the bidder is determined as the successful bidder because the highest bidding 106.

Since the highest price bid has occurred, the bid server 2 increases the highest price bid expected value 109 by the increase ratio 102 by using Equation 4 for the product of " d5 " "d5" to "d7" increases to "7", and from "d8" to "9" (S231).

As the expectation 109 changes, the highest expectation 110 also rises step by step from "7" to "9" by Equation 5 (S232).

The expectable price 112 is changed by Equation 7 due to the change in the highest expected price 110. As a result, all of the possible prices 112 in the ranking after "d4" have risen step by step (S233).

The change in the expectable price 112 raises the maximum price 104 of “d5” to “d10” step by step by the increase ratio 102 according to Equation 1 (S234). However, since "d5" and "d8" are already a successful bidding state, the highest price 104 is not raised to protect the successful bidder.

Subsequently, the highest bid 104 of "d5" is determined as a successful bidder (S241), and the highest bid 108 is determined as "9", and the highest bid 108 and the highest bid expectations are calculated using Equation (2). 109 is compared to determine and store a small value of "7" as the actual winning bid value 107 (S242).

At this time, assuming that the highest price successful bid 106 occurs in the ranking before "d3", the actual successful bid price 107 of "d3" rises to "7" bid by the successful bidder at "5". Also, "d5" also raises the actual successful bidder 107 from "7" to "9" in which the successful bidder bids. Of course, the actual successful bidder 107 raises the maximum bid price 108 that the successful bidder bids by the equation (2) to the limit.

Thereafter, as shown in FIG. 10, when the successful bidder who has been successful at the highest price 104 cancels the bid and there is no one of the successful bidders having the highest priority 104, the price reduction occurs step by step. The goods of the rank "d8" are reduced from the existing successful bid product to the state of the unsold product.

Since the auction cancellation has occurred, the bidding server 2 reduces the highest bid expected price 109 by the increase ratio 102 by using Equation 4 for the product of "d8" and the subsequent ranking. "d8" to "d10" is reduced from the existing "9" to "7" (S252).

As the expectation 109 changes, the highest expectation 110 decreases stepwise from "9" to "7" by Equation 5 (S253).

Expectable price 112 is changed according to Equation 7 by the change in the highest expected price 110. As a result, all of the expectable prices 112 of the ranking after "d4" are reduced step by step to "7" (S254).

The highest price 104 of "d5" to "d10" is calculated using Equation 1 according to the expectable price 112 variation (S255). At this time, since "d5" is a successful bid product, except for recalculation of the highest price 104, "d8" rises from "5" which is the existing highest price 104 to "9". Because the highest price bid of 106 and d5 occurs after the conversion to the successful bidding product, and the winning bid is canceled, the successful bidding is canceled. do.

Subsequently, there is no one in determining the highest bidder 104 of bid " d8 " as a successful bidder (241), and there is no bid and the actual successful bidder 107 is stored as 0 (S242).

As described above, an embodiment of a commodity bidding system and a commodity bidding method for limiting commodity prices according to the present invention to increase in stages is configured. Although the present invention has been described by way of limited embodiments and drawings, the present invention is not limited thereto, and the technical spirit of the present invention and the claims to be described below by those skilled in the art to which the present invention pertains. Of course, various modifications and variations are possible within the scope of equivalents.

The following drawings, which are attached to this specification, illustrate preferred embodiments of the present invention, and together with the detailed description of the present invention serve to further understand the technical spirit of the present invention. It should not be construed as limited to.

1 is a block diagram of a product bidding system according to the present invention.

Figure 2 is an illustration of a product bid table in accordance with an embodiment of the present invention.

3 is an internal structure diagram of a bid server according to an embodiment of the present invention.

4 is an internal structure diagram for canceling a successful bid in a bidding server according to an exemplary embodiment of the present invention.

5 is a flow chart of a product bidding method according to an embodiment of the present invention.

6 is a flow chart of a successful bid cancellation process according to an embodiment of the present invention.

7 to 10 are exemplary diagrams of a product bidding table when a bidding and a successful bid cancellation occur according to an embodiment of the present invention.

Claims (14)

In the commodity bidding system which performs simultaneous individual bidding of the same plurality of products, and if a successful bid of a specific product occurs, increases the price of the remaining unsuccessful products step by step, and determines the actual successful bid price of the successful bidder by price comparison after the end of the bidding period. Means for setting and storing, as an initial value, a ranking of individual products, a lowest bidable lowest price, and an increase ratio leading to a stepwise increase in price; When the initial value is set, a) the highest bidding expectation, which increases in incremental units in proportion to the number of highest bids accumulated up to the ranking for each individual product, increases in increments from the possible rankings of previous ranking products. B) means for automatically setting an initial value of the expected possible price corresponding to a small value by comparing the highest possible price, which is the highest value among the total best available bidding expectations, with the highest possible price; means for setting a successful bid product when the highest price bid occurs first in n-ranked products, and increasing and storing the highest-value bid expected price by the increase ratio for each of the n-ranked products or more; Means for selecting and storing the highest expected price when the highest bidding price is changed; Means for storing a small value as the expected price by comparing the highest expected price with a ranking possibility for each individual product when the maximum expected price changes; means for incrementally increasing and storing the best price of m + 1 rank by adding the expected price of m rank and the increase rate if the expected price of m rank changes and there is no bid of the highest price of m + 1 rank product; Means for determining a bidder who bids the highest price among the total bids of the individual products as a successful bidder; And Means for determining the bidding price of the successful bidder as the highest bidding price, and comparing the successful bidding price with the highest bidding expected price to determine a small amount as the actual successful bidding price If a successful bid is determined by the occurrence of the highest price bid in the individual products with a bidding server including a, the product bidding system, characterized in that to raise the price of the other unsuccessful bidding step by step. The method of claim 1, Means for providing a commodity bid list indicating a range of the highest bidable price immediately from the lowest bidable price per individual commodity for each ranking; Means for registering a bid and storing the highest bid as the highest price and dividing the bid into a general bid if the bid price is less than the highest price; And Means for receiving the actual winning price from the successful bidder and providing the product Product bidding system further comprising a. The method of claim 1, The bid server, Even if the bidder is determined to be the successful bidder by bidding the highest price, the bidding system, characterized in that the other bidders continue to bid during the bidding period so that other bidders can participate as a subordinate bidder. The method of claim 1, The bid server, Every day during the bidding period, the old bidding product of the highest priority is deleted at the end of the bidding period, and the ranking of the old old bidding products is increased by one, but the new bidding product of the last ranking can be selectively added. system. The method according to claim 1 or 4, The bid server, A commodity bidding system, characterized in that, when the initial value is set, the highest possible bidding price of the highest ranking bidding product is set as an expected bidding price. The method of claim 1, The bid server, When the bidder of the bidder converts the winning bid product of the n rank into the unsold bid product without the highest price bid, Deleting bid information of a currently set successful bidder; a function of storing the highest price bid expected price by n by an increase ratio for each item of n or more ranks; Reselecting and storing the highest expected price when the highest bidding price decreases; A function of storing a small value as the expected price by comparing the highest expected price with a ranking price for each individual product when the maximum expected price is changed; And If the expected price of the m-ranked product is changed and there is no bid for the highest price of the m + 1-ranked product, the function of storing the highest price of the m + 1-ranked position by adding the expected price of the m-ranked product and the increase rate. The product bidding system further comprises a bid cancellation means for performing. The method of claim 1, The product, And a plurality of reserved products having different dates or times for the same product, wherein the ranking is set in the order of date or time. The method according to claim 1 or 7, The product, As an online or offline advertising media product, a bidding of a plurality of products is performed on the advertising media in order of an advertisement date or an advertisement time, and an advertiser participates in the auction and wins an individual product, and the advertiser at the advertisement time of the successful advertising media Product bidding system, characterized in that to provide the user by registering the advertisement. The method of claim 8, And the online advertisement medium product specifies a URL address of a site where an advertisement is registered, and the offline advertisement medium product specifies a location of a display terminal displaying an advertisement. The bidding method of a bidding server which performs simultaneous individual bidding of the same plurality of products, increases the price of the remaining unsuccessful products step by step when a specific product is successful, and determines the actual successful bid price of the successful bidder by price comparison after the end of the bidding period. To (S211) setting and storing the ranking of the individual products, the lowest bidable lowest price, and an increase ratio for inducing a stepwise increase in price as an initial value; (S212) If the initial value is set, a) the highest bid expected to increase in units of the increase ratio in proportion to the highest number of bids accumulated up to the ranking for each individual product, the increase ratio unit in the possible price per ranking of the previous ranking products B) automatically setting an initial value of c) an expected available price corresponding to a small value by comparing the highest possible price with the highest expected bidding price with the highest expected bidding price among the total expected highest bidding prices; (S221) providing a product bid list displaying a range of the highest possible price immediately from the lowest bidable price for each individual product by ranking; (S222) if the bid is registered and the highest price is stored as the highest price bid, if less than the highest price input divided by the general bidding; (S231) setting the highest priced bid if the highest priced bid occurs in the n ranked products for the first time, and increasing and storing the highest expected bid price by the increase ratio for each of the n or more ranked products; (S232) selecting and storing the highest expected price when the highest bidding price is changed; (S233) if the highest expected price is changed, comparing the highest expected price with a possible price for each individual product and storing a small value as the expected available price; (S234) if the expected price of the m rank is changed and there is no highest price bid of the m + 1 rank product, adding and increasing the expected price of the m rank and the increase rate, increasing and storing the highest price of the m + 1 rank step by step; (S241) determining a bidder who bids the highest price among the total bids of the individual products as the best bidder; (S242) determining the bidding price of the successful bidder as the highest bidding price, and comparing the successful bidding price with the highest bidding price and determining a small amount as the actual successful bidding price; And (S243) receiving the actual successful bid price of the successful bid product and providing the corresponding product If a successful bid is determined by the occurrence of the highest price bid in the individual products, including, the product bidding method characterized in that to increase the price of other unsuccessful bidding step by step. The method of claim 10, When the bidder of the bidder converts the winning bid product of the n rank into the unsold bid product without the highest price bid, (S251) deleting the bid information of the currently set successful bidder; (S252) decreasing and storing the highest price bid expected value by the increase ratio for each item of n or more ranks; (S253) reselecting and storing the highest expected price when the highest bidding price decreases and changes; (S254) if the highest expected price is changed, comparing the highest expected price with a possible price for each individual product and storing a small value as the expected available price; And (S255) if the expected price of the m-ranked product is changed and there is no bid of the highest price of the m + 1-ranked product, adding the expected price of the m-ranked product and the increase rate and storing the highest price of the m + 1 rank Commodity bidding method characterized in that it further comprises. The method of claim 10, The product, And a plurality of reserved products having different dates or times for the same product, wherein the ranking is set in the order of date or time. The method according to claim 12 or 13, The product, As an online or offline advertising media product, a bidding of a plurality of products is performed on the advertising media in order of an advertisement date or an advertisement time, and an advertiser participates in the auction and wins an individual product, and the advertiser at the advertisement time of the successful advertising media The product bidding method, characterized in that to provide the user by registering the advertisement. The method of claim 13, And the online advertisement medium product specifies a URL address of a site where an advertisement is registered, and the offline advertisement medium product specifies a location of a display terminal displaying an advertisement.

Images