KR20010114024A - computer-based data processing method for contracting transactions between multi-parties and apparatus for the same - Google Patents

Abstract

Data processing method for concluding a transaction on a virtual exchange by an intelligent trading robot program reflecting a market-type price compromise method in a multi-party electronic commerce environment, and data processing for operating a virtual exchange on the Internet by mounting the trading robot program. An apparatus is disclosed. The transaction takes place in several steps. The first transaction determines whether or not to conclude a transaction based on each seller and each buyer's preferred base selling price and base purchasing price. The second transaction is made on the basis of the minimum selling price and the guilty purchase price or the minimum selling price and the base purchase price with respect to the balance in the preceding transaction. The minimum selling price is the price minus the discount price, and the highest purchasing price is the price plus the premium. The third transaction is based on the adjusted selling price and the adjusted buying price that have been reassigned by each seller or buyer to the remaining amount of the preceding transaction. The adjusted selling price and the adjusted buying price are the desired trading prices newly proposed by each seller and each buyer who failed the first and second transactions to narrow the price difference and increase the success rate. In the preceding transaction, the fourth transaction is performed on the price difference within the range based on the adjustable error range. After transaction processing, post-processing such as notifying each seller and buyer of the execution details.

Description

Computer-based data processing method for contracting transactions between multi-parties and apparatus for the same}

The present invention relates to a data processing method for multilateral transaction conclusion using a computer and an apparatus therefor. More specifically, a data processing method for closing a transaction in a virtual exchange by an intelligent trading robot program reflecting a market-type price compromise method in a multi-party electronic commerce environment, and operating the virtual exchange based on the Internet by mounting the transaction robot program. It relates to a data processing apparatus that can be.

Unlike agricultural products, agricultural products have a shelf life. In particular, products that are difficult to store for a long time, such as flowers, vegetables, etc., the average shelf life is very short considering the value of the product. Typically, flower products are perishable products that have a shelf life of about 4 days and are produced at the time of flowering, and the quantity produced must be sold.

Therefore, the most important thing in developing an e-commerce system that handles these products is to satisfy the pricing function by the market function in the Internet environment and at the same time to close the trade between the seller and the buyer as much as possible so It should be minimized. In addition, sellers and buyers are generally plural in number, and therefore, it is necessary to be an electronic commerce system on the premise of a trading relationship in which a plurality of sellers and a plurality of buyers are related to one kind of goods.

Representative electronic commerce systems known to date include auction system, reverse auction system, and stock trading system. However, these conventional e-commerce systems did not meet the above needs properly.

The auction system adopts a method in which a seller makes a deal to a buyer who presents the highest price by providing a price by a plurality of buyers for one sale. According to this approach, a transaction is established if it matches, closest to, or exceeds the price suggested by the seller. A transaction may not be established if the seller sets a certain lower selling price limit and the purchase price does not coincide with or exceed the lower limit. If the transaction is not established, a re-auction may be carried out by lowering the selling price by a percentage, provided the seller agrees.

For example, according to the auction system under the conditions shown in Table 1 below, the transaction processing result is set to a transaction price of 18,700 won for 400 transactions between S1 and B1.

seller Quantity sold Sales price (KRW) Purchase price (KRW) Quantity buyer S1 650 18,700 18,700 400 B1 18,250 210 B2 17,600 420 B3 250 Total balance 630

Next, the so-called reverse auction system adopts a method in which a single buyer purchases a price for one product he / she wants to purchase so that a transaction can be established for a seller who has offered the lowest price. In this way, a transaction is established if it matches, is close to, or exceeds the price offered by the buyer. If the buyer sets a certain upper price limit and the selling price matches or exceeds this limit, the transaction will not be established. If the transaction is not established, the auction may be carried out by raising the selling price by a percentage, provided that the buyer agrees.

For example, according to the reverse auction system under the conditions shown in Table 2 below, the transaction processing result is set at a transaction price of 18,700 won for 400 transactions between B1 and S1.

seller Quantity sold Sales price (KRW) Purchase price (KRW) Quantity buyer S1 650 18,700 18,700 400 B1 S2 150 19,000 S3 400 18,800 800 Total balance

The above two trading systems or trading methods are basically 1: n trading methods, which are basically different from the many-to-many (n: n) multilateral trading methods of the present invention.

The so-called stock trading system is a representative trading system employing n: n multilateral trading. This stock auction system is a method of establishing a trade between two parties whose prices are matched by a number of buyers for a plurality of sellers and employing a multilateral trading system in the stock market. Unlike the previous two systems as shown in Table 3 below, the stock trading system can be offered at various prices by the seller and buyer, and the system processes the transaction by combining each quantity. In the case of Table 3 below, the transaction is processed by sequentially comparing the selling price by auction or reverse auction based on the purchase price. The result of such transaction processing is 400 trading volume between B1 and S1 and the transaction price is 18,700 won. A deal is formed.

seller Quantity sold Sales price (KRW) Purchase price (KRW) Purchase quantity buyer S1S2S3 650 (S1 + S3) 18,700 18,700 400 (B1 + B3) B1B2B3 150 (S1 + S2) 19,000 18,250 210 (B2) 400 (S2 + S3) 18,800 17,600 420 (B1 + B3) 800 Total balance 630

The stock trading system is different from the above two trading methods in that it is based on n: n multilateral trading relationship. However, a transaction is formed only if the selling price and the buying price coincide, and many other sell and buy orders cannot be closed. The problem with this system is that sellers or buyers whose orders have not been traded will have to submit new orders again. Above all, the decisive problem is that even if a large number of buyers and sellers reasonably trade, the closing rate is very low. In other words, the stock trading system is an off-line real wholesale market or a retail market, a price setting function, a price adjustment function, and a bargaining function based on a price quote and a transaction participation function, which can be referred to as a trade practice or a commerce forming function. In other words, it is a simple mechanical pricing system that does not reflect the information transfer and decision-making functions among trading parties in the market.

In addition, this trading system has no trade considerations due to underestimation between total sales volume and total purchase volume. Pricing in the market is critically influenced by supply and demand. If the total sales volume on the market is larger than the total purchase volume, it becomes a buyer-led market and vice versa. The actual market has a property in which a buyer-driven market is priced in favor of the buyer, and in a seller-driven market, it is priced in favor of the seller. However, the stock trading system does not consider these market characteristics at all.

In order to solve the above problems, a more intelligent trading solution is needed. Therefore, the present invention is based on the sales conditions and purchase conditions presented by a number of sellers and buyers, computer-based to reflect the actual trading environment and practices of the market, and to perform efficient trading by exhibiting price and market coordinator functions It is a first object to provide a data processing method for closing a transaction.

In addition, the present invention reflects the actual trading environment and practices on the basis of sales conditions and purchase conditions proposed by a plurality of sellers and buyers over the Internet, and enables effective transactions to be made by exhibiting price and market adjuster functions. It is a second object of the present invention to provide a data processing method for making a transaction using an internet-based computer.

Furthermore, the present invention reflects the actual trading environment and practices of the market based on the sales conditions and the purchase conditions proposed by a plurality of sellers and buyers through the Internet, and enables the effective trading to be performed by exerting the price and market coordinator functions. It is a third object of the present invention to provide a data processing apparatus for internet-based transaction conclusion.

1 schematically illustrates the exchange of information between a server and a client for multilateral transaction conclusion in accordance with the present invention.

2 is a flow chart showing the execution procedure of a routine related to a seller or a buyer placing an order through a client and inquiring a transaction result.

3 is an overall flowchart of a server-side routine of a data processing method for a multilateral transaction in accordance with the present invention.

4A to 4C are flowcharts illustrating an execution sequence of a routine for concluding a first transaction among server-side routines of a data processing method for concluding a multilateral transaction according to the present invention.

5A to 5C are flowcharts illustrating an execution sequence of a routine for concluding a second transaction among server-side routines of a data processing method for concluding a multilateral transaction in accordance with the present invention.

6A to 6C are flowcharts illustrating an execution procedure of a third transaction execution routine among server-side routines of a data processing method for multilateral transaction conclusion in accordance with the present invention.

7 is a flowchart illustrating an execution sequence of a fourth transaction execution contract among server-side routines of the data processing method for a multilateral transaction conclusion in accordance with the present invention.

8 is a flowchart illustrating an execution sequence of a routine for final post-processing among server-side routines of a data processing method for multilateral transaction conclusion in accordance with the present invention.

9 is a system configuration diagram showing an example of a system configuration for implementing a data processing method for multilateral transaction conclusion in accordance with the present invention.

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

10a, 10b, 10c, 10d: computer on the seller's side, landline phone, cordless phone, dedicated terminal

20b, 20b, 20c, 20d: Buyer side computer, landline phone, wireless phone, dedicated terminal

30: wired and wireless network 32: Internet

34: telephone station 36: relay antenna

40: server system 42: web server

44: DB server 46: router

48: Hub 50: Representative Computer

52: LAN 54: telephone for staff

In order to achieve the first object of the present invention described above, the present invention provides a method for concluding a transaction using a computer system on the basis of sales conditions and purchase conditions for a predetermined product presented by a plurality of sellers and a plurality of buyers. In the data processing method, the sales conditions of each seller including the sales quantity of the predetermined product and the reference selling price, and the purchase conditions of each buyer including the purchasing quantity of the predetermined product and the reference purchase price are inputted. Storing in storage means of the computer system; And

If the total sales volume is greater than the total purchase volume, the first transaction is processed while comparing with the base selling price in descending order from the highest price of the base purchase price, and the difference with the base purchase price among the base selling prices below any base purchase price. First of all, the transaction is concluded at the first predetermined price with the predetermined reference price, and when the total sales quantity is less than the total purchase quantity, the reference purchase price is compared with the reference purchase price in descending order from the highest price of the reference sales price. The first transaction is processed, and the first purchase price is greater than the reference selling price and the difference between the reference selling price is greater than the reference selling price. Dealing with a secondary transaction comprising the step of processing the secondary transaction: It provides a data processing method for.

As a result, it is possible to establish a transaction by reflecting the magnitude of demand and supply of a product to be traded in the market.

Further, the data processing method is preferably a residual total sales quantity and the current highest price among the highest purchase prices of each of the remaining purchase quantity of the remaining total sales quantity and the remaining total purchase quantity of which no transaction was established at the first transaction conclusion. The second transaction is processed at the third predetermined price in the order of the difference between the present highest price among the lowest selling prices equal to or lower than the current highest price, in a one-to-one order from the lowest price of the lowest selling price of the However, the current highest price further includes the step of processing the second transaction in such a manner that the next lowest selling price is changed every time the corresponding remaining purchase quantity is all traded. Here, the highest purchase price is a price obtained by adding a premium corresponding to the corresponding reference purchase price, and the minimum selling price is a price obtained by subtracting a discount price corresponding to the corresponding reference selling price.

According to this step, a transaction that reflects a discount or a premium, which is a trading practice in the actual market, can also be traded by a virtual exchange.

Furthermore, the data processing method preferably notifies the request of price adjustment to a range of parties among the parties involved in the remaining unsettled quantity after the second transaction, and adjusts the repurchase price and re-suggested by the parties in the predetermined range. After receiving the selling price and storing it in the storage means, the current highest price among the adjusted purchase prices of each remaining purchase quantity is compared one-to-one in ascending order from the current lowest price of each adjusted selling price of the remaining selling quantity. If the lowest price is equal to or lower than the current maximum price of the adjusted purchase price, the third transaction is executed at the fourth predetermined price, but the purchase quantity or the sales quantity corresponding to the current adjusted purchase price and the adjusted selling price, respectively, are compared. Each time it is exhausted, the comparison target changes to the next adjusted or next adjusted selling price. Group characterized by further comprising the step of treating the third transaction.

As a result, each party that has not established a transaction can be presented with a new trade condition instead of the first proposed trade condition, thereby increasing the possibility of the transaction being made.

The data processing method may further include a fifth price between the adjusted purchase price and the adjusted selling price when the price error rate of the adjusted selling price with respect to the adjusted buying price is less than or equal to the adjustable error rate with respect to the remaining unsettled quantity after the third transaction. And processing the fourth transaction at a predetermined price.

By maximizing the probability that a transaction can be made by such an arbitration process, the transaction can be beneficial to both the seller and the buyer by minimizing the outstanding balance.

Next, in order to achieve the second object of the present invention described above, the present invention

In the data processing method for closing a transaction using a computer system on the basis of sales conditions and purchase conditions for a predetermined product presented by a plurality of sellers and a plurality of buyers,

Providing a screen for inputting the selling condition and the buying condition to the terminals of the plurality of sellers and the plurality of buyers connected to the computer system through a communication network;

Purchases of each buyer including sales conditions for each predetermined product provided by the terminal through the communication network, sales conditions of each seller including a reference selling price, quantity purchased for the predetermined product, and reference purchase price. Receiving conditions and storing them in a storage means of the computer system; And

Executing a program installed in the computer system for the sales conditions and the purchase conditions stored in the storage means until a predetermined time limit is reached, thereby performing data processing for a transaction. It provides a data processing method for entering into a transaction.

The program has several functions for processing data related to entering a transaction. First, if the total sales quantity is greater than the total purchase quantity, the program processes the first transaction in comparison with the base selling price in descending order from the highest price of the base purchase price, and among the base selling prices below any base purchase price, If the difference with the purchase price is small, the transaction is first established at the predetermined reference purchase price and the first predetermined price. When the total sales quantity is less than the total purchase quantity, the transaction is compared with the reference purchase price in descending order from the highest price of the reference selling price. The first transaction is processed while leaving the difference between the reference selling price and the reference selling price that is higher than the reference selling price. It has a function of processing the first transaction.

The program preferably provides the current highest price among the highest purchase prices of each remaining purchase quantity and the minimum selling price of each remaining sales quantity, with respect to the remaining total sales quantity and the remaining total purchase quantity for which no transaction is established in the first transaction. Establish a second transaction at a third predetermined price in the order of the difference between the present highest price among the lowest selling prices that are less than or equal to the current highest price in a one-to-one comparison from the current lowest price to the ascending order; The highest price further has a function of processing the second transaction in such a manner that the entire lowest remaining selling price is changed to the next lowest selling price whenever the corresponding remaining purchase quantity is concluded.

In addition, the data processing method, by wire or wireless communication means to notify the price adjustment request to the parties of a predetermined range of the unsettled residual quantity after the second transaction by the parties of the predetermined range again And receiving and storing the adjustment purchase price and the adjustment sale price in the storage means. In addition, preferably, the program compares the current highest price among the adjusted purchase prices of each remaining purchase quantity in one-to-one order from the current lowest price of the adjusted selling price of each remaining sales quantity to the current lowest price of the adjusted selling price. If the adjusted purchase price is equal to or lower than the current maximum price, the third transaction is processed at the fourth predetermined price, and the purchase quantity or sales quantity corresponding to the current adjusted purchase price and the adjusted selling price, respectively, will be exhausted. Each time, the comparison subject further has a function of processing the third transaction in such a manner as to change to the next adjusted purchase price or the next adjusted sale price.

Further preferably, the program is further configured to provide a fifth predetermined value between the adjusted purchase price and the adjusted selling price when the price error rate of the adjusted selling price with respect to the adjusted buying price is less than or equal to the adjustable error rate with respect to the remaining unsettled quantity after the third transaction. And a function of establishing a fourth transaction at a price.

Next, in order to achieve the above-mentioned third object of the present invention, the present invention

In the data processing apparatus for processing a transaction between a plurality of sellers and a plurality of buyers,

Interface means connected to an external wired or wireless communication network for data communication;

Data storage means; And

A data processing means connected to the data storing means,

The data storage means stores a program for controlling the data processing means,

The data processing means functions by execution of the program,

The program receives from the plurality of sellers and the plurality of buyers the sales conditions including the respective sales quantity and the reference selling price and the purchase conditions including the purchase quantity and the reference purchase price and stores the data in the data storage means. If the total sales quantity received up to the time limit is greater than the total purchase quantity every time, the first transaction is processed while comparing with the base selling price in descending order from the highest price of the base purchasing price, and the above-mentioned random selling price below the base selling price If the difference between the reference purchase price is small and preferentially establishes the transaction at the predetermined reference purchase price and the first predetermined price, and if the total sales quantity is less than the total purchase quantity, the reference purchase price in descending order from the highest price of the reference selling price Process the first transaction, comparing Among the reference purchase prices higher than the quasi-sale price, the difference between the reference price is higher and the data is first established at the second predetermined price with the predetermined reference price, and the data is stored in the data storage means. It provides a data processing device for entering into a transaction, characterized in that to provide a function for processing to the data processing means.

Preferably the program,

With respect to the remaining total sales quantity and the remaining total purchase quantity in which the transaction was not established in the first transaction, the current highest price among the highest purchase prices of each remaining purchase quantity is increased in ascending order from the current lowest price of the lowest selling price of each remaining sales quantity. In comparison, the second highest transaction is established at the third predetermined price in the order of the difference between the present highest price among the lowest selling prices less than or equal to the current highest price, the current highest price being the corresponding remaining purchase quantity. Each time the whole transaction is concluded, the data processing means is further provided with the function of processing the second transaction in such a manner that the next lowest selling price is changed.

In order to close the transaction of the remaining quantity that was not concluded in the second transaction, the data processing apparatus

Through the interface means, a request for price adjustment is sent to the parties within a predetermined range of the related parties of the remaining unsettled quantity after the second transaction, and the adjusted purchase price and the adjusted sales price, which are presented again by the parties in the predetermined range, are received. Store in the storage means. Along with this, the program

Residual Purchase Quantity The current highest price of each adjusted purchase price is compared one-to-one in ascending order from the current lowest price of each adjusted selling price of the remaining selling quantity so that the current lowest price of the adjusted selling price is equal to or higher than the current highest price of the adjusted purchase price. If it is low, the third transaction is executed at the fourth predetermined price, and the comparison target is the next adjusted purchase price each time the purchase quantity or sale quantity corresponding to the current adjusted purchase price and the adjusted selling price which are compared are exhausted. Or further providing the data processing means with the function of processing the third transaction in such a way as to change to the next adjusted selling price.

Further, the program preferably provides a fifth predetermined price between the adjusted purchase price and the adjusted selling price when the price error rate of the adjusted selling price for the adjusted buying price is less than or equal to the adjustable error rate for the unsettled remaining quantity after the third transaction. The method further provides a function of processing the fourth transaction to the data processing means.

Other features and advantages of the present invention will become more apparent with reference to the following detailed description and accompanying drawings that illustrate the features of various embodiments of the invention.

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

The present invention assumes several points as follows.

First, the virtual exchange operator that provides the virtual trading market between the seller and the buyer, and the intermediary is the main actor. In addition, the payment system operator, the seller and the buyer and the virtual exchange who are in charge of the payment of goods and transaction fees As carriers that provide wired / wireless communication to enable data communication and information exchange between operators, carriers (not shown) in charge of the delivery of goods with which other transactions are concluded, and the like, are related as auxiliary entities (see FIG. 9).

Second, it assumes many-to-many (n: m) trading relationships for the same kind of trading products. Where n and m are the number of sellers and buyers, respectively, and are natural numbers greater than one. That is, the principle is that there is no limit to the number of sellers and buyers, and thus may be one or more. However, there may be a realistic limit depending on the capacity of the server system.

Third, the menu on the commodities to be traded should be provided by the virtual exchange operator. In addition, the commodity to be traded may be determined by specifying conditions relating to the same kind of goods, for example, 'a red rose of high quality' or 'Avante passenger car of Hyundai Motor in 1998'. The commodity conditions specifying the trading object may be properly defined by the virtual exchange operator according to the characteristics of the trading product.

Fourthly, there are in principle no restrictions on the products to be traded. That is, any product can be traded. However, in the case of horticultural crops or other agricultural and livestock products with limited shelf life, such as living organisms, they may have a particularly effective function.

In order to conclude a trade of the present invention, an engine program for determining whether a trade is concluded by executing a plurality of trade execution routines using the sales conditions and the purchase conditions presented by a plurality of sellers and a plurality of buyers as an input record. This is what we call an intelligent trading robot program. 2 to 8 are flowcharts schematically showing a data processing routine for each transaction order of the intelligent transaction robot program.

In addition, a database engine is required to manage sales conditions, purchase conditions, transaction details, customer information, and information related to a transaction in a database.

Referring to FIG. 9, in order to operate such a virtual exchange based on the Internet, a server system 40 operated and managed by a virtual exchange operator is required. The intelligent trading robot program or database engine is a web server of the server system 40. It is necessary to mount on 42 and the database server 44. The employment of the DB server 44 is optional, but since there will be a large amount of data to manage, in most cases it will be efficient to have a separate DB server.

In order to efficiently operate the virtual exchange, it is desirable to provide the following databases in the DB server 44.

(1) Member DB: DB for managing member information.

(2) Purchased product DB, sold product DB: DB for managing information about the product to be purchased or sold.

(3) Transaction DB: A database for managing information on transaction details and fees.

(4) Delivery management DB: DB for managing information about the delivery of the goods, etc. concluded a transaction.

(5) Payment DB: DB for managing the payment information of the buyer concluded the transaction and the transfer of information to the seller.

(6) Market Information DB: A database for providing reference information to sellers or buyers by managing the actual market price of a product to be traded and general information of the product.

The server system 40 also needs to be equipped with basic networking equipment such as a router 46 for interfacing data communication with the outside and a hub 48 for integrating internal resources into the LAN 52. have. In addition, a person who notifies the seller or the buyer of a particular matter by using various communication methods such as a telephone call or an e-mail, or receives their intention, for example, the adjusted sales price or the adjusted purchase price, and inputs the information through the computer 50 instead. By deploying, better transaction services can be provided.

Sellers and buyers exchange information with the server system 40 through a wired or wireless communication network 30 provided by a carrier using a variety of communication means. The most basic means of communication for sellers and buyers is, of course, the personal computer 10a or 20a. Computers 10a and 20a connect as server to server system 40 via the Internet 32. In addition, the communication means available to sellers and buyers include dedicated terminals 10d and 20d and wired and wireless telephones 10b, 10c, 20b and 20c provided by the virtual exchange operator. Dedicated terminals 10d and 20d have their own display screens and can be connected to the Internet wirelessly, thus providing functions that are not much different from personal computers 10a or 20a in terms of using the services provided by this virtual exchange. In the case of the wireless telephones 10c and 20c, a service similar to the dedicated terminals 10d and 20d may be used through the wireless Internet service. To this end, the virtual exchange operator enters into a service contract for the wireless Internet with the carrier to receive a separate service code. In the wireless dedicated terminals 10d and 20d, a data communication path passes through a relay antenna 36, a telephone station 34, and the Internet 32. The wired / wireless telephones 10b, 10c, 20b, and 20c exchange information with the virtual exchange side using the auto answering function (ARS) through the relay antenna 36 and the telephone station 34, or the telephone 54 or facsimile (not shown). The information exchange directly with the person in charge of the virtual exchange, etc., the person in charge of the virtual exchange is also possible to input the data related to the sale or purchase through their computer 50 on behalf of the seller or buyer.

1 schematically illustrates the exchange of information between a server and a client for multilateral transaction conclusion in accordance with the present invention. Here, the server becomes the virtual exchange operator system 40 and the client becomes various communication means 10 and 20 of the seller or the buyer. Hereinafter, a case where the seller or the buyer connects to the server system 40 using the computers 10a and 20a will be described as an example.

One cycle of transactions can be divided into three parts. The first is the input procedure of sales condition and purchase condition, and the second is to execute the intelligent transaction robot program with the entered sales condition and purchase condition until the input deadline has passed and process the data for multiple trades. It is a procedure to generate the final transaction conclusion result. Finally, it is a procedure to notify the seller and buyer of the result of the transaction conclusion and to perform post-processing such as payment.

The person who wants to trade through the virtual exchange, accesses the server system 40 of the virtual exchange operator through the wired / wireless internet 32 using his client computer 10a or 20a, goes through the member authentication process, and then views the product list and trades. Select a product you want to go through the procedure of transmitting the sales conditions or purchase conditions (steps S10 ~ S26).

The virtual exchange server system 40 receives the sales condition and the purchase condition data, stores them in a database, and executes the first and second transaction conclusion routines first according to a predetermined transaction conclusion schedule. Then, the parties concerned with the sales conditions or purchase conditions that cannot be concluded are notified and the third and fourth transaction execution routines are executed based on the newly-adjusted reconciled selling price and reconciled purchase price. Finalize the final transaction result and notify the parties concerned (steps S28 to S32). As will be described later, the transaction conclusion order is preferably carried out in the above four orders, but modifications may be made to omit or add a specific order.

Then, the post-processing process such as confirmation of the transaction details of the seller or buyer, transmission of the transaction details and fee details, deposit of the buyer, confirmation of the delivery of the goods to conclude the transaction, and remittance of the transaction to the seller after the fee is provided (S34). ~ S42 step)

Fig. 2 is a flowchart showing the execution procedure of a routine related to a seller or a buyer placing an order through the clients 10a and 20a and inquiring a transaction result.

When the clients 10a and 20a access the server system 40 via the Internet 32, after the normal membership registration and authentication procedures, the server system 40 transmits the initial web page of the virtual exchange (S50, Step S52).

The client 10a, 20a requests a product list (S18), and in response, the server system 40 transmits a list of tradeable products to the client 10a, 20a. As a result, a list of tradeable goods is displayed on the output screens of the clients 10a and 20a (step S54), and the seller or the buyer selects a product he / she wants to trade from the above product list (step S56).

Information regarding the product selection is transmitted to the server system 40 again, and the transaction status information at the present time of the selected product is transmitted to the clients 10a and 20a (step S26). The transferred transaction status information is displayed on the output screens of the clients 10a and 20a (step S58).

At this stage, the seller or buyer can participate in a new transaction or inquire about the result of the transaction.

In the case of participating in a new transaction, the client 10a or 20a checks whether it is a sale or a purchase, and inputs the sale conditions or the purchase conditions in each case (steps S60 and S62). The input condition data is transmitted to the server system 40 (step S26 or S66). If there is such a transmission, the server system 40 compares the transmission time with the time limit of the transaction and regards only the condition data that has not passed the time limit as valid data and stores it in the DB server 44. A message indicating that the data is not treated as valid data is transmitted to the client (step S68). In addition, when the virtual exchange operator requests the input of the adjusted sale price or the adjusted purchase price in relation to the pre- participated transaction, the corresponding data may be input in step S62 or S64 in response thereto.

On the other hand, if you make a selection on the screen (1059, 20a) to view the processing result of the participating transaction (step S59), the server system 40 in response to the transaction history to send the client to the client (10a, 20a) is displayed on the output screen (step S63).

The input of the transaction condition data and the inquiry of the transaction result on the client side is performed according to the above-described rough procedure, and a program for this is prepared separately.

3 is an overall flowchart of a server-side routine of a data processing method for multilateral transaction conclusion in accordance with the present invention. This is accomplished by the execution of the intelligent trading robot program of the present invention.

Intelligent trading robot program is automatically executed when the scheduled time (step S74). The scheduled time may be variously determined according to characteristics of a virtual exchange market or a trading product. For example, 9 am and 2 pm run twice a day. In a particular market, the program execution may not be run on a time base like this, but a method may be selected so that the program is automatically executed when a certain number of purchase condition or sales condition records are accumulated.

The transaction proceeds in several steps as follows.

(1) The first transaction determines whether to conclude a transaction based on the reference selling price and the reference purchasing price (step S76). Here, the base selling price and the base buying price are defined as the transaction price that the seller and the buyer desire as their first priority.

(2) The second transaction proceeds with respect to the quantity that is not made in the first transaction (step S78). One desirable criterion for closing a deal is the minimum selling price and the guilty purchase price, and the other is the minimum selling price and the base buying price. Here, the minimum selling price is the price of the standard selling price minus the discounted price, and the maximum buying price is the price of the standard purchasing price plus a premium. Therefore, the discounted price and the premium increase have the meaning of the second desired transaction price when the transaction is not made at the reference selling price and the reference buying price. In general, it would be desirable to allow discounts and premiums to be specified by the seller and buyer themselves. However, depending on the specificity of the market or trading product, it may be another option to allow the virtual exchange operator to specify the discounted price and the premium.

(3) The third transaction determines whether or not to close the transaction on the basis of the adjusted selling price and the adjusted purchase price that the seller or the buyer respecified for the remaining amount of the transaction that was not established even in the second transaction (S80). In this case, the adjusted selling price and the adjusted buying price are the desired trading price newly proposed to increase the success rate by narrowing the price difference between each seller and each buyer who failed the first and second transactions.

(4) The fourth transaction establishes a transaction for the price difference within the range based on an adjustable error range of a predetermined size with respect to the final balance in which the transaction was not made even in the third transaction (step S81). The adjustable error range may be arbitrarily determined by the virtual exchange operator in consideration of the market situation or the characteristics of the product, but each seller participating in the transaction may be notified to each buyer in advance.

Performing this multi-stage transaction conclusion process for a single commodity confirms the final transaction result for that commodity. The same procedure is repeated for other goods (step S82). Then, the seller and the buyer are notified of the conclusion of the transaction for the completion of the transaction processing, and post-processing such as payment of the price and confirmation of delivery of the product is performed (step S84).

4A to 4C are flowcharts illustrating an execution procedure of a routine for executing a first transaction (step S76) of server-side routines of a data processing method for multilateral transaction conclusion according to the present invention.

First, suppose that the confirmed sales conditions and purchase conditions immediately after the expiration of the transaction period are as shown in Table 4 below.

seller Quantity sold Standard selling price Discount buyer Purchase quantity Purchase price Increase S1 40 8000 800 B1 20 6000 850 S2 60 7900 100 B2 40 7000 700 S3 30 7500 400 B3 30 7500 400 S4 20 7200 800 B4 50 7200 800 S5 80 8200 1200 B5 10 7300 300 B6 10 8200 100 B7 20 7400 400

For the above transaction condition record, the sales condition record is sorted in descending order from the highest price of the reference selling price, and the purchasing condition record is sorted in descending order from the highest price of the reference purchasing price (steps S86 and S88). The sorting results rearrange the records as shown in Table 5 below.

seller Quantity Standard selling price Discount buyer Quantity Purchase price Increase S5 80 8200 1200 B6 10 8200 100 S1 40 8000 800 B3 30 7500 400 S2 60 7900 100 B7 20 7400 400 S3 30 7500 400 B5 10 7300 300 S4 20 7200 800 B4 50 7200 800 B2 40 7000 700 B1 20 6000 850

Next, the total number of purchase condition records and sale condition records are stored in variables BPtot and SPtot, respectively, and the total sales quantity and total purchase quantity are calculated (steps S90 and S92).

One of the important features of the first round of trade is that different processing algorithms are applied depending on the total sales volume and the magnitude of the total purchase volume. According to the pricing principle of the market, when the total quantity sold is greater than the total purchase quantity, that is, when the quantity supplied is greater than the quantity demanded, the buyer (buyer) takes the initiative in pricing, and vice versa. It is common to take the initiative in decisions. If the total sales quantity is more than the total purchase quantity, it is preferable to process the advantage in the buyer in price determination, and conversely, if the total purchase quantity is more than the total sales quantity, it is desirable to process it in favor of the seller. To this end, the size between the total sales quantity and the total purchase quantity is compared (step S94).

If the total sales quantity is greater than the total purchase quantity, the transaction is processed according to a routine as shown in the flowchart of FIG. 4B (steps S96 to S118). Determining whether a transaction is concluded by comparing with the standard selling price in descending order from the highest price of the standard purchasing price, and among the standard selling prices below any standard purchasing price, the difference between the standard purchasing price is small and the above arbitrary reference purchasing price and 1 Sign a transaction at a predetermined price. Here, the first predetermined price is preferably a standard selling price.

More specifically, the first transaction is processed by repeating the first loop described below until the end of the purchase condition record or the end of the sale condition record (S118 or S114).

In the first loop, first, the first current highest price among the sorted reference purchase prices is compared with the second current highest price among reference selling prices (step S96). In the first execution of the first loop, the first current highest price among the reference purchase prices is '8200'. Each time the variable i, the index value of the purchase condition record, increases by one (step S106 or S112), the highest price in the next order becomes the first current highest price among the sorted reference purchase prices. That is, each time variable i increases by 1, it is changed in the order of '7500'-> '7400'-> '7300' .... As a result of the comparison, when the first present highest price is greater than or equal to the second present highest price, the transaction is established at the second highest price by the smaller of the purchase quantity and the sale quantity (steps S98, S100, and S108). Subsequently, the purchase quantity and the corresponding sales quantity are subtracted by the amount of the transaction concluded (steps S102 and S108). As a result of the subtraction, if the remaining quantity of the quantity is lost (steps S104 and S108), the process proceeds to the next purchase condition record (steps S106 and S112), and returns to the beginning of the first loop and repeats the first loop again. When the sales volume is exhausted during the return process, the index value j of the sales condition record is increased by 1 and the next sales condition record is placed as a new comparison target (step S116).

The first loop will be exemplarily described with reference to 'Table 5' as follows. In the case where the total sales volume is large, 10 quantities are established at KRW 8200 between buyer B6 and seller S5. Since buyer B6 has exhausted its purchase volume, the buyer compares the base purchase price with the base selling price between B2 and B5. However, the standard selling price of 8200 won is higher than the standard buying of 7,500 won, so there is no transaction between the two. The same is true for sellers S1 and S2. As a result, since the selling price of 7500 won the seller S3 satisfies the condition (step S96) equal to or higher than the buying price of the buyer B3, the transaction is established at the price of the selling price of 7,500 won for the 30 quantities. Of course, even though the standard selling price of the seller S4 is 7400 won, although the reference purchase is less than 7500 won, priority is given to the smaller difference, so the transaction is made first with the seller S3. If the sales volume of seller S3 is less than the purchase quantity of buyer B3, a transaction with S4 may be established with respect to the purchase amount of buyer B3.

On the contrary, if the total sales quantity is less than the total purchase quantity, the transaction is processed according to the routine as shown in the flowchart of FIG. 4C (steps S120 to S142). Determining whether a transaction is concluded by comparing with the reference purchase price in descending order from the highest price of the reference selling price, and among the reference purchase prices above any reference selling price, the difference between the reference selling price is higher and the second random selling price and the second selling price are preferred. Sign a deal at a certain price. Here, the second predetermined price is preferably a reference purchase price.

More specifically, the first transaction is processed by repeating the second loop described below until the end of the purchase condition record or the end of the sale condition record (S138 or S142).

In the second loop, a third current highest price among the sorted reference selling prices is compared with a fourth current highest price among reference buying weights (S120). In other words, unlike the first loop, the comparison is made based on the standard selling price. As a result of comparison, when the third current highest price is less than or equal to the fourth current highest price, the first transaction is established at the fourth current highest price by the smaller of the purchase quantity and the sales quantity (S122, S124, Step S132). In addition, the purchase quantity and the corresponding sales quantity are subtracted by the quantity that the transaction is concluded (steps S126 and S132). As a result of the subtraction, if the remaining quantity of the quantity disappears (steps S128 and S132), the process proceeds to the next sale condition record (steps S130 and S136) and returns to the beginning of the second loop and repeats the second loop again. In the return process, when the purchase quantity is exhausted, the index value n of the purchase condition record is increased by 1 and the next purchase condition record is placed as a new comparison target (step S140).

The second loop will be exemplarily described with reference to 'Table 5' as follows. However, the actual data in Table 5 assumes that although the total sales volume is greater than the total purchase volume, the total purchase volume is larger for the purpose of describing the second loop. First, since the highest standard selling price is 8,200 won of seller S5, the same or higher standard purchase price satisfies the condition that buyer B6's base purchase is 8,200 won. Here, since the quantity sold is greater than the quantity purchased, the base purchase price is 8,200 won for only 10 purchase quantities. The seller still has to sell 70 more, but the seller S5 can no longer sell because there is no longer a base purchase price that is equal to or higher than his base price. The same applies to sellers S1 and S2. Therefore, since the standard selling price of seller S3 and the purchase price of buyer B3 coincide with each other, a transaction is established for 30 units with a standard purchase of 7500 won. Next, buyers B7, B5, and B4 are the buyers B7, B5, and B4, whose standard sales are equal to or higher than KRW7200, among which B3, which presents the highest reference purchase price, forms a transaction for 20 items at KRW7,400. do.

Next, FIGS. 5A and 5B are flowcharts illustrating an execution procedure of a routine (step S78) for concluding a second transaction among server-side routines of a data processing method for concluding a multilateral transaction according to the present invention.

The actual situation after processing the first transaction is that the total sales volume is greater than the total purchase volume, so it is shown in Table 6 below.

seller Quantity Standard selling price Middle price Lowest selling price buyer Quantity Purchase price Middle price Maximum purchase price S5 70 8200 7600 7000 B6 Transaction completed S1 40 8000 7600 7200 B3 Transaction completed S2 60 7900 7850 7800 B7 Transaction completed S3 Transaction completed B5 10 7300 7450 7600 S4 Transaction completed B4 50 7200 7600 8000 B2 40 7000 7350 7700 B1 20 6000 6425 6850

If necessary, such an intermediate transaction status is displayed on an output screen (step S144).

The second transaction is carried out on the remaining total sales and the remaining total purchases for which no transaction was established at the time of the first transaction. The basic data processing algorithm compares the current highest price among the highest purchase prices of each remaining purchase quantity in one-to-one order from the current lowest price of each lowest selling quantity of the remaining sales quantity to the lowest selling prices equal to or lower than the current highest price. The second transaction is executed at the third predetermined price in the order of the difference with the current highest price, and the current maximum price is changed to the next lowest selling price whenever the corresponding remaining purchase quantity is concluded. The second transaction is processed.

In more detail, first, the following is calculated for the individual remaining quantities of each seller and each buyer who are not concluded in the first transaction (step S146).

Minimum selling price = selling price minus selling price ...... (1)

Maximum purchase price = reference purchase price + premium ...... (2)

Intermediate selling price = (standard selling price + lowest selling price) / 2 ...... (3)

Intermediate Purchase Price = (Base Purchase Price + Highest Purchase Price) / 2 ...... (4)

Here, when calculating the intermediate selling price and the intermediate buying price, a predetermined weight may be further given to the buyer side price and the seller side price according to the quantity.

Of course, such calculations are not necessarily required at this stage, but may be automatically calculated and stored when entering the sales condition or purchase condition data into the database. Table 6 summarizes the results obtained by such calculations.

Next, the sales condition record and the purchase condition record regarding the individual residual quantity are sorted in ascending order of the lowest selling price and descending order of the highest buying price, respectively (steps S148 and S150). As a result of the sorting, the records in Table 6 are rearranged as shown in Table 7.

seller Quantity Standard selling price Middle price Lowest selling price buyer Quantity Purchase price Middle price Maximum purchase price S5 70 8200 7600 7000 B4 50 7200 7600 8000 S1 40 8000 7600 7200 B2 40 7000 7350 7700 S2 60 7900 7850 7800 B5 10 7300 7450 7600 S3 Transaction completed B1 20 6000 6425 6850 S4 Transaction completed B6 Transaction completed B3 Transaction completed B7 Transaction completed

After finishing the record sorting, the predetermined loop is repeated until the end of the purchase condition record or the sale condition record is met, as shown in the flowchart of FIG. 5B (steps S154 to S176). The predetermined loop compares the current highest price among the highest purchase prices corresponding to each of the remaining remaining purchase quantities with the current lowest price among the lowest selling weights of each remaining sales quantity (step S154), and the current highest price among the highest purchase prices. If the minimum selling weight is equal to or greater than the current lowest price, the second transaction is concluded at the third predetermined price by the smaller quantity of the purchase quantity and the sale quantity (steps S156, S158, and S166), and the second transaction is concluded. The purchase quantity and the sale quantity are subtracted by the quantity that has been made (steps S160 and S168), and if the remaining amount of the quantity disappears as a result of the reduction, the process moves to the next record (steps S162, S164, S168, and S179). If it is not the end of the record, the process returns to the beginning of the loop (steps S172, S174, and S176), and again goes through the process of executing the predetermined loop. Here, the third predetermined price may be determined based on various various criteria. As one criterion (A), the average value of the intermediate purchase price and the intermediate sale price of the buyer and seller in which the second transaction is established is the third predetermined price. Another criterion (B) is the median price between the lowest selling price and the highest buying price for which the second transaction is established.

If this is described according to the transaction price determination criteria of A proposal by taking the case of 'Table 7' as an example as follows. Initially, the current highest peak purchase price is 8000 won, and then, the basis is compared with the current lowest lowest selling price 7,000 won (step S154). As a result of the comparison, the condition of step S154 is satisfied, so that a transaction is formed between the buyer B4 and the seller S5 at 7600 won, which is the average value of the intermediate selling price and the intermediate buying price of both sides. Next, a transaction is formed between the buyer B2 and the seller S5 at 7475 won, which is an average price of 7350 won and 7600 won. Subsequently, a transaction is formed between the buyer B2 and the seller S1 at 7475 won, which is an average price of 7350 won and 7600 won. Finally, a transaction is established between the buyer B5 and the seller S1 at 7525 won, which is an average price of 7450 won and 7600 won.

The transaction status after processing the second transaction as described above is summarized in Table 8 below.

seller Quantity Standard selling price Middle price Lowest selling price buyer Quantity Purchase price Middle price Maximum purchase price S5 Transaction completed B4 Transaction completed S1 40 8000 7600 7200 B2 Transaction completed S2 60 7900 7850 7800 B5 Transaction completed S3 Transaction completed B1 20 6000 6425 6850 S4 Transaction completed B6 Transaction completed B3 Transaction completed B7 Transaction completed

Meanwhile, as another method, it is also possible to process the second transaction according to the algorithm shown in FIG. 5C instead of the processing algorithm of FIG. 5B. According to this scheme, a predetermined loop is repeated for the sorted record until the end of the purchase condition record or the sale condition record is met. If one cycle of the predetermined loop is based on the reference purchase price and the lowest selling price is compared between the lowest purchase price and the ascending order, the lowest selling price falls between the reference buying price and the highest buying price corresponding to the reference buying price (S154-1). Step) the transaction is concluded as much as the third predetermined price (steps S158-1 and S166-1), and the corresponding purchase quantity and the corresponding sale quantity are subtracted by the amount of the transaction concluded (steps S160 and S168), If the subtraction results in the remaining amount of the quantity being removed, the process proceeds to the next record (steps S164, S170, and S174) to process the second transaction configured to return to the beginning of the predetermined loop. Here, the third predetermined price may be defined by various criteria, but one preferred criterion is to set the minimum selling price of the record in which the transaction is established.

According to this plan, the transaction status after processing the second transaction is summarized in Table 9 below.

seller Quantity Standard selling price Middle price Lowest selling price buyer Quantity Purchase price Middle price Maximum purchase price S5 30 8200 7600 7000 B4 Transaction completed S1 B2 Transaction completed S2 50 7900 7850 7800 B5 10 7300 7450 7600 S3 Transaction completed B1 20 6000 6425 6850 S4 Transaction completed B6 Transaction completed B3 Transaction completed B7 Transaction completed

In the execution of the second transaction, the discounted price and the premium may be input as a percentage of the reference selling price and the reference buying price, and the method of applying the same may be modified in various forms. For example, a method of dividing the discounted price and the premium into multiple stages and performing the second transaction several times while applying the discounted price and the premium to each stage in turn. In other words, when performing the second transaction in the third stage, the minimum sales price and the maximum purchase price are determined by applying only one-third of each discounted price and the premium at the first time. The minimum selling price and the highest buying price are determined by applying the same method. Finally, each discounted price and each increase is applied.

Next, FIGS. 6A to 6C are flowcharts illustrating an execution procedure of a routine (step S80) for concluding a third transaction among server-side routines of a data processing method for concluding a multilateral transaction according to the present invention.

The third transaction is handled in such a way as to form a deal again on the basis of the new adjusted price for quantities that were not traded in the preceding transaction.

To do this, first, the virtual exchange operator extracts a person who requests price adjustment. The target of the price adjustment request may be based on several criteria. As a criterion, all of the parties involved in the remaining quantity that could not be concluded in the preceding transaction may be eligible for a price adjustment request. As another criterion, as described below, it can only be selected if the price error falls within a certain range. This may be a consideration considering the possibility of success of the coordination. If necessary, the result of the previous order is displayed on the output screen (step S178).

According to the second method, the sales condition records related to the remaining sales quantity are sorted in ascending order of the lowest selling price, and the purchasing condition records related to the remaining purchase quantity are sorted in descending order of the highest purchase price (steps S180 and S182). An example of the ordered state after sorting is shown in Table 10 below. For reference, the records of Table 8 or Table 8 should be sorted, but a new sample with a large number of records was introduced because the number of records is too small to be an example, and it is assumed that this is the state after the second transaction processing. Let's do it.

In this state, the first price error rate (%) is calculated for each highest purchase price i based on the lowest price among the lowest selling weights using the following equation (step S184).

1st price error rate (%) = [lowest selling price lowest-highest purchasing price (i)] / lowest selling weight ...... (5)

I is the index of the purchase condition record.

After the calculation is completed, only the purchase condition records in which the first price error rate (%) is within the threshold value are left and the rest are excluded from the third transaction (step S186).

Table 11 below lists purchasing condition records (shaded in Table 11 below) within this error rate range when the threshold of the first price error rate is 5%.

Similarly, the second price error rate (%) is calculated for each minimum selling price j based on the highest price among the highest purchasing weights using the following equation (step S188).

Second price error rate (%) = [highest price among highest purchase price-lowest selling price (j)] / highest price among highest purchase price ...... (6)

Where j is the index of the sales condition record.

After the calculation is completed, only the sales condition records in which the second price error rate (%) is within a predetermined value is left, and the rest is excluded from the third transaction (step S190).

Table 12 below lists sales condition records (shaded in Table 12 below) within this error rate range when the threshold of the second price error rate is 5%.

The sales condition record and the purchase condition record determined through the selection process are selected as the final adjustment target (step S192). Display the list if necessary. Confirmed adjustment targets are shown in Table 13 below.

The virtual exchange operator notifies the price adjustment request by setting a time limit to the sellers and buyers extracted for adjustment (step S194). Then, each party notified of the request for price adjustment obtains the adjusted purchase price and the adjusted selling price, which are presented again within the suggested time, and stores them in the DB server 44 (step S194). And if necessary, display the details. As mentioned above, the notification of the price adjustment request or the transmission and reception of the adjustment transaction price may utilize all available communication means, online or offline, such as e-mail, direct call using a wired or wireless telephone, and a Unified Messaging Service (UMS). There will be.

When the data about the adjusted transaction price is confirmed, the purchase condition records are sorted in descending order from the highest price of the adjusted purchase price (step S198), and the sales condition records are sorted in ascending order from the lowest price of the adjusted selling price (step S200). The total number of the purchase condition record and the sale condition record are counted and stored in a variable in advance (step S202).

Table 14 below is a table sorted in the same manner as above, reflecting the adjusted transaction price that has been reported back by each party in Table 13.

After such preparation, data processing for the third transaction is performed as shown in FIG. 6C (steps S204 to S226). The current highest price among each adjusted purchase price of the remaining purchase quantity is compared one-to-one in ascending order from the current lowest price of each adjusted selling price of the remaining sales quantity (step S204), and the current lowest price of the adjusted selling price is the current price of the adjusted purchase price. If it is equal to or lower than the highest price, the third transaction is processed at the fourth predetermined price (steps S206, S208, and S216). Here, the fourth predetermined price may be defined in various ways, and one preferred criterion is to set the average price of the adjusted purchase price and the adjusted selling price at which the third transaction is established as the fourth predetermined price. Subtract the amount from the purchase quantity and the sale quantity as much as the transaction is concluded (steps S210 and S218). Whenever the purchase quantity or sales quantity corresponding to the current adjusted purchase price and the adjusted selling price, which are compared, are exhausted by the transaction, the comparison target is changed to the next adjusted buying price or the next adjusted selling price (steps S214, S218, and S220). The third transaction is processed in such a manner that the routine is repeatedly processed until the end of the purchase condition record and the sale condition record are met (steps S222, S224, and S226).

The third transaction will be described based on 'Table 14' above. First, a transaction is formed at 6958 won, which is an average price of 7056 won and 6860 won, for 10 quantities between buyer B4 and seller S5. A transaction is formed at KRW 6978, which is an average price of KRW 7056 and KRW 6899, for ten quantities between buyer B4 and the next-tier seller S1. Now, since the purchase quantity of buyer B4 has been exhausted, a transaction is concluded at 6954 won, which is an average price of 7009 won and 6899 won, for 30 quantities between next-order buyer B2 and seller S1. Next, a transaction is established at 6951 won, which is an average price of 6963 won and 6938 won, for 10 items between buyer B5 and seller S2. The adjusted purchase price of the next-order buyer B1 is W6,916, and since there is no adjusted selling price that is lower than or equal to this price at the present time, the transaction is no longer established.

Table 15 below displays a list of remaining quantities that are not traded even in the third transaction, if necessary (S228).

7 is a flowchart illustrating an execution procedure of a fourth transaction execution routine (step S81) among server-side routines of a data processing method for multilateral transaction conclusion in accordance with the present invention.

In the fourth transaction, the price error rate of the adjusted selling price with respect to the adjusted purchase price is calculated with respect to the remaining unsettled quantity after the third trading execution (step S234), and the price error rate is set in advance to the preset adjustable error rate (e.g., 3). %) Or less (step S236), a fourth transaction is established between the adjusted purchase price and the adjusted sale price at a fifth predetermined price (steps S238, S240, and S252). Subsequently, the purchase quantity and the sale quantity are subtracted from the quantity established by the transaction (steps S242 and S254), and when the quantity is exhausted due to the establishment of the transaction, the next-order record is compared (steps S246, S248 and S256). This routine is applied to all remaining records (steps S230, S232, S250, S258).

Here, the adjustable error rate allows the virtual exchange operator to adjust the value in the server system 40 as necessary in consideration of various factors such as the situation of the trading market. In addition, the fifth predetermined price may be determined according to various criteria as well, but one exemplary criterion may be defined as the average price of the adjusted selling price and the adjusted buying price.

In the above description, the transaction process relating to one kind of commodity has been described. However, this process may be performed sequentially or simultaneously on various kinds of commodities (step S82).

On the other hand, in the above described by way of the first transaction to the fourth transaction by way of example, the present invention is not necessarily limited to the same transaction procedure, but also encompasses the transformation of each transaction order in various forms. do. For example, a second, third or fourth transaction may be selected by using only the first distance or in addition to the first transaction. Furthermore, one modification may be performed immediately after the first transaction (step S76) and through the third transaction (step S80) to perform the fourth transaction (step S81). As another variation, it may be possible to change the order of the second transaction (step S78) and the third transaction (step S80).

In the data processing process for the conclusion of the transaction, the transaction robot program stores the transaction conclusion of each transaction order in the storage means of the DB server 44. Then, when each seller or each buyer who accesses the server system 40 through the communication network inquires about the transaction execution history, the server system 40 responds to the request and the final transaction conclusion is confirmed by the execution of the transaction robot program. Send the details.

Finally, Figure 8 is a flow chart showing the execution sequence of the routine for the final post-process (step S84) of the server-side routine of the data processing method for multilateral transaction conclusion in accordance with the present invention.

After performing all the scheduled transaction processing routines, the transaction execution details are recorded in the DB server 44 (S260), and if necessary, the contents are output to the screen and / or document (step S262).

Each buyer and each seller are notified of the transaction details using various communication means, both online and / or offline (step S262). To do this, a transaction history notice to be sent to each seller and buyer is printed and mailed to each party. In parallel, each party is also notified of the transaction details by e-mail. The transaction statement also includes the details of the virtual exchange operator's charges.

The buyer who is notified of the transaction details must deposit the price of the commodity, and the virtual exchange operator confirms the purchaser's deposit through a payment system 60 such as a financial settlement agency or a bank. When the deposit is confirmed, the amount of money deducted from the commission (SC) from the purchase amount (BM) of the buyer is remitted to the seller (step S266).

Then, the post-processing, such as whether the goods were correctly delivered to the buyer (step S268). In principle, the seller delivers the goods directly to the buyer. For example, in the case of a flower product, it is common to confirm that the transaction is established and then to cut and package the package and deliver it. This is to be made directly to the buyer without going through the virtual exchange operator. Of course, it's possible to intervene with a professional shipper that connects the seller with the buyer.

As described above, the trading method or trading system according to the present invention provides an intelligent trading function so as to match the trading execution mechanism with the actual spot market environment and trading practices. Therefore, the parties can enjoy the same effect as trading in the real trading market without visiting the real trading market using online and other convenient wired or wireless communication equipment.

The trading system of the present invention not only enables efficient trading by providing adjustments according to market conditions such as price fluctuations and price corrections, but also provides a kind of coordinator role for prices and markets.

According to the transaction method according to the present invention, it is possible to maximize the transaction closing rate. As a result, the buyer or seller can be free from the hassle of having to deal with a transaction multiple times in order to sell or purchase a single product. In addition, the high closing rate can help both sellers and buyers because deals can be formed when the product is in the best condition.

Although the above has been described with reference to a preferred embodiment of the present invention, those skilled in the art will be variously modified and changed within the scope of the invention without departing from the spirit and scope of the invention described in the claims below You can. Accordingly, all changes that come within the meaning or range of equivalency of the claims are to be embraced within their scope.

Claims (50)

In the data processing method for closing a transaction using a computer system on the basis of sales conditions and purchase conditions for a predetermined product presented by a plurality of sellers and a plurality of buyers, Storage means of the computer system for receiving the sales conditions of each seller including the sales quantity of the predetermined product and the reference selling price, and the purchase conditions of each buyer including the purchase quantity of the predetermined product and the reference purchase price Storing in; And If the total sales volume is greater than the total purchase volume, the first transaction is processed while comparing with the base selling price in descending order from the highest price of the base purchase price, and the difference with the base purchase price among the base selling prices below any base purchase price. First of all, the transaction is concluded at the first predetermined price with the predetermined reference price, and when the total sales quantity is less than the total purchase quantity, the reference purchase price is compared with the reference purchase price in descending order from the highest price of the reference sales price. The first transaction is processed, and the first purchase price is greater than the reference selling price and the difference between the reference selling price is greater than the reference selling price. Dealing with a secondary transaction comprising the step of processing the secondary transaction: Data processing method for The method according to claim 1, wherein the first predetermined price and the second predetermined price are corresponding reference selling price and corresponding reference purchasing price, respectively. The method of claim 1, wherein the first transaction conclusion step, Sorting the sales condition record and the purchase condition record in descending order of the reference sales price and the reference purchase price, respectively; Calculating the total sales quantity and total purchase quantity and comparing the sizes of both; If the total sales quantity is greater than the total purchase quantity, repeating the first loop until the end of the purchase condition record or the sale condition record is met, wherein the first loop is the first of the sorted reference purchase prices. 1 If the first present maximum price is greater than or equal to the second present maximum price by comparing the present highest price with the second current highest price based on the second selling price, the second current highest price is the smaller of the purchase quantity and the sale quantity. When the first transaction is concluded, the purchase quantity and the sale quantity are subtracted by the quantity that the first transaction is concluded. If the remaining amount of the quantity disappears as a result of the subtraction, the process moves to the next record and returns to the beginning of the first loop. Redoing; And If the total sales quantity is less than the total purchase quantity, repeating the second loop until the purchase condition record or the end of the sales condition record is met, wherein the second loop is the first of the sorted reference selling prices. 3 The present maximum price is compared with the fourth current maximum price based on the reference purchase weight, and if the third current highest price is equal to or lower than the fourth current maximum price, the lower price of the purchase quantity and sale quantity is the fourth highest price. When the first transaction is concluded and the purchase quantity and the sale quantity are subtracted by the quantity that the first transaction is concluded, and if the remaining amount of the quantity disappears as a result of the subtraction, the process moves to the next record and returns to the beginning of the second loop. And executing the transaction again. 2. The data processing of claim 1, wherein the selling conditions and the buying conditions are input by the seller and each purchaser to the computer system through a wired or wireless communication network using a terminal thereof. Way. The method of claim 1, wherein the current highest price among the highest purchase prices of each remaining purchase quantity and the minimum selling price of each remaining sales quantity is calculated with respect to the remaining total sales quantity and the remaining total purchase quantity for which no transaction is established at the first transaction. The second transaction is processed at a third predetermined price in the order of the difference between the present highest price among the lowest selling prices which is equal to or lower than the current highest price in a one-to-one comparison from the current lowest price to the ascending order. The highest price of is processed in the second transaction in such a manner that the next lowest selling price is changed to the next lowest selling price whenever the corresponding remaining purchase quantity is all traded, and the highest buying price is the price plus the increase corresponding to the corresponding reference purchase price. The minimum selling price may further include a price obtained by subtracting a discounted price corresponding to the corresponding reference selling price. A data processing method for the conclusion of a transaction. 6. The data processing method of claim 5, wherein the discounted price and the premium are values designated by the seller and the buyer. 6. The data processing method of claim 5, wherein the discounted price and the premium are values designated by an operator of the computer system. The method of claim 5, wherein the second transaction execution step is sequentially performed while dividing each of the discounted price and the premium increase into multiple stages and sequentially applying the discounted price and the premium increase for each stage. The method of claim 5, wherein processing the second transaction comprises: Calculating the following for each seller and each remaining quantity of each buyer not concluded in the first transaction: Minimum Price = Base Price-Discount Peak purchase price = base purchase price + premium; Sorting the sales condition record and the purchase condition record relating to the individual remaining quantities in ascending order of lowest selling price and descending order of highest buying price, respectively; And Repeating a predetermined loop until the end of the purchase condition record or the sale condition record is reached, wherein the predetermined loop is configured to replace the current highest price among the highest purchase prices corresponding to each of the remaining purchase quantities sorted. When the current highest price among the highest purchase price is more than the current lowest price among the lowest selling weight compared to the current lowest price among the lowest selling weight of the second selling price at the third predetermined price by the smaller quantity of the purchase quantity and the selling quantity The transaction is concluded, and the purchase quantity and the sale quantity are subtracted by the quantity that the second transaction is concluded, and if the remaining amount of the quantity disappears as a result of the subtraction, the process moves to the next record and returns to the beginning of the predetermined loop and executes again. And a data processing method for concluding a transaction. 10. The data processing method according to any one of claims 5 to 9, wherein the third predetermined price is a middle price between the highest purchase price and the lowest selling price for which the second transaction is established. The data processing method of claim 10, wherein a predetermined weight is assigned to a buyer side price and a seller side price according to the quantity when the intermediate price is calculated. 10. The method according to any one of claims 5 to 9, wherein the third predetermined price is an average price of an intermediate sales price and an intermediate purchase price corresponding to the highest purchase price and the lowest selling price for which the second transaction is established, respectively, and the intermediate selling price is corresponding. And an average price of the lowest selling price corresponding to the standard selling price, wherein the intermediate purchasing price is an average price of the corresponding highest buying price and the corresponding standard purchasing price. The method of claim 1, wherein the following calculations are made for each remaining quantity of each seller and each buyer not concluded in the first transaction: Minimum Price = Base Price-Discount Peak purchase price = base purchase price + premium; Sorting the sales condition record and the purchase condition record relating to the individual remaining quantities in ascending order of lowest selling price and descending order of highest buying price, respectively; And Repeating a predetermined loop with respect to the sorted record until the end of the purchase condition record or the sale condition record is reached, wherein one cycle of the predetermined loop is based on the reference purchase price, in ascending order from lowest price to lowest sale price. If the lowest selling price being compared falls between the reference buying price and the highest buying price corresponding to the reference buying price, the trade is concluded by a quantity that is consistent with the third predetermined price to be compared, and corresponds to the quantity by which the transaction is concluded. And subtracting the purchase quantity and the corresponding sales quantity, and processing the second transaction configured to return to the next record and return to the beginning of the predetermined loop when the remaining amount of the quantity disappears as a result of the subtraction. How to process data to close a deal. 15. The method of claim 14, wherein the third predetermined price is the lowest selling price of the record on which the second transaction is concluded. 6. The method according to claim 5, wherein the request for price adjustment is notified to a predetermined range of parties among the related parties of the remaining unsettled quantity after the second transaction, and the adjusted purchase price and the adjusted selling price, which are presented again by the predetermined range of parties, are received. After storing in the storage means, the current highest price among the adjusted purchase prices of each remaining purchase quantity is compared one-to-one in ascending order from the current lowest price of each adjusted sales price of the remaining sales quantity to the adjusted purchase price. If it is less than or equal to the current highest price, the third transaction is processed at the fourth predetermined price, and the comparison is made whenever the purchase quantity or sales quantity corresponding to the current adjusted purchase price and the adjusted selling price, which are compared, are exhausted. Processing the third transaction in such a way that the subject changes to the next adjusted or next adjusted selling price Data processing method for entering into a transaction, characterized in that it further comprises. 16. The method of claim 15, wherein the parties to the predetermined range are all parties involved in the remaining balance. 16. The method of claim 15, wherein the parties within the predetermined range include a buyer corresponding to a purchase condition record in which the first price error rate falls within the first tolerance rate and a seller corresponding to a sale condition record in which the second price error rate falls within the second tolerance rate. Data processing method for entering into a transaction, characterized in that. 18. The method of claim 17, wherein the first price error rate is defined as the ratio of the lowest selling weight lowest price of the difference between the lowest selling weight lowest price and the highest purchasing price of each record, wherein the second price error rate is the lowest selling price and highest price of each record. A data processing method for concluding a transaction, characterized in that it is defined as the ratio of the highest price among the highest purchase weight of the difference between the highest purchase weight. 16. The method of claim 15, wherein the fourth adjusted price is an average price of the adjusted selling price and the adjusted buying price for which the third transaction is established. 16. The method of claim 15, wherein the unsettled remaining quantity after the third transaction is concluded at a fifth predetermined price between the adjusted purchase price and the adjusted sale price when the price error rate of the adjusted sale price to the adjusted purchase price is less than or equal to the adjustable error rate. And processing a fourth transaction. 21. The method of claim 20, wherein said adjustable error rate is changeable to another value through input means of said computer system. 21. The method of claim 20, wherein the fifth predetermined price is an average price of the adjusted selling price and the adjusted buying price. The method of claim 1, further comprising: notifying a request for adjustment of a price to a predetermined range of related parties of the remaining unsettled quantity after the first transaction, and receiving a reconciled purchase price and a reconciled sale price, which are re-presented by the parties of the predetermined range. After storing in the storage means, the current highest price among the adjusted purchase prices of each remaining purchase quantity is compared one-to-one in ascending order from the current lowest price of each adjusted sales price of the remaining sales quantity to the adjusted purchase price. If it is less than or equal to the current maximum price of, the second transaction is processed at the fourth predetermined price, and each time the purchase quantity or sales quantity corresponding to the current adjusted purchase price and the adjusted selling price, which are compared, is exhausted, Processing the second transaction in such a way that the subject changes to the next adjusted or next adjusted selling price. Data processing method for entering into a transaction, characterized in that it further comprises. 24. The method of claim 23, wherein the parties to the predetermined range are all parties involved in the remaining balance. 24. The method of claim 23, wherein the parties within the predetermined range are buyers corresponding to a purchase condition record in which the first price error rate falls within the first tolerance rate and sellers corresponding to a sale condition record in which the second price error rate falls within the second tolerance rate. Data processing method for entering into a transaction, characterized in that. 27. The method of claim 25, wherein the first price error rate is defined as the ratio of the lowest selling weight lowest price of the difference between the lowest selling weight lowest price and the highest purchasing price of each record, wherein the second price error rate is equal to the lowest selling price of each record. A data processing method for concluding a transaction, characterized in that it is defined as the ratio of the highest price among the highest purchase weight of the difference between the highest price among the highest purchase weight. 24. The method of claim 23, wherein the third predetermined price is an average price of the adjusted selling price and the adjusted buying price for which the second transaction is established. 24. The method according to claim 23, wherein the third selling price is adjusted to a fifth predetermined price between the adjusted purchase price and the adjusted selling price when the price error rate of the adjusted selling price with respect to the adjusted buying price is less than or equal to the adjustable error rate with respect to the remaining unsettled quantity after the second transaction. And processing the second transaction. 24. The method of claim 23, wherein said adjustable error rate is changeable to another value through input means of said computer system. 24. The method of claim 23, wherein the fifth predetermined price is an average price of the adjusted selling price and the adjusted buying price. In the data processing method for closing a transaction using a computer system on the basis of sales conditions and purchase conditions for a predetermined product presented by a plurality of sellers and a plurality of buyers, Providing a screen for inputting the selling condition and the buying condition to the terminals of the plurality of sellers and the plurality of buyers connected to the computer system through a communication network; Purchases of each buyer including sales conditions for each predetermined product provided by the terminal through the communication network, sales conditions of each seller including a reference selling price, quantity purchased for the predetermined product, and reference purchase price. Receiving conditions and storing them in storage means of the computer system; And Executing a program installed in the computer system with respect to the sales conditions and the purchase conditions stored in the storage means until a predetermined time limit is reached, and performing data processing for a transaction conclusion; The program, If the total sales volume is greater than the total purchase volume, the first transaction is processed while comparing with the base selling price in descending order from the highest price of the base purchase price, and the difference between the base selling price and any base selling price below the base purchase price The transaction is established at the first predetermined price with the predetermined reference purchase price first from the smallest, and when the total sales quantity is less than the total purchase quantity, the first purchase price is compared with the reference purchase price in descending order from the highest price. Wherein the first transaction is processed in such a manner that a difference between the reference selling price and the reference selling price which is greater than the reference selling price is greater than the reference selling price, and the transaction is established at the second predetermined price with the predetermined selling price first. Deal with a transaction, characterized in that it has a function to process A data processing method. 32. The method of claim 31, wherein the first predetermined price and the second predetermined price are corresponding reference selling prices and corresponding reference purchasing prices, respectively. The method of claim 31, wherein the program, With respect to the remaining total sales quantity and the remaining total purchase quantity in which the transaction was not established in the first transaction, the current highest price among the highest purchase prices of each remaining purchase quantity is increased in ascending order from the current lowest price of the lowest selling price of each remaining sales quantity. In comparison, the second highest transaction is established at the third predetermined price in the order of the difference between the present highest price among the lowest selling prices less than or equal to the current highest price, the current highest price being the corresponding remaining purchase quantity. It is further provided with the function of processing the second transaction in such a way that the next lowest selling price changes to the next lowest selling price each time the whole transaction is concluded. And the highest purchase price is a price obtained by adding a premium corresponding to a corresponding reference purchase price, and the minimum selling price is a price obtained by subtracting a discount price corresponding to the corresponding reference selling price. 34. The method of claim 33, wherein the discount price and the premium are values designated by the seller and the buyer by themselves. 34. The method of claim 33, wherein the discounted price and the premium are values designated by an operator of the computer system. 34. The method of claim 33, wherein the third predetermined price is an average price of an intermediate selling price and an intermediate buying price corresponding to the highest selling price and the lowest selling price for which the second transaction is established, respectively, and the intermediate selling price is the lowest selling price corresponding to the corresponding standard selling price. The median purchase price is an average price of the data processing method for entering a transaction, characterized in that the average price of the corresponding maximum purchase price and the corresponding maximum purchase price. 34. The method of claim 33, wherein the third predetermined price is an average price between the highest purchase price and the lowest selling price at which the second transaction is established. The method of claim 33, wherein the method is Notify the parties in a predetermined range of the unsettled residual quantity after the second transaction by wire or wireless communication to receive a reconciled purchase price and a reconciled sales price re-sent by the parties in the predetermined range. And further comprising the step of storing in the storage means, The program, Residual Purchase Quantity The current highest price of each adjusted purchase price is compared one-to-one in ascending order from the current lowest price of each adjusted selling price of the remaining selling quantity so that the current lowest price of the adjusted selling price is equal to or higher than the current highest price of the adjusted purchase price. If it is low, the third transaction is executed at the fourth predetermined price, and the comparison target is the next adjusted purchase price whenever the purchase quantity or sale quantity corresponding to the current adjusted purchase price and the adjusted selling price, which are compared, is exhausted. Or processing the third transaction in such a manner that the next adjusted sales price changes. 39. The method of claim 38, wherein the parties within the predetermined range include a buyer corresponding to a purchase condition record in which the first price error rate falls within the first tolerance rate and a seller corresponding to a sale condition record in which the second price error rate falls within the second tolerance rate. Data processing method for entering into a transaction, characterized in that. 39. The method of claim 38, wherein the fourth adjusted price is an average price of the adjusted selling price and the adjusted buying price for which the third transaction is established. The method of claim 38, wherein the program, For the remaining unsettled quantity after the third transaction, if the price error rate of the adjusted selling price with respect to the adjusted purchase price is less than or equal to the adjustable error rate, a fourth transaction is established between the adjusted purchasing price and the adjusted selling price at the fifth predetermined price. Data processing method for entering into a transaction, characterized in that it further comprises a function. The method of claim 31, wherein the method is Notifying the request for price adjustment among the parties involved in the unsettled residual quantity after the first transaction, and receiving and storing the adjusted purchase price and the adjusted selling price re-suggested by the parties in the predetermined range and storing them in the storage means. Further provided, The program, Residual Purchase Quantity The current highest price of each adjusted purchase price is compared one-to-one in ascending order from the current lowest price of each adjusted selling price of the remaining selling quantity so that the current lowest price of the adjusted selling price is equal to or higher than the current highest price of the adjusted purchase price. If it is low, the second transaction is executed at the fourth predetermined price, and the comparison target is the next adjusted purchase price whenever the purchase quantity or sale quantity corresponding to the current adjusted purchase price and the adjusted selling price, which are compared, is exhausted. Or processing the second transaction in such a manner as to change to a next adjusted selling price. The method of claim 42, wherein the program, A function of establishing a third transaction at a fifth predetermined price between the adjusted purchase price and the adjusted selling price when the price error rate of the adjusted selling price with respect to the adjusted purchase price is less than or equal to the adjustable error rate with respect to the remaining quantities not yet concluded after the second trading conclusion. Data processing method for entering into a transaction, characterized in that it further comprises. 44. The data processing method according to any one of claims 31 to 43, wherein the program further comprises a function of storing a transaction conclusion history for each transaction order in the storage means. 44. The method according to any one of claims 31 to 43, further comprising notifying each party by wire or wireless of the final transaction details determined by execution of the program. The method according to any one of claims 31 to 43, And in response to a request sent by the terminal of each seller or each purchaser connected to the computer system through the communication network, transmitting the final transaction conclusion details determined by the execution of the program. How to process data for fastening. In the data processing apparatus for processing a transaction between a plurality of sellers and a plurality of buyers, Interface means connected to an external wired or wireless communication network for data communication; Data storage means; And A data processing means connected to the data storing means, The data storage means stores a program for controlling the data processing means, The data processing means functions by execution of the program, The program receives from the plurality of sellers and the plurality of buyers the sales conditions including the respective sales quantity and the reference selling price and the purchase conditions including the purchase quantity and the reference purchase price and stores the data in the data storage means. If the total sales quantity received up to the time limit is greater than the total purchase quantity every time, the first transaction is processed while comparing with the base selling price in descending order from the highest price of the base purchasing price, and the above-mentioned random selling price below the base selling price First, the transaction is established at the first predetermined price with the arbitrary reference purchase price, and the reference purchase price is lowered from the highest price of the reference selling price, if the total selling quantity is less than the total purchase quantity. Process the first transaction, comparing Among the reference purchase prices higher than the quasi-sale price, the difference between the reference price is higher and the data is first established at the second predetermined price with the predetermined reference price, and the data is stored in the data storage means. Providing a function of processing to the data processing means. 48. The method of claim 47, wherein the program comprises: With respect to the remaining total sales quantity and the remaining total purchase quantity in which the transaction was not established in the first transaction, the current highest price among the highest purchase prices of each remaining purchase quantity is increased in ascending order from the current lowest price of the lowest selling price of each remaining sales quantity. In comparison, the second highest transaction is established at the third predetermined price in the order of the difference between the present highest price among the lowest selling prices less than or equal to the current highest price, the current highest price being the corresponding remaining purchase quantity. And providing the data processing means with the data processing means to process the second transaction in such a manner that the next lowest selling price changes to the next lowest selling price each time the entire transaction is concluded. The method of claim 48, The data processing device, Through the interface means, a request for price adjustment is sent to the parties within a predetermined range of the related parties of the remaining unsettled quantity after the second transaction, and the adjusted purchase price and the adjusted sales price, which are presented again by the parties in the predetermined range, are received. Storing in the storage means, The program, Residual Purchase Quantity The current highest price of each adjusted purchase price is compared one-to-one in ascending order from the current lowest price of each adjusted selling price of the remaining selling quantity so that the current lowest price of the adjusted selling price is equal to or higher than the current highest price of the adjusted purchase price. If it is low, the third transaction is executed at the fourth predetermined price, and the comparison target is the next adjusted purchase price whenever the purchase quantity or sale quantity corresponding to the current adjusted purchase price and the adjusted selling price, which are compared, is exhausted. Or providing the data processing means with the function of processing the third transaction in such a way that the next adjusted selling price is changed. The method of claim 49, wherein the program comprises: Processing the fourth transaction at the fifth predetermined price between the adjusted purchase price and the adjusted selling price when the price error rate of the adjusted selling price with respect to the adjusted buying price is less than or equal to the adjustable error rate for the remaining unsettled quantity after the third trading conclusion. And a data processing means for providing a function to the data processing means.