KR20020078473A - Auction processing system and method with priority assigned to offerings - Google Patents

Abstract

PURPOSE: An auction processing system and method using a priority bid tender is provided to increase a possibility of a trade contract by making an auction participator grant a series of purchase priority with respect to a plurality of real estates for sale and suggest a bidding price with respect to each real estate properly. CONSTITUTION: A member information DB(60a) stores information related to a member or a client registered in an auction processing system(100). A selling article information DB(60b) stores information registered by each sale desirer and information with respect to the minimum bidding price, a bid tender unit, an auction valid term, a price adjustment term, and a price adjustment range. A bid tender price/order information DB(60c) stores a bid tender price suggested by a plurality of sale desirers and information related to a purchase priority. A transaction result information DB(60d) stores transaction contract information with respect to each article for sale. A bid tender price comparison unit(20) compares bid tender prices suggested to each selling article therewith interactively, suggests a higher bid tender price to the upper price deciding unit(30), and suggests a lower bid tender price to the lower price deciding unit(40). A priority order adjusting unit(50) adjusts a priority order granted by a purchase desirer who suggested the lower price to each article for sale. An auction and price control unit(10) monitors information an auction valid term, a price adjustment term, a price adjustment range set to an article for sale by each sale desirer continuously. If a price adjustment term is passed, the lowest bidding price is adjusted at a lower price and information of an article for sale is updated in the DB(60b).

Description

Auction processing system and method using priority bidding {AUCTION PROCESSING SYSTEM AND METHOD WITH PRIORITY ASSIGNED TO OFFERINGS}

The present invention relates to an auction processing system using a network including the Internet. More particularly, the present invention relates to a system and method for increasing the possibility of concluding a sale by giving a series of purchase priorities to a plurality of real estate items.

Recently, as the number of Internet users exploded, electronic commerce and various application services using the Internet have been rapidly developed. An example of such electronic commerce is an auction processing system. At present, an auction processing system using a communication network such as the Internet can be roughly classified into a seller-oriented auction method and a buyer-based auction method, which are the most favorable conditions by competitively participating a plurality of buyers (or sellers) in the auction. It is a way to enter into a contract with a prospective seller (or buyer) who proposes an offer. In detail, the seller-based auction method is to determine a buyer who bids the highest price for a specific sale within the auction validity period set by the seller as a final bidder, and the buyer-based auction method is widely used as a so-called "reverse auction" method. For example, if a buyer wants to present a desired item, the holder of the item (ie, seller) wants to bid (receives) the lowest price.

However, most of these auctions are made on fluids, and for those with real estate prices ranging from tens of thousands to hundreds of millions of dollars, significant penalties are imposed upon termination of the contract, resulting in a very limited selection of properties. It is difficult to access easily. In other words, when auctioning or leasing expensive real estate for sale, the purchaser usually selects only one item due to the burden of penalty, etc., thereby limiting the purchaser's right to sell. In addition, as the buyer's right to sell is restricted, there is a possibility that the seller may fail to dispose of the property within a desired date.

Therefore, when auctioning or leasing real estate using the Internet, buyers are encouraged to select multiple types of items they want to buy and offer a bid price for each item to increase the choice of participating in the auction. There is a need for a trading method that allows the seller to sell his / her own sale at a higher price within a desired period, which is advantageous to both the seller and the buyer and increases the possibility of closing the sale.

Accordingly, it is an object of the present invention to provide a system and method that can increase the likelihood of concluding a sale by allowing an auction participant to prioritize a series of purchase priorities for a plurality of real estate listings and to properly present bid prices for each listing. To provide.

Another object of the present invention is to conclude the sale by setting a minimum bid price, auction expiration date, a price adjustment deadline and a price adjustment range for a sale in advance, and lowering the price if an appropriate bid price is not presented within these deadlines. It is to provide a system and method that can increase the possibility of.

1 is a schematic block diagram of an auction processing system using priority bidding according to the present invention.

2 to 4 are flowcharts for explaining the operation of the auction processing system according to the present invention, respectively.

5-7 are each an example diagram used to explain the auction processing process for each item.

8 is a flow chart illustrating a modified escrow system that may be used in the auction processing system of the present invention.

It is a schematic diagram explaining the concept of the escrow system of this invention.

<Explanation of symbols for the main parts of the drawings>

10: Auction and Price Control

20: bid price comparison

30: top pricing unit

40: lower pricing unit

50: priority adjustment unit

100: Auction Processing System

In order to achieve the above object, according to the present invention, there is provided a method for operating an auction processing system having a plurality of items and a memory for storing the minimum bid price corresponding to each of the items. Storing the bid price information and the series of purchase priority information presented in the plurality of items and the bid price information and the series of purchase priority information presented in the plurality of items by a current second purchaser in the memory ( N = 1 to P, N and P are positive integers), and (b) a bid price to which the previous bidder stored in the memory has given a first buy priority to the M-th item as a previous bid price; Setting, as a current bid price, a bid price to which the current bidding applicant has given a first buy priority to the M-th item (M = 1 to Q, M and Q are positive integers), (c) comparing the previous bid price and the current bid price for the Mth item to determine an upper bid price and a lower bid price, and (d) the upper bid price; Updating a bid price as a previous bid price for the Mth item, and storing the updated bid price in the memory for comparison with a bid price suggested by a next bidder, (e) the lower bid price Is excluded from the auction for the M-th item, and the first purchase priority is the (M + 1) th item to which the previous or current bidder who presented the lower bid price has given a second buy priority. And storing the adjusted buy priority information in the memory.

In addition, the memory stores the information of the minimum bid price (SM), the auction expiration date (ST), the price adjustment deadline (AD) and the price adjustment range (AR) registered in advance by each seller wishing to sell, the auction The expiration date information indicates the expiration date for the auction.

In addition, according to the present invention, if the buyer wishing to buy any item does not appear within the adjustment deadline AD within the validity period of the auction, the minimum bid price for the sale may be adjusted by the price adjustment range.

Hereinafter, with reference to the accompanying drawings, preferred embodiments of the present invention will be described in detail.

1 is a schematic block diagram of an auction processing system according to the present invention. In the present invention, the real estate will be described as the object of the auction, but the present invention is not limited thereto.

As shown in FIG. 1, the auction processing system 100 of the present invention, which is connected to a communication network such as a network including the Internet and supports an auction method, includes an auction and a price control unit 10, a bid price comparison unit 20, It consists of the upper price determination part 30, the lower price determination part 40, the priority adjustment part 50, and the database part 60 which has several database (DB) 60a-60d.

In the database unit 60, the member information DB 60a stores information related to members or clients (sellers and buyers) who have subscribed to the auction processing system 100 of the present invention through a normal membership procedure. . For sale information DB (60b) is the information registered by each seller, that is, information such as building type, land area, number of floors, number of floors, etc., the minimum bid price (SM), bid unit (SB) for each sale ), Auction expiration date (ST), price adjustment deadline (AD) and price adjustment range (AR). The bidding unit SB represents a unit of a bidding price that is proposed for an arbitrary item, and may be determined, for example, in million or ten million won units. The auction expiration date (ST) information indicates the deadline for the auction to be valid for the item, and the price adjustment deadline (AD) information is the buyer who wants to buy the item during the price adjustment period (AD) within the auction expiration date (ST). If the does not appear, it indicates the deadline to re-adjust the minimum bid price (SM), and the price adjustment range (AR) information indicates the extent to which the minimum bid price is re-adjusted when no buyer wishes to appear in each AD. Indicates. The bid price / ranking information DB 60c stores information related to the bid price presented to the at least one item by the plurality of buyers, and the purchase priority given to each item. The trading result information DB 60d stores trading conclusion information for each item, for example, information of the closing sale item, the final successful bid price, and the successful bidder.

The bid price comparison unit 20 of the present invention compares the bid prices sequentially presented for each item stored in the bid price / ranking information DB 60c with each other, and supplies a higher bid price to the upper price determiner 30. The low bidding price is then supplied to the lower price determining unit 40.

The higher price determination unit 30 determines the higher bid price supplied from the bid price comparison unit 20 as the higher price, and subsequently compares with the bid price (if present) suggested by another buyer for the item. For comparison, the bid price / rank information DB 60c is temporarily stored.

The lower price determining unit 40 determines the lower bid price supplied from the bid price comparing unit 20 as the lower price, and supplies the priority adjusting unit 50 with information on the purchaser who presented the lower price.

The priority adjustment unit 50 adjusts the priority (if present) given to each item by the purchaser who presented the lower price. That is, the priority adjustment unit 50 raises the purchase priority, which is initially entered into the system 100 of the present invention, by the purchaser who failed to present the highest price in the sale auction by one step, that is, the first purchase. Discarding the priority information and raising the second purchase priority to the first purchase priority, and storing the information of the increased purchase priority in the bid price / ranking information DB 60c, the newly adjusted first purchase The presenting price of the corresponding buyer wishing to sell the priority items is subjected to the auction process described above (that is, the bid price comparison unit 20).

On the other hand, the auction and price control unit 10, the auction expiration date (ST), the price adjustment deadline (AD) and the price adjustment range (AR) stored in the item information DB (60b) set for each item by each seller Information is continuously monitored, and if the price adjustment deadline for the sale has passed, the minimum bid price of the sale is lowered by the price adjustment range, and the sale price information DB 60b is updated with the adjusted minimum bid price and the bid price is adjusted. The bid price comparison unit 20 is controlled to perform the comparison. The price adjustment deadline (AD) may be set multiple times by the seller's wish to sell the item. On the other hand, when the auction expiration date for any item has ended, the auction and price control unit 10 determines the current higher price (if present) for the item as the final successful bid price, the final successful bid price, successful bidder, etc. Information is stored in the sales result DB (60d), the auction process for the property is terminated, and if there is no buyer to buy within the auction idle period, it is notified that the bid will be made.

Hereinafter, the operation of the auction processing system 100 according to the present invention will be described in detail with reference to FIGS. 1 to 6. 2 to 4 are flowcharts for explaining the operation of the auction processing system according to the present invention, respectively, and FIGS. 5 and 6 are exemplary diagrams used to explain the auction processing process for each item respectively.

In step S20 of FIG. 2, each seller wishes to connect to the system of the present invention through a communication network including the Internet and the like in a usual manner, and to join as a member (client), as shown in FIG. 5 (a). As described above, input the real estate for sale 1 to 5 and the minimum bid price SM corresponding thereto, for example, 500 won, 600 won, 500 won, 400 won and 700 won. In addition, each seller wants to input information such as a bid unit (SB), the auction expiration date (ST), a price adjustment deadline (AD), a price adjustment range (AR) for their sale. These input information is stored in the property information DB 60b of the database part 60 (step S21).

In step S22, when the client connects to the system 100 of the present invention through a communication network such as the Internet in a normal manner, the control process extracts the property information registered by each seller from the property information DB 60b and the corresponding client. To provide. Based on the information on the sale, the buyer wishing to participate in the auction participates in the auction for the property by assigning a purchase priority to the item to be purchased and presenting a corresponding bid price.

According to the present invention, the auction processing process for each item is processed sequentially with respect to the bid price to which each item is given a first purchase priority.

In step S23, the control process determines whether the auction expiration date ST for any property has passed, and if so, the process of the present invention ends. On the other hand, if the auction expiration date ST has not elapsed, the control process determines whether there is an initial purchaser, i.e., the (i-1) th purchaser, for the item (for example, item 2) in step S24. To judge. Where i ranges from 1 to N. If there is the (i-1) th buyer desired, the control process proceeds to step S28 of FIG. 3 via tap A. FIG. As shown in FIG. 5 (b), the (i-1) th purchase prospector A sequentially gives the purchase priority to the series of items 2, 3, 1, 4 and 5 at time t1. We assume that the bid price for each item is 610 won, 530 won, 540 won, 410 won and 700 won. The bid price and the buy priority information for each item presented by the purchase applicant A are stored in the bid price / rank information DB 60c of the database unit 60.

In step S28 of FIG. 3, the control process first applies the bid price B _i-1 (that is, 610 won) that is presented to the item 2 to which the (i-1) th bidder A has given the first purchase priority. Set as the previous bid price B _P. Next, at time t2, the purchaser B wants to sequentially give priority to the number of items 3, 4, 3, 5, and 2 as shown in FIG. 5 (b). Suppose that the bid price for is suggested as 510 won, 430 won, 550 won, 710 won and 620 won. In this case, there is no change in the process since there is no identical item to which the first number of sheets is given priority.

Next, the control process judges whether there is an i-th purchase hope for the item 2 in step S29, and if so, proceeds to step S30. Prior to the description, the i-th purchaser (for example, purchaser C) is shown in FIG. 5B with respect to the series of items 2, 4, 2, 3 and 1 at time t3. It is assumed that priority is given to the purchase and bid prices for each item are 620, 450, 650, 530 and 520. Similarly, the bid price and the buy priority information for each item presented by the buy candidate C are stored in the bid price / rank information DB 60c of the database unit 60.

In step S30, the control process sets the bid price B _i (i.e., 620 won) that is presented to the item 2 to which the i-th purchaser C has given the first purchase priority as the current bid price B _C for the item 2. Next, the control process compares the previous bid price B _P (i.e., 610 won) and the current bid price B _C (i.e., 620 won) for the item 2 using the bid price comparison unit 20 to compare the upper bid price. (Step S31). Since Buyer C has offered a higher bid price (ie, $ 620) for Sale 2, the control process gives Buyer C a buy priority and transfers the current bid price B _C (ie, $ 620) to the previous bid price B. Update to _P and store in the bid price / ranking information DB 60c (step S32). The upper bid price (i.e., 620 won) to which the purchase priority is given is set as the candidate bid price for subsequent auctions.

On the other hand, the control process eliminates the purchase prospector A, who presented the lower bid price (that is, 610 won) in step S31, from the auction of the seller 2, and participates in the auction for the sale to which the purchase prospector A has given the second purchase priority. do. This will be described in detail with reference to FIGS. 4 to 6.

Referring back to FIG. 2, if there is no (i-1) th purchase hope for the item in step S24, the control process uses the auction and price control unit 10 and the sale information DB 60b of FIG. Then, it is determined whether the first price adjustment deadline AD1 registered in advance by the seller of selling item 2 has passed (step S25). If the price adjustment deadline AD1 has elapsed in step S25, the control process uses the auction and price control unit 10 to set the initial minimum bid price (ie, 600 won) for sale 2 in the price adjustment range AR in step S26. (Eg, 50 won) and down, and the auction processing as described above is performed again with the lowest adjusted bid price (eg, 550 won). The minimum bid price adjusted downward for the sale is stored in the sale information DB 60b (step S27). On the other hand, when the first price adjustment deadline AD1 has not passed in step S25, the control process returns to step S24 to repeat the above-described process.

On the other hand, in step S29 of FIG. 3, when there is no i-th buyer for sale 2, the control process uses the auction and price control unit 10 and the sale information DB 60b of FIG. It is determined whether the auction expiration date ST has passed (step S34). If the auction expiration date ST has elapsed in step S34, the previous bid price B _P (i.e., 620 won) is determined as the final successful bid price for sale 2 (step S35), and the process ends. On the other hand, if the auction expiration date ST has not elapsed in step S34, the control process returns to step S29 to repeat the above-described process.

On the other hand, in step S31 of FIG. 3, when the previous bid price B _P for the item 2 is higher than the current bid price B _C , that is, the bidding information of the dropped buyer wish A, the control process passes through the tab B in FIG. 4. Proceed to step S36.

FIG. 4 is a diagram for explaining a process of allowing a buyer who has dropped out by presenting a lower bid price to an arbitrary item to raise the first purchase priority for the item to which the second purchase priority is assigned to participate in the auction. It is a flow chart.

In step S36, the control process of the present invention determines whether there is a sale to which the second purchase priority is given to the purchaser A who has dropped out of the auction of the sale 2, and uses the priority adjustment unit 50 of FIG. As shown in the following, by raising the purchase number 3 of the second purchase priority registered in advance by the purchaser A to the first purchase priority (step S37), the purchaser A is rescheduled to the first purchase priority. The candidate is set to participate in the auction, and the bid price B (ie, 530 won) for the item 3 is updated as the current bid price B _C (step S38). The bid price and rank information for the item 3 that has been raised to the first buy priority are stored in the bid price / rank information DB 60c.

In this case, since the purchase candidate B also gave the first purchase priority to the item 3 which has been raised to the first purchase priority in the purchase party A, the control process loops from the steps S28 to S33 described above with respect to the property 3. Will be performed. As a result, the purchaser B is eliminated from the auction for the item 3, and as shown in FIG. 6, the item 4 of the second purchase priority registered in advance by the purchaser B is raised to the first purchase priority. The bid price and rank information for the item 4 which has been raised to the first buy priority are stored in the bid price / rank information DB 60c.

As described above, the system of the present invention sequentially compares the bid prices that give the first purchase priority to each item, gives the purchase priority to the buyer who presented the higher price, and gives the purchase priority to the buyer. Wait as a candidate until another bidder appears within the auction's expiration date for the item.

In detail, in step S24, the control process of the present invention judges whether there is an initial purchase desire for the item 3, that is, the (i-1) th purchase desire. If there is the (i-1) th buyer, the control process proceeds to step S28 of FIG. 3 via the tap A and presents to the item 3 to which the (i-1) th purchaser B has given the first purchase priority. Set one bid price B _i-1 (ie, 510 won) as the previous bid price B _P for sale 3. Next, the control process judges that there exists an i-th purchaser (i.e., purchaser A) for the item 3 in step S29, and the current bid price suggested by the purchaser A through steps S30 to S32 described above. (Ie, 530 won) is determined as the upper price and updated as the previous bid price B _P for sale 3. As a result, as shown in Fig. 6, the purchaser B is eliminated from the auction for the item 3, and the item 4 of the second purchase priority registered in advance by the purchaser B is adjusted to the first purchase priority. . The bid price and rank information for the item 4 which has been raised to the first buy priority are stored in the bid price / rank information DB 60c.

Next, at time t4, the purchaser D wants to sequentially give priority to the series of items 3, 1, 5, 2 and 4, as shown in FIG. 5 (b). Suppose the bid prices for are given at 520, 510, 720, 650 and 420 won. Similarly, the bid price and the buy priority information for each item presented by the purchase applicant D are stored in the bid price / rank information DB 60c of the database unit 60. In this case, since the purchase priority is given to the purchaser A with respect to the item 3 to which the purchaser D has given the first very priority, the control process is shown in FIG. 6 through the loop of steps S28 to S33 described above. As such, the buy priority will fluctuate. In other words, the purchase candidate D has a first buying priority with respect to the selling one.

According to the present invention, if the bid price currently entered for a particular sale is equal to or less than the bid price previously entered, the purchaser's information is readjusted via tab B, and the bidding right for the sale is made. You can not assign or change the buy priority automatically.

Next, at time t5, as shown in Fig. 5 (b), the purchase candidate E sequentially gives the purchase priority to a series of items 2, 5, 3, 1 and 4, and each item. Suppose that the bid price for is suggested as 630 won, 730 won, 510 won, 530 won and 440 won. Similarly, the bid price and the buy priority information for each item presented by the purchaser E are stored in the bid price / rank information DB 60c of the database unit 60.

In step S29, the control process of the present invention determines whether there is an additional (i + 1) th purchase prospect for item 2, and performs steps S30 to S33 described above. That is, the control process determines the bid price B _{i + 1} (i.e., 630 won) that is presented in the item 2 to which the (i + 1) th buyer E has given the first purchase priority in step S30, and the current bid price for the item 2; It sets to B _C , and determines the higher bid price in comparison with the previous bid price suggested by the purchaser C (i.e., 620 won) (step S31). The control process gives a buy priority to the buyer who wishes to offer a higher bid price (i.e., $ 630) for item 2, and updates the current bid price B _C (i.e., $ 630) to the previous bid price B _P. The price / rank information DB 60c is stored (step S32). The higher bid price (ie, $ 630) to which the purchase priority is granted is set as the candidate bid price for subsequent auctions.

At the same time, the prospective buyer C who has dropped out of the auction for the sale 2 has the first purchase priority for the sale 4 as shown in FIG. At the same time, the buyer wishing B having the first purchase priority for the sale 4 is eliminated from the auction for the sale 4 in the manner described above, and the first buy priority for the sale 5 as shown in FIG. 6. You have a rank.

On the other hand, if there is no additional buyer for the item in step S29, the control process returns the final bid price suggested for each item via step S34 and step S35 of FIG. 3 as described above. As a result, the result information is stored in the transaction result information DB 60d. In other words, the bid price suggested by Buyer A for sale 1 (i.e., 540 won), the bid price suggested by Buyer E for sale 2 (i.e., 630 won), and the bidder B for sale 3 For the bid price (ie, 530 won) and the sale 4, the bid price suggested by the purchaser C (ie, 450 won) is determined as the final bid price, and the auction for the sale 5 is sold.

In the normal auction process, in order to increase the reliability of the auction, it is necessary to secure the contractual relationship between the seller and the buyer. To this end, conventionally, a neutral third party or agency retains a security deposit or guarantee relating to the sale or any property and documents corresponding to it as a representative of the parties until the terms of the contract are terminated, i.e. until ownership is transferred completely. The escrow system is used.

According to the present invention, since the bidding is given only to a number of items including a preliminary item rather than only one auction item, it is necessary to further secure the reliability of the contractual relationship.

7 is a flowchart illustrating a modified escrow system that can be applied to the auction processing system of the present invention.

In step S80 of FIG. 7, the n-th bidder wants to deposit a predetermined deposit for the item to be bought to the manager or agent operating the system of the present invention. In step S81, the control process judges whether there is a previous buyer for the item, and if not, remits the down payment of the nth buyer in step S82 to the seller. Since the down payment can be determined in various ways depending on the selling price, it is necessary to divide the price of each item into several classes and set the down payment accordingly.

On the other hand, if there is a previous buyer to purchase the item, the control process determines whether there is information on the item to which the second purchase priority is given by the auction dropper in step S83, and if there is no (n-1) Remit the down payment deposited by the nth buyer to the first buyer.

On the other hand, if there is information on the sale to which the second purchase priority is given by the auction dropper in step S83, the control process transfers the down payment deposited by the n-th purchase buyer in step S85 to the second purchase priority by the auction dropper. Escalate to a down payment for Through this modified escrow system, each purchaser can automatically adjust the contractual relationship at the same time as he / she is eliminated from any sale auction by depositing a down payment for each item corresponding to the series of purchase priorities. . In other words, the seller who has received a down payment for his or her sale is changed from the subsequent bid to the mth buyer, but only the provider of the first down payment has been changed.

8 is a schematic diagram conceptually explaining the relationship between a sales agent, a seller of purchase, and a buyer in the modified escrow system according to the present invention.

As mentioned above, although preferred embodiment of this invention was described, those skilled in the art can change variously, without deviating from the claim of this invention.

Therefore, according to the present invention, a plurality of items are given a series of purchase priorities, and in the case of falling out of the first-placed sale auction, the possibility of entering into a sale is made possible by automatically participating in the auction for the next ranked items. Can be increased.

In addition, according to the present invention, when the auction validity period, price adjustment deadline and price adjustment range for the sale is set, and the auction participant for the sale does not appear within the price adjustment deadline, the minimum bid price is automatically adjusted by the price adjustment range By lowering the rate, the possibility of closing the sale of the sale can be increased.

In addition, according to the present invention, the auction participants can be provided with an auction participant an opportunity to participate in the auction for a variety of items by assigning a series of purchase priorities to a plurality of items.

In addition, according to the present invention, by giving the auction participant a series of purchase priorities for a plurality of items, the auction participant for the sale is increased to sell the sale at a higher price, which is advantageous to the seller. .

In addition, according to the present invention, even when seized in any sale auction with one down payment, by automatically adjusting to the down payment of the sale corresponding to the next purchase priority, it is possible to avoid the down payment for each sale, The reliability of the contract can be secured.

Claims (10)

In the auction processing system using a communication network, A first memory for storing a plurality of items and a minimum bid price respectively corresponding to the plurality of items; Stores bid price information and a series of buy priority information presented to the plurality of items by a previous buyer, and stores bid price information and a set of buy priority information presented to the plurality of items by a current buyer. With a second memory, A price comparison unit (M = 1 to Q, which compares the current bid price and the previous bid price, which gives the first bid priority to the M th item stored in the second memory, to determine an upper bid price and a lower bid price). M and Q are positive integers) An update unit for updating the upper bid price as a previous bid price for the M-th item and storing the updated bid price in the second memory for comparison with a bid price suggested by a next bidder; Excluding the lower bid price from the auction for the Mth item, and at the same time the (M + 1) th item to which the previous or current bidder who presented the lower bid price is given a second buy priority; A priority adjusting unit for adjusting the number of sheets to one priority and storing the adjusted number of priority information in the second memory. Auction processing system comprising a. The method of claim 1, The first memory stores information of an auction expiration date, a price adjustment expiration date, and a price adjustment range registered in advance by each seller of the Q items. The auction expiration date information indicates that the auction for the item is effective. Due date, And auction control unit for lowering the minimum bid price for the sale by the price adjustment range, when a purchase wish for any sale does not appear for a period of time within the auction expiration date. And the downward adjusted minimum bid price is stored in the first memory. The method of claim 2, And the auction control unit determines the current bid price of the sale as the final successful bid price when the auction expiration date for the sale is over. The method of claim 2, The sale is auction processing system including a real estate and real estate. A method of operating an auction processing system having a plurality of items and a memory for storing a minimum bid price respectively corresponding to the plurality of items, (a) the bid price information and a series of buy priority information presented to the plurality of items by a previous buyer, and the bid price information and a series of buy priority information presented to the plurality of items by a current buyer, Storing in the memory; (b) Set a bid price to which the previous bidding applicant, which has been stored in the memory, gives the first buy priority to the M-th item, as a previous bid price, and the current bidder wishes to buy the first to the M-th item. Setting the priority bid price as the current bid price (M = 1 to Q, M and Q are positive integers), (c) comparing the previous bid price and the current bid price for the Mth item to determine an upper bid price and a lower bid price; (d) updating the upper bid price as a previous bid price for the Mth item, and storing the updated bid price in the memory for comparison with a bid price suggested by a next bidder; (e) excluding the lower bid price from the auction for the M-th item and at the same time the (M + 1) th item to which the previous or current bidder who presented the lower bid price gives a second buy priority; Adjusting the first purchase priority to the first purchase priority and storing the adjusted purchase priority information in the memory. Auction processing method comprising a. The method of claim 5, The memory stores information of an auction expiration date, a price adjustment expiration date and a price adjustment range registered in advance by each seller of the Q items for sale, and the auction expiration date information is a time limit for the auction for the item to be valid. Auction processing system representing. The method of claim 5, (f) lowering the minimum bid price for the sale by the price adjustment range if the purchaser of any sale does not appear for a period of time within the expiration date of the auction. And the downward adjusted minimum bid price is stored in the memory. The method of claim 7, wherein Step (f) is, (f1) determining that the auction expiration date has expired for the M-th item when there is no next purchaser for the M-th item; (f2) when the auction expiration date ends, determining the current bid price of the M-th item as the final successful bid price. The method of claim 5, Step (a) is, (a1) when auction bidding, requesting the purchaser to deposit a predetermined deposit, Step (e) is (e1) changing the down payment to a down payment for the (M + 1) th item corresponding to the adjusted buy priority. The method of claim 9, The sale is auction processing method comprising a real estate and real estate.