JP2003006472A - Control method of network auction and server therefor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a control method of network auction and a server therefor which can eliminate an unjust participant which tries to unjustly raise a bidding price. SOLUTION: A server opens an object to be bidden to clients A, B, C, and D. Each client inputs a bidding price at a step S11. The server gathers bidding prices and deprives the client B bidding a high bidding price of the right to bid. At a step S26, the client B is informed of that. At a step S27, the current bidding state is opened to the remaining clients A, C, and D. At a step S11, the clients A, C, and D input bidding prices again. Then, the client D is deprived of the right to bid and once and end condition is detected being met, a successful bidder is determined and the result is reported to the respective clients.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a network auction control method and a server thereof, and in particular, eliminates bad participants (Sakura) who try to hoist a bid price unreasonably high and enables proper bidding. Control method of the network auction and the server thereof.

[0002]

2. Description of the Related Art In recent years, services for selling products and the like in the form of auction on the Internet have become popular. In a conventional auction using the Internet, a client accesses a server of an auction organizer and inputs a name and the like to obtain a bid right. Next, after confirming the bid target and the lowest bid price, the server notifies the server of the desired bid price to participate in the auction. When the holding period of the auction ends, N clients are determined as the highest bidder in descending order of the bid price according to the number N of bids.

[0003]

Among the above-mentioned net auctions, in the open type in which the bid prices of other clients can be known, each client can determine the bid price while looking at the bid prices of other clients. If the price changes moderately, there is a high possibility that the desired product can be purchased.

However, when so-called "Sakura" intervenes to raise the bid price unreasonably high, there is a problem that the bid price rises unreasonably and the interests of the participants are hindered.

An object of the present invention is to solve the above-mentioned problems of the prior art and to eliminate the bad participants who try to raise the bid price unreasonably high to enable proper bidding and a method for controlling a network auction. To provide that server. Regarding

[0006]

In order to achieve the above object, the present invention is a network in which a server and a plurality of clients are connected via a network, and a client bids on a bid target presented by the server. In the control method of the auction, the procedure in which the client who has the bid right presents the bid price to the server, the procedure in which the client with the highest bid price deprives the bid right, and the client who has the bid right can determine the bid status from the server. It is characterized by including a procedure of making public and a procedure of repeating each of the above steps until a predetermined end condition is satisfied, and determining a successful bidder when the end condition is satisfied.

According to the above-mentioned characteristics, the client who has declared an unreasonably high bid price is deprived of the bid right and cannot participate in the auction. Therefore, a deterrent effect of preventing the participation of so-called cherry blossoms can be expected, and, for example, Even if Sakura participates in the auction, it will be possible to eliminate this surely.

[0008]

BEST MODE FOR CARRYING OUT THE INVENTION Preferred embodiments of the present invention will be described below with reference to the drawings. FIG. 1 is a flowchart showing a control procedure of a network auction which is an embodiment of the present invention, and FIG. 2 is a view showing a control sequence between a client and a server.

In step S20 of FIG. 1, the server of the auctioneer organizes a plurality of clients (in the present embodiment, as shown in FIG.
It will be published in A, B, C, D). At this time, the quantity N to be bid may be disclosed at the same time. Each client browses the bid requirements in step S10.
When each client inputs the bid price in step S11, this is notified to the server together with the identification information of each client.

In step S21, the server collects the bid price notified from each client. In step S22, all bid prices are statistically processed, and their variance, average value, highest price, lowest price, etc. are obtained. In step S23, the bid right of the client with the highest bid price is stripped based on the result of the statistical processing.

In the present embodiment, the bid right of a client whose bid price belongs to the upper few percent of the total number of clients is stripped. Similarly, in step S24, the bid right of the client having the lower bid price is stripped based on the result of the statistical processing. Here, client B
I will continue to explain that it has been deprived of the bid right.

In step S25, it is determined whether or not the auction ending condition is satisfied. Whether or not the ending condition is satisfied is determined, for example, based on whether or not the elapsed time from the start of the auction has passed a predetermined time. Alternatively, the determination may be made based on whether the number of clients who own the bid right is narrowed down to a predetermined number, or whether the variance of the bid price has converged to a predetermined threshold. At the beginning, it is determined that the termination condition is not terminated, so the routine proceeds to step S26.

In step S26, the fact that the bid right has been deprived is notified to the client B. In step S27, the lowest bid value and the median bid value are disclosed to the remaining clients A, C, and D as the current bid status, and the process returns to step S21.

When the client B receives the bid right deprivation notice in step S12, the bid amount is refused thereafter. In other clients A, C, D,
In step S13, it is determined whether or not the successful bid result has been notified. Initially, no notification is given, so step S14
Go to. In step S14, the server executes the step S
The bid status of this time, which was made public at 27, is received, and then the process returns to step S11. In step S11, the participants of the clients A, C, and D input the next bid price by referring to the bid status, and notify the server of the next bid price.

After that, the server repeats the processes of steps S21 to S27. In each client,
The processes of steps S11 to S14 are repeated.

In the next steps S23 and S24, the bid right of the client D is stripped, and when the completion condition is detected in step S25, the successful bidder is determined in step S28. If the number of bids is N, the winning bidder is determined to be the top N persons with the highest bid price. If a large number of bids are secured, all the clients who have the bid right at this point may be the winning bidders.

If there are a plurality of successful bidders, the winning bid price may be set to the bid price offered by each successful bidder, or the bids of all clients who have the bid right when the ending condition is satisfied. It may be set to the median price. Alternatively, it may be set to either the average value, the highest value or the lowest value of the bid prices of all clients who have the bid right when the ending condition is satisfied.

In step S29, the winning bidder's client (for example, client A) is notified of the winning bidder and the winning bid price, and the other clients (clients C, D) are notified that the winning bidder could not be won. To be done. Upon receipt of the notification of the successful bid result in step S13, each client ends the process.

According to the present embodiment, the bid right is deprived from the client having an extremely high bid price, and the auction is continued only by the other clients. Therefore, it is possible to prevent the bid price from being unduly lifted by Sakura.

Further, according to this embodiment, the bid right is stripped from the client having a very low bid price, so that bidders who do not intend to win the bid can be excluded, and the auction can proceed quickly.

[0021]

According to the present invention, the following effects are achieved. (1) Clients who have declared an unreasonably high bid price will be stripped of their bid rights and will not be able to participate in the auction.
So-called Sakura can be prevented from participating, and even if Sakura is participating in the auction, its influence can be reliably eliminated. (2) The winning bid can be converged to a proper price commensurate with the value of the bid target. (3) By depriving a client of a bid that has an extremely low bid price, the bidders who do not intend to win the bid are excluded, and the auction can proceed quickly.

[Brief description of drawings]

FIG. 1 is a flowchart showing a procedure of a network auction which is an embodiment of the present invention.

FIG. 2 is a flowchart showing a control sequence of a network auction which is an embodiment of the present invention.

Continued front page    (72) Inventor Gen Nakamura             2-15-1 Ohara, Kamifukuoka City, Saitama Stock             Company CAD Research Institute (72) Inventor Shinichi Nomoto             2-15-1 Ohara, Kamifukuoka City, Saitama Stock             Company CAD Research Institute

Claims (15)

[Claims] 1. A method of controlling a network auction in which a server and a plurality of clients are connected via a network, and the client bids on a bid target presented by the server, wherein a client who has a bid right bids the server. , The procedure of depriving the client with the highest bid price of the bid right, the procedure of disclosing the bid status from the server to the client who has the bid right, and the above steps until the predetermined termination condition is met. repetition,
A method of determining a successful bidder when the ending condition is satisfied. 2. The method of controlling a network auction according to claim 1, wherein the predetermined termination condition is that the number of clients who own the bid right is reduced to a predetermined number. 3. The method of controlling a network auction according to claim 1, wherein the predetermined ending condition is that a predetermined time has elapsed from the start of the auction. 4. The method of controlling a network auction according to claim 1, wherein the predetermined termination condition is that the variance of bid prices has converged to a predetermined threshold. 5. The method according to claim 1, further comprising the step of depriving a client having a lower bid price of the bid right.
5. The method for controlling a network auction according to any one of 1 to 4. 6. The procedure for determining the successful bidder is that all the clients who have a bid right when the ending condition is satisfied are the successful bidders.
A method for controlling a network auction according to any one of 1. 7. The procedure for determining the successful bidder is characterized in that among the clients who have the bid right when the ending condition is satisfied, the client having the highest bid price is the winning bidder. 6. The method for controlling a network auction according to any one of 1 to 5. 8. In the procedure for determining the successful bidder, a predetermined number of clients having a higher bid price among the clients who have the bid right when the ending condition is satisfied are set as the successful bidders. The method for controlling a network auction according to any one of claims 1 to 5. 9. The network auction according to claim 1, wherein the winning bid price is set to each bid price of each client who owns the bid right when the ending condition is satisfied. Control method. 10. The network according to claim 1, wherein the winning bid price is set to a median value of bid prices of all clients who own the bid right when the ending condition is satisfied. Auction control method. 11. The network according to claim 1, wherein the winning bid price is set to an average value of bid prices of all clients who have a bid right when the ending condition is satisfied. Auction control method. 12. The network according to claim 1, wherein the winning bid price is set to the highest bid price of all clients who own the bid right when the ending condition is satisfied. Auction control method. 13. The network according to claim 1, wherein the winning bid price is set to the lowest bid price of all clients who own the bid right when the ending condition is satisfied. Auction control method. 14. A server, which is connected to a plurality of clients via a network and executes a network auction based on a bid price presented by each client, has a procedure of disclosing the bidding requirements to each client, and owns a bid right. The procedure for collecting the bid price from each client, the procedure for depriving the client with the highest bid price of the bid right, the procedure for disclosing the bid status to each client, and the above-mentioned steps until the predetermined termination condition is met. Repeat
And a procedure for determining a winning bidder when the ending condition is satisfied. 15. The server for a network auction according to claim 14, wherein a procedure for stripping a bid right from a client having a lower bid price is executed.