KR20000054157A - Competetive transaction method using computer network - Google Patents

Abstract

PURPOSE: A competitive electronic commerce method using a computer communication network is provided for implementing a time difference-based first-come-first-served bid awarding method using a computer communication network. CONSTITUTION: A commerce transaction method is divided into a registration process(upper portion of Figure 2) and a transaction process(lower portion of Figure 2) based on a proceeding procedure of a transaction. In addition, the commerce transaction method may be divided into a casein which a seller registers a certain product and sells the registered product(left portion of Figure 2) and a case in which a buyer registers a desired product and buys the registered desired product(right portion of Figure 2) based on the condition that the seller or buyer registers a selling product or a buying product.

Description

Competitive transaction method using computer network

The present invention relates to a competitive commerce method using a computer communication network, and more specifically, a seller or buyer who wishes to sell or purchase registers product information, a start price, a lower limit or an upper limit, and a completion point, and the sale price and the purchase price are passed over time. According to the present invention, the present invention relates to a competitive commerce method based on a time-first-come-first-served basis using a computer network that allows a buyer or seller to search a bid record for a product and receive a successful bid on a first-come, first-served basis.

Currently, competitive auctions or reverse auctions have been widely used in cyber shopping malls using computer communication networks such as the Internet. In case of the auction method, when a seller wants to register a product, a starting price, and a completion point, the buyer wishes to search the list of registered products and continuously searches the bidding record to continue bidding at a higher price than other buyers. When bidding is more expensive than the applicants, the bidding is conducted. In the case of reverse auctioning, the purchaser registers the product, the starting price, and the completion time. Search and continue bidding at a lower price than other sales candidates. At the time of completion, bidding is performed at a lower price than other sales candidates. However, these methods commonly require the seller or seller to search the bid record from time to time to complete bidding, and wait for the completion date set by the registrant to know the winning result. It's a method that requires effort.

Thus, this approach is difficult to attract many potential sellers and buyers, especially if it is expensive and not a large quantity of goods. In order to solve these problems and attract users, there have been attempts to reward potential sellers and buyers who participate in the auction, but this is not merely a solution to the commerce itself, but merely a reward. However, the content of the compensation is rarely sufficient to attract potential sellers and buyers.

SUMMARY OF THE INVENTION The present invention has been made in view of the above, and in a competitive commerce method using a computer communication network, when a seller or a buyer who wishes to sell or purchase registers product information, a start price, a lower limit or an upper limit, and a completion time, To continue to fall or rise, so that buyers or sellers can retrieve records and bid on a first-come, first-served basis, so that they can make purchases or sales without having to repeatedly access and bid until completion. To provide.

It is an object of the present invention to provide an efficient competitive sale or purchase approach for both buyers and sellers.

Another object of the present invention is to provide a commerce method that can establish a commerce in a short time without a plurality of connection process in a competitive commerce method using a computer communication network.

1 shows the overall configuration of a system for implementing the competitive commerce method according to the present invention.

2 is a schematic diagram showing the overall flow of the competitive commerce method of the present invention.

3A and 3B are graphs illustrating a change in selling price over time when a seller wants to sell a product by a time-based first-come-first-served bidding method, and shows a general case and a case of reservation sale, respectively.

4A and 4B are graphs illustrating a change in purchase price over time when a buyer wants to purchase a product by a time-first-come-first-served basis, and shows a general case and a case of reservation purchase, respectively.

5 is a flowchart illustrating a method of purchasing a product according to a competitive commerce method according to the present invention.

6 illustrates an example of a screen for viewing detailed information of a product after a buyer selects the product.

7 is a screen example showing a list of bid details for a selected product.

8 is a flowchart illustrating a method of selling a product according to a competitive commerce method according to the present invention.

Competitive commerce method using a computer communication network of the present invention for achieving the above object, the bid request step of inputting a bid request including a sale start price, a sale minimum price and the completion time to the commerce management server; If the commerce management server is [Sales start price-{(Sales start price-Sales lower price) / Total run time} * Current run time]-The total run time means the time from the bid request step to the completion point, and the current run time is A sale price calculation step of calculating a sale price of the current time according to the bid request step from the bid request step to the current time; And a bidding step of inputting a bid from a buyer connected through a computer communication network to the commerce management server in response to the bid request.

Here, the bidding step includes inputting bids from a plurality of buyers in response to the bid request to the commerce management server, selecting one of the bids from the plurality of buyers, thereby selecting one buyer among the plurality of buyers. A selection step, wherein the selection step selects a bid that is temporally the earliest of the bids from the plurality of buyers, thereby selecting a buyer who bids first in time among the plurality of buyers, or the bid includes a desired purchase price. Selecting a bid that includes the highest desired purchase price among a plurality of bids, thereby selecting a buyer having the highest desired purchase price among a plurality of buyers, in the latter case, the selection is the desired purchase price and the current selling price. Matches, or the purchase price exceeds the current selling price It takes place on.

In addition, before the bidding step, it may further include a history output step of outputting a portion or all of the bid request details from the commerce management server so that the buyer can view, and bidding information from other buyers in response to the bid request The method may further include outputting from the commerce management server for viewing.

In addition, the bid request further includes the starting point, and the selling price is the starting point of the formula [total selling time] from the starting point of [selling price-{(selling price-lower selling price) / total running time} * current running time]. Depending on the time to completion, the current time means the time from the start time to the present time-depending on the pre-sale method may be used to fall linearly.

On the other hand, another competitive commerce method using a computer communication network according to the present invention, a bid request step of inputting a bid request including the purchase start price, the purchase upper limit price, the completion time to the commerce management server; The commerce management server formulas [purchase start price + {(purchase limit-purchase start price) / total run time} * current run time]-total run time means the time from the bid request step to the completion time, and the current run time is A purchase price calculation step of including the current purchase price calculated by calculating a purchase price at the current time according to the time from the bid request step to the current time; And a bidding step of inputting a bid from a seller connected through a computer communication network to the commerce management server in response to the bid request.

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

1 shows an overall configuration of a system for implementing a commerce method according to the present invention. The system for implementing a commerce method according to the present invention comprises a commerce management web server 110, a buyer computer system 150, a seller computer system 160 and a computer network connection channel 140 such as the Internet connecting them. .

The computer network connection channel 140 may be a closed network such as a local area network (LAN) or a wide arda network (WAN) for connecting a particular buyer or seller, but may be used by all consumers who are unspecified members of the public, It is preferred to be an open computer network such as an intranet.

The commerce management web server 110 includes a sales / purchase information management module, software or hardware including a member management module, a transmission / reception module, a central processing module, and the sales / purchase information management module and a member management module, respectively. It is linked with the purchase information database 130 and the member information database 120. The central processing module works in conjunction with each module to receive, store and manage the sales / purchase information from the seller or the buyer, calculate and output the current sales price / purchase price, and output the purchase / sales bid details associated with the sales / purchase information. Each module is controlled to determine a successful bidder and a successful bid amount among bidders. The central processing module performs the function of changing the selling price / purchasing price over time and selecting a successful bidder in the manner described below.

The commerce management web server 110 uses a web server program that is provided in various ways depending on the operating system, such as DOS (Windows), Windows ( ^TM ), Linux (Lynux ^TM ), Unix (Unix), Macintosh (Macintosh), etc. Typical examples include websites used in the Windows environment, CERN, NCSA, and APPACH used in the TTPS and Unix environments. However, such a web server, in addition to the web server program in a conventional sense, includes a series of application programs running on the server, and connects and brokers the seller / buyer with the database and each module using a computer communication network. It should be understood as a broad concept including a given system.

The sales / purchase information database 130 includes fields such as sales / purchase status, product information, sales / purchase start price, lower sales limit / purchase upper limit price, and completion time. It may further include fields such as whether to purchase or start time. The member database 120 includes fields such as a member identification code, personal information of a member (contact information, e-mail address, financial information, ID, password, etc.), bidding information, and successful bidding information. It is desirable to have a membership registration system in consideration of the safety of transactions and various conveniences, but it may be operated in a manner that can be made available to non-members or may not be a member registration system. The two databases 120 and 130 are linked to each other.

The databases 120 and 130 may be relational database management systems (RDBMS) such as Oracle, Infomix, Sybase, DB2, or Gemston, Orion, O2, etc. The object-oriented database management system (OODBMS) can be used to implement the present invention, and is stored in the storage means of the web server hardware.

In addition, each of the above-described modules are generally implemented in software such as an independent application program or a program module (or procedure) included in one program, but may also be implemented in hardware.

In addition, although not shown in the drawings, in order to perform the electronic payment between the seller and the buyer, a web server that provides a payment (agent) service may be linked to the Internet, and the certificate between the seller and the buyer For this purpose, a suitable Certificate Authority may also be connected. In addition, in order to secure the transmission process of sales / purchase information and bidding information, a layer level encryption method such as SSL (Secure Socket Layer) supported by the current web browser, or other public key infrastructure (PKI) An encryption method or the like may be used, but is not limited thereto.

Figure 2 is a schematic diagram showing the overall flow of the time difference first-come-first-served successful competitive commerce method of the present invention. The commerce method of the present invention can be divided into a registration step (upper part of FIG. 2) and a transaction step (lower part of FIG. 2) according to the order of transaction, and which of the seller and the buyer side registers the product and attaches to the bidding. In accordance with the present invention, a seller may register and sell a desired product for sale (left side of FIG. 2) and a buyer may purchase and register a desired product for purchase (right side of FIG. 2).

First, referring to the registration step shown in the upper part of Figure 2, the user logged into the commerce management web server (S211) selects whether the desired transaction is a sale or a purchase (S213), accordingly the sale or purchase information of the web server Registration is made in the database 130 (S215, S217). If you want to sell the sales information including at least product information, sales start price, sales minimum price, completion time must be registered (S215), if you want to purchase at least product information, purchase start price, purchase upper limit price, purchase information including completion time It must be registered (S217). In addition, although not shown in the drawings, it is also possible to select a pre-sale or purchase, in which case the sale or purchase information should include a starting point.

Now, referring to the trading step with reference to the bottom of Figure 2, the user logged into the web server for commerce (S231) selects whether the desired transaction is a purchase or sale (S233), and accordingly selects a product to buy or sell (S235, S245). If a product is selected, detailed information of the product is output from the database (S237 and S247). The detailed information of the product includes the selling or purchasing price and the current selling or purchasing price. Following the detailed information of the product, the buyer or seller may receive a list of bids of other buyers or sellers from the database (S239 and S249). Subsequently, the buyer or seller bids at the appropriate time and price while searching the bidding history of other buyers or sellers (S241, S251). Accordingly, the commerce management server selects the first bidder or seller who bids first as a successful bidder or , A bidder with the highest purchase price or a seller with the lowest sale price is selected as a successful bidder (S243, S253).

Next, a method of selecting successful bidders in the time difference first-come-first-served bidding method according to the present invention will be described with reference to FIGS. 3A and 3B. 3A and 3B are graphs illustrating a change in selling price over time when a seller wants to sell a product by a time-based first-come-first-served bidding method, and shows a general case and a case of reservation sale, respectively.

As shown in FIG. 3A, the slope of the graph is defined as {(lower selling price-selling start price) / completed time} by the selling price (starting price) at the start point (0 in FIG. 3A) and the selling price (lower price limit) at the completion point. All. Therefore, the selling price of the product decreases linearly with the time elapsed from the time when the product is provided for sale. The selling price can be changed by changing the unit according to the seller's choice, such as by changing the unit by date or by the unit of time, and the calculation can be simplified by raising the unit in won or ten won. Thus, in practice, the selling price does not change completely linearly but instead cascades.

Buyers wishing to purchase a product can enter the bid in two ways. One is to determine when to bid. For example, if the selling price drops to a certain price after a certain time after the product is provided for sale, the bidding may be made at the current selling price at that time. In this case, if the bidding buyer is the most advanced buyer in time, the bidder is the successful bidder, and a transaction is established. The second method is for the buyer to enter a desired purchase price and wait for the price to fall to that price. If two buyers bid on the purchase price of 1 and the purchase price of 2 at the time the product is offered for sale, the bidder is offered to the buyer who bids by offering the purchase price of 1 when the selling price drops to 1, which is the higher purchase price. At the same time, the winning bid is equal to one. However, in this case, if a buyer bidding at the current price at the time of bidding before the selling price falls to 1, it will be easily seen from FIG. 3A that the bid is successful to the buyer ahead of time.

3B shows the case of reserved sales. If a sales candidate who wants to sell a product wants to make a reservation sale, the starting point is registered at the time of registration of the product together with the completion point. Then, the selling price of the product is kept at the starting price until the starting point, and then decreases linearly at the starting point. Alternatively, the product may be offered for sale only after the start. The change in the selling price after the start and the selection method of the successful bidder are the same as in the case of general sales.

Next, referring to FIGS. 4A and 4B, a change in price over time and a selection method of a successful bidder will be described when a buyer wants to purchase a product by a time-first-come-first-served basis. 4A and 4B are graphs illustrating a change in a purchase price over time in a general case and a reservation purchase, respectively.

If a buyer wants to purchase a product on a first-come, first-served basis, he or she refers to FIGS. 3A and 3B except that the purchase price increases over time and the seller bids a lower selling price. Similar to the method described. That is, in the general case, the purchase price increases linearly from the start point to the completion point, in which case, the seller wins the sale at the earliest seller in the time or at the lowest seller. In the case of a reservation purchase, the purchase price is kept constant at the starting price until the starting point designated by the buyer, and the purchase price increases linearly from the starting point.

Now, with reference to the flow chart of Figure 5 will be described in detail a method of purchasing a product according to the time difference first-come-first-served successful bidding competitive commerce method according to the present invention.

5 is a flowchart illustrating a case where a buyer wants to purchase a product while a product is already registered. That is, before the purchase flow of FIG. 5 begins, a plurality of sellers have already connected to a commerce management server to register information about a product such as the type and quantity of the product, and the detailed information of the sale start price, the sale minimum price, The completion point is registered, and this information is stored in the database of the commerce management web server.

First, the buyer accesses the commerce management web server (S510), and selects a product to purchase from the product list (S512). If a product is selected, detailed information of the corresponding product is provided to the buyer (S514). The detailed information includes the selling price and the current selling price in addition to the detailed description of the product. 6 shows an example of a screen that is output to the buyer when the buyer selects the product, through which the buyer can know the detailed introduction of the product and the starting price (2,000,000 won) and the current selling price (1,920,000 won). have. In addition, if necessary, the buyer may be informed of both the selling price and completion time. For example, if the selling price of the product selected by the buyer is 1,600,000 won and the completion point is 40 hours after the sale is provided, the selling price drops at a rate of 10,000 won per hour. The display of the selling price may be lowered by 10,000 won by the hour, or may be changed by the minute or the tenth minute.

If the buyer wants to bid immediately at the current selling price at step S516, if the user selects "bid at the current selling price", it is searched whether there is a pre-bidding buyer (S518). If there is a buyer who bids in advance, the product is already a successful bid, but the transaction is terminated. If there is no buyer who pre-bids, that is, the buyer who bids for the first time, the bid is sold to the buyer (S530), and the transaction is established immediately. Once a transaction is established, the product is removed from the list and no longer available for sale.

If you do not want to bid immediately, the buyer can search the list of bids of other buyers (S520). As shown in FIG. 7, the bid date and time and the bid price of the type bidder are output to the bid history list. In FIG. 7, only the bid date is displayed for convenience, but the bidding time may be displayed in detail. When the buyer who has searched the bid history list wants to bid (S522), if the bid is selected, the bidder is registered and bidged (S524). For example, you can register 1,890,000 won. If you do not wish to bid, the transaction is terminated.

The registered purchase price is compared with the current selling price (S526). If the desired purchase price and the current selling price match or the desired purchase price exceeds the current selling price, the transaction is established (successful bidding) (S530) and ends. If the entered desired purchase price is lower than the current selling price (S528), the buyer may re-bid at a higher price or wait for the selling price to fall until the previously entered desired purchase price. If there are no more bidders, the sale price drops to 1,890,000 won, which is suggested by the buyer as the desired purchase price, that is, three hours after the current time, the bid is sold to the buyer.

There may be cases where more than one bidder satisfies the condition, such as more than one buyer bidding at the same price or two or more buyers bidding with a small difference compared to the price drop over time. In this case, the former bidder may be selected as a successful bidder in time, and in the latter case, a buyer who presents a higher price may be selected as a successful bidder by comparing the purchase prices of two buyers.

Now, on the contrary, a method of selling goods according to the time difference first-come-first-served successful competitive commerce method according to the present invention will be described in detail. 8 is a flowchart illustrating a method of selling goods in accordance with the present invention.

As in the case of the purchase described with reference to FIGS. 5 to 7, FIG. 8 is a flowchart illustrating a step in which a seller sells a product in a state in which a product to be purchased is already registered. Therefore, a plurality of buyers have already registered the type and quantity of goods to be purchased, the purchase start price, the purchase upper limit value, and the completion time after accessing the commerce management server, and this information is stored in the database of the commerce management web server.

The seller accesses a commerce management web server (S810) and selects a product to sell (S812). In step S814, detailed information of the corresponding product including the purchase start price and the current purchase price is provided to the seller.

If the seller wants to bid at the current purchase price in step S816, it is possible to bid immediately. In this case, if there is a seller who pre-bids (S818), there is no seller who pre-bids, that is, if the seller is the first bid Sold to the seller (S830). Once a successful bid is made, the product is removed from the product list.

If you do not want to bid immediately, the seller can search the list of bids of other sellers (S820). When the seller who has searched the bid history list wishes to bid (S822), the seller may register and bid on the desired selling price (S824). If you do not wish to bid, the transaction is terminated.

The registered selling price is compared with the current purchase price (S826). If the desired selling price and the current purchased price are equal to each other, or the desired selling price is lower than the current buying price, the transaction is established (successful bidding) (S830) and ends. If the entered selling price is higher than the current purchase price (S528), the seller may re-bid at a lower price or wait for the current buying price to increase until the selling price entered previously. If there are no more bidders, the bidder is awarded to the seller when the purchase price rises to the price suggested by the seller.

Similar to sales, if there are more than one bidder who satisfies the condition, such as more than one seller who bids at the same price, or more than one seller who bids with a small difference over time, In this case, the seller who bids in advance in time is selected as a successful bidder, and in the latter case, a seller who offers a lower price is compared to a sale price of two sellers as a successful bidder.

Although the present invention has been described in detail with reference to preferred embodiments, the scope of the present invention is not limited to the specific embodiments, it should be interpreted by the appended claims.

In the competitive commerce method using a computer communication network according to the present invention, unlike a conventional internet auction method, since the selling price or the buying price changes over time, the buyer or seller responding to the bid request predicts the bidding time or purchase / selling. You can register the desired price and receive a successful bid, so you can purchase or sell without having to repeatedly connect and bid until completion. In addition, when there is a bid at the appropriate time, or if the registered purchase / sale price and time-changed selling price / purchase price coincide with each other, the successful bidding is established and the transaction is established. Therefore, there is no need to wait until completion to save more time. .

In addition, the buyer or seller who wants to participate in the auction can search the bidding history of other buyers or other sellers, and can use the bidding history of other buyers or other sellers as the data of the bidding as well as the prediction of the change in the successful bid price. By being able to bid at a price, the deal can be made quickly.

As a result, the competitive commerce method using the computer communication network according to the present invention can provide an efficient sale or purchase method to both the buyer and the seller.

Claims (14)

A bid request step of inputting a bid request including a sale start price, a sale minimum price, and a completion time, to a commerce management server; The commerce management server is the formula of [sale starting price-{(sale starting price-selling lower price) / total running time} * current running time]-the total running time means the time from the bid request step to the completion time, The current progress time means a time from the bid request step to a current time-a sale price calculation step of including the current sale price calculated by calculating a sale price of the current time according to the bid request; And And a bidding step of inputting a bid from a buyer connected through a computer communication network to the commerce management server in response to the bid request. The method of claim 1, The bidding step, Inputting bids from a plurality of buyers in response to the bid request to the commerce management server; Selecting one of the bids from the plurality of buyers, thereby selecting one buyer from the plurality of buyers. The method of claim 2, The selection step, Selecting a bid in advance of the bids from the plurality of buyers, thereby selecting a bidder first bidding in time among the plurality of buyers. The method of claim 2, The bid includes a desired purchase price, The selecting step is a step of selecting a bid including the highest desired purchase price among the plurality of bids, thereby selecting a buyer who has presented the highest desired purchase price among the plurality of buyers, Wherein the selection is made when the desired purchase price matches the current selling price or when the desired purchase price exceeds the current selling price. The method of claim 1, Before the bidding step, Comprising a detail output step of outputting a portion or all of the bid request details from the commerce management server for the buyer to view the competitive commerce method using a computer communication network. The method of claim 1, Before the bidding step, And outputting, from the commerce management server, bid details from other buyers responding to the bid request from the commerce management server. A bid request step of inputting a bid request including a sale start price, a sale minimum price, a start point and a completion point into a commerce management server; The commerce management server is the formula of [sale starting price-{(sale starting price-selling lower limit price) / total running time} * current running time]-the total running time means the time from the starting time to the completion time, A selling price calculating step of including the current selling price calculated by calculating the selling price of the current time according to the current running time from the start time to the present time; And And a bidding step of inputting a bid from a buyer connected through a computer communication network to the commerce management server in response to the bid request. A bid request step of inputting a bid request including a purchase start price, a purchase upper limit price, and a completion point to a commerce management server; Wherein the commerce management server [purchase start price + {(purchase upper limit-purchase start price) / total progress time} * current progress time] formula-the total progress time means the time from the bid request step to the completion time, The current progress time means a time from the bid request step to a current time-a purchase price calculation step of including the current purchase price calculated by calculating a purchase price of the current time according to the bid request; And And a bidding step of inputting a bid from a seller connected through a computer communication network to the commerce management server in response to the bid request. The method of claim 8, The bidding step, Inputting bids from a plurality of sellers in response to the bid request to the commerce management server; Selecting one of the bids from the plurality of sellers, thereby selecting one seller from the plurality of sellers. The method of claim 9, The selection step, Selecting a bid in advance among the bids from the plurality of sellers, thereby selecting the first bidder in time among the plurality of sellers. The method of claim 9, The bid includes a desired selling price, The selecting step is a step of selecting a bid including the lowest desired selling price among the plurality of bids, thereby selecting a seller having the lowest desired selling price among the plurality of sellers, Wherein the selection is made when the desired selling price matches the current buying price or when the selling desired price becomes lower than the current buying price. The method of claim 8, Before the bidding step, Comprising a detail output step of outputting a portion or all of the bid request details from the commerce management server for the seller to view the competitive commerce method using a computer communication network. The method of claim 8, Before the bidding step, And outputting a bid history from another seller in response to the bid request for the seller to view. A bid request step of inputting a bid request including a purchase start price, a purchase upper limit price, a start point and a completion point into a commerce management server; The commerce management server is the formula of [purchase start price + {(purchase upper limit-purchase start price) / (total progress time)} * current progress time]-the total progress time means the time from the start time to the completion time A purchase price calculating step of including the current purchase price calculated by calculating a purchase price of the current time according to the current progress time from the start time to the current time; And And a bidding step of inputting a bid from a seller connected through a computer communication network to the commerce management server in response to the bid request.