JP4192968B2 - Server computer that performs processing to distribute products - Google Patents

Description

  The present invention relates to a bidding method using a communication network, and in particular, a purchaser in a remote place participates in a transaction by sending bid order information to a bidder through an open communication network represented by the Internet. The present invention also relates to an automatic bidding method for automatically performing bidding based on the bidding order information.

  The wholesale market is a place to facilitate the smooth distribution of fresh food products and appropriate transactions. In particular, the price formed in the wholesale market has an extremely large influence on the production area and consumption. Therefore, in the wholesale market system, the price needs to be formed by quick and fair evaluation against the background of the supply and demand relationship of fresh food products, and the buying and selling transaction in the wholesale market is based on “auction or bidding” in principle.

  In response to these principles, advance sales (before the sales start time) instead of market transactions mainly involving bidding and bidding by increasing the size and remoteness of shipping production areas and increasing the size and concentration of the retail sector. Unclear transactions such as wholesale) have become mainstream.

  In order to overcome this situation, “information transactions” using advance shipping information from shippers are being studied at various places. One form for realizing this information transaction is to provide shipping information from the shipper in “Boku 7-117976” to the wholesaler and buyer, and based on this shipping information, There is a method in which a buyer makes a bid and makes a successful bid from the person with the highest price. In addition, as a method of mechanically processing transactions related to this information transaction, there is mechanical jellies (“Shigeo Akiya / Food Distribution Research Group, Is the Future in the Wholesale Market? Nihon Keizai Shimbun 1996,” p. 143). Machine jellies are those where all buyers gather at the auction site and present the desired price from each terminal. In addition, the machine jellies described in this document are not at the auction site. However, if the desired quantity and the desired price are entered in the desired item, bidding is possible at the time of the auction.

Japanese Examined Patent Publication No. 7-117976 Akiya Shigeo / Food Distribution Study Group Is the future in the wholesale market Nikkei Inc. 1996 143

  The Japanese Patent Publication No. 7-117976 is mechanization of bidding, and the machine jelly of the latter document is mechanization of bidding. For the mechanization of the latter, it is necessary to present prices several times between the competitor and the participant until the end of the auction. There was a need to instruct.

  Moreover, in the case of a bid, since a bid participant must cope with an occasional change according to the present condition, it is necessary for a bid participant to participate in online real time.

  An object of the present invention is to provide an automatic bidding method that solves the problems of the prior art and eliminates the need for a bidding participant to be in front of a bidding terminal when performing a bidding.

  Another object of the present invention is to provide an automatic bidding method that enables bidding on an open network such as the Internet.

  Another object of the present invention is to provide an automatic bidding method capable of automatically determining the bidding price.

  In order to achieve the above object, a bid is executed in the following procedure in a system in which a terminal on the bid participant side and a terminal on the bid performer side are connected via the Internet.

  The auction participant side terminal displays the auction target information received from the auction performer side terminal via the online line. The bid target information may be voluntarily obtained by the bid participant via the Internet or personal computer communication, or the bid performer may be forcibly notified to the participant by e-mail.

  The auction target item is displayed on the participant side terminal, and the auction target item is selected by the participant (the operator of the terminal). For the selected target, each participant displays the bid purchase quantity, the desired bid price, and the maximum allowable price when competing against the desired price (variable value indicating how much additional bid price is allowed). The bid order information specified above and including these pieces of information is created and transmitted to the bid execution side terminal.

  The display on the participant's terminal and the input of information can be realized by, for example, a browser widely known on the Internet, and a plurality of pieces of input information may be sent to the server by using a known browser function.

  In the bid order information, for each selected target, a flag that specifies whether to participate in the bid again after a successful bid is added, or a flag that specifies whether to purchase even if the purchased quantity is less than the desired quantity. It can be added. Also. The purchase quantity can be specified by any of a method of specifying a certain quantity, a method of specifying a quantity range, and a method of specifying all remaining quantity.

  The bid execution side terminal collects and stores a plurality of order information received via an online line such as the Internet. Such ordering information is sent from a plurality of bid participants. Then, when the execution start time of the bid, for example, every day at 10 o'clock, the bid starts. In the bid, the price is set first. For this price, an initial value for starting a bid may be input. Next, the stored ordering information is searched for a bid price that matches the set price. If there is a desired item, close those transactions, and if not, reset the price.

  Here, the price is reset when there is no desired project (when it is not in a competitive state), and the price is lowered, and when the quantity is not satisfied for the desired project ((the number of possible bids) <(the desired project), that is, the competitive state. Increase the bid price. In addition, whether there is a matching bid request is judged by comparing it with the bid price. If it is in a competitive state, (the set bid price) and ((the bid price) ± (maximum during competition) By comparing the relationship of the allowable price)), it is determined whether or not there is a bid request item that satisfies the condition.

  In addition, when the upper and lower limits of the product quantity range are specified, the product allocation is set by setting the lower limit value to the minimum quantity and the upper limit value to the maximum quantity. If not specified, the minimum quantity is set to the lower limit and the remaining quantity of the product is set to the maximum quantity. If the lower limit of the product quantity range is not specified, the minimum quantity is set to 0 and the maximum quantity is set to the upper limit. When the minimum quantity is not 0, it is determined whether the remaining quantity of the product is smaller than the minimum quantity when the minimum quantity is not 0, and the remaining quantity of the product is equal to or more than the minimum quantity Allocate the minimum quantity to buyers who have a minimum quantity of 0 and subtract the minimum quantity from the remaining quantity of the product, and the minimum quantity is 0 if the minimum quantity is 0 or if the remaining quantity of the product is greater than or equal to the minimum quantity The purchaser is a variable purchaser and the remaining amount of goods is greater than 0 and the variable purchaser If the remaining amount of the product is greater than 0 and there are variable buyers, the distribution amount to the purchaser is increased by 1, and it is determined whether the distribution amount matches the maximum quantity. Exclude buyers from variable buyers if they match the quantity.

  Also. The determination of whether or not there is a competition is to calculate the sum of buyers whose minimum quantity is not 0, and the remaining amount of goods is the sum of the sum of buyers whose minimum quantity is not 0 and the number of buyers whose minimum quantity is 0 The minimum quantity is not 0 when the remaining amount of the product is less than the sum of the total number of buyers whose minimum quantity is not 0 and the number of purchasers whose minimum quantity is 0. Calculate the sum of the minimum quantity of buyers who purchase even if the quantity is less than the minimum quantity among the purchasers, and the minimum quantity of the purchaser who purchases even if the remaining quantity of the product is less than the minimum quantity among the purchasers whose minimum quantity is not 0 It is determined whether or not the sum of the total number of buyers whose minimum quantity is 0 and the total number of buyers who purchase is less than the minimum quantity is less than the total quantity. The total of the minimum quantity and the minimum quantity of the buyer who purchases even the minimum quantity is 0 If there is less than the sum of the total number of buyers and the total number of buyers that are less than or equal to the minimum quantity, it is determined that multiple buyers compete and the remaining amount of goods is the sum and minimum of buyers whose minimum quantity is not 0. Purchases where the minimum quantity is 0 and the sum of the minimum quantity of buyers who purchases when the quantity is greater than or equal to the sum of the number of buyers whose quantity is 0, or among the purchasers whose minimum quantity is not 0. If the total number of people and the minimum number are equal to or greater than the sum of the total number of purchasers, it is determined that a plurality of purchasers do not compete.

  This is repeated until all the auction items are sold or until a certain price is reached.

  The processing executed by the participant terminal and the bid execution terminal can be realized by a computer program, and these programs can be stored in a storage medium such as a floppy (registered trademark) disk, an optical disk, and a hard disk. Also, it can be distributed via a network.

  As described above in detail, according to the present invention, it is possible to solve the problems of the prior art, eliminate the need for a participant to be in front of the auction terminal at the time of a bid, and ensure online real-time performance. There is a remarkable effect that it is possible to make a bid transaction on an open network which is difficult.

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

  1 and FIGS. 14 to 18 show the processing flow of this embodiment, FIG. 2 shows the overall configuration of the system of this embodiment, and FIGS. 3 to 13 show the screen images of this embodiment.

  First, an overall configuration diagram of the automatic bidding system shown in FIG. 2 will be described.

The automatic bidding system of the present embodiment is an electronic market server that collects and manages product information sent from the shipper client 13 and bid order information sent from the buyer client 12, and performs a bid based on the bid order information. 11, a plurality of purchaser clients 12 that place product orders with respect to the electronic market server 11, and a plurality of shipper clients 13 that provide product information of products to be shipped to the electronic market server 11. It is a connected system. The network 14 can be a LAN, the Internet, a personal computer communication network via a public line, or any other wired or wireless network.
(1) Device Configuration of Electronic Market Server 11 The electronic market server 11 has a bidding device configuration in which an input device 112, an output device 113, a storage device 114, and a communication cable 115 are connected to a computer 111.

  The input device 112 is a device for an operator to input information, such as a keyboard or a pointing device (mouse, pen, etc.).

  The output device 113 is a device that visually displays registered product information on a screen or a paper medium. For example, a CRT display, a liquid crystal display, a printer device, or the like can be used.

  The storage device 114 is a device that stores a program executed by the computer 111 and a large amount of data files, and a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, and the like can be used.

  The storage device 114 of the electronic market server 11 stores in advance information related to shipped products such as product type, grade, quantity, price, producer, etc. provided from the shipper client 13.

  The communication cable 115 is for transmitting information like a telephone line, and is preferably a cable that can communicate a large amount of data at high speed like an optical cable. In this case, when a configuration is adopted in which data is transmitted to and received from the communication network 14 using a wireless communication line, a wireless communication line interface is provided instead of the communication cable 115.

The electronic market server 11 may use a high-speed, large-capacity computer, workstation, or personal computer to provide product information in the storage device to a large number of other systems at the same time or to accept bid order information. .
(2) Device Configuration of Purchaser Client 12 The purchaser client 12 is obtained by connecting an input device 122, an output device 123, a storage device 124, and a communication cable 125 to a computer 121. Since these structures are basically the same as those of the input device 112, the output device 113, the storage device 114, and the communication cable 115, description thereof will be omitted.
(3) Device Configuration of Shipper Client 13 The purchaser client 13 is obtained by connecting an input device 132, an output device 133, a storage device 134, and a communication cable 135 to a computer 131. Since these structures are basically the same as those of the input device 112, the output device 113, the storage device 114, and the communication cable 115, description thereof will be omitted.
(4) Device Configuration of Communication Network 14 The device configuration of the communication network 14 can be configured by a high-speed communication network such as B-ISDN or ATM-LAN. Specifically, it is an open network represented by the Internet or a network using a dedicated line such as personal computer communication.

  The outline of the processing flow of this embodiment is as follows.

  First, the shipper client 13 registers product information to be shipped with the electronic market server 11.

  The electronic market server 11 notifies the registered product information to the purchaser client 12 using, for example, the WWW (World Wide Web). Then, order information from the purchaser client 12 is received until a predetermined time.

  The purchaser client 12 obtains product information from the electronic market server 11 by a method described later. When a product to be purchased is found, bid order information is created by a method described later and registered in the electronic market server 11. The purchaser client 12 can correct / delete the bid order information registered by a method to be described later if it is before the predetermined order information deadline.

  The electronic market server 11 manages and monitors bid order information. When the order information deadline time comes, the acceptance of the bid order information is terminated, and the bid is performed based on the bid order information received by the method described later. Then, the result of the auction is notified to the purchaser client 12 using, for example, WWW (World Wide Web), electronic mail or the like.

  The purchaser client 12 obtains the result of the bid from the electronic market server 11 by a method to be described later, and confirms the result.

  Hereinafter, each method will be further described with reference to the drawings.

  The purchaser client 12 accesses the electronic market server 11 using a WWW browser installed in the computer 121, and obtains product information. The display screen on this browser is the product information screen 21 shown in FIG. Here, a product number 211 and product attribute information are displayed as product information. The product attribute information includes a product type 212, a standard / color 213, a production area 214, a shipper 215, a quantity 216, a product image 219 such as a color photograph of the product, and the like. The product information can also include an order information deadline time 217 and a scheduled bid end time 218 as information related to the bid. When a purchaser who is a bid participant wants to purchase a displayed product, he / she presses an “order” button 221 attached to the product with the mouse.

  When the “Place Order” button 221 on the product information screen 21 shown in FIG. 3 is pressed, the auction condition input editor 31 shown in FIG. 4 appears. The bid condition input editor 31 displays a purchaser ID 311 indicating a bid participant and a product number 312 to be ordered. The purchaser ID may be, for example, the purchaser's e-mail address or other unique identifier. As the product number 312, the product number 211 of the product selected on the screen of FIG. 3 is automatically stored. The rule list 313 forms part of the ordering information sent to the electronic market server 11 and includes a bid desired price as a purchase condition of the product, the number of purchases, and a maximum allowable price at the time of competition for the desired price. For example, in Figure 4, “90 yen (+2 yen) for 80 box purchase” means that the desired bid price of the product is 90 yen, the maximum allowable price at the time of competition is +2 yen, and the number of purchases is 80 pieces. It shows that there is. In other words, the purchaser wants to buy the product for 90 yen, but if the customer competes with another person, it means that up to 92 yen may be paid. A field 314 is information for designating whether to participate in a bid after a successful bid.

  New rule registration button 321, rule correction button 322, rule deletion button 323, button 324 for raising rule priority, button 325 for lowering rule priority, button 326 for sending bid order information to the electronic market server 11, bid order A button 327 for canceling information creation is an icon group displayed on the screen.

  Next, when the purchaser presses the new registration button 321 or selects the one of the rules in the rule list 313 and then presses the correction button 322, the rule editor shown in FIG. 5 is displayed, and rule generation / correction is performed. . The rule editor 41 may be displayed by switching to the bid condition input editor 31 or may be displayed on the same screen using a multi-window technique.

  In the rule editor 41, a field 411 is used to select a price input method, and designates a case where a price is designated and a desire to buy at the lowest price. A field 412 in the vicinity thereof is a field for inputting a price when the price is designated. In a field 413, the maximum allowable amount at the time of competition is input. The field 421 is used to select a quantity input method that satisfies the purchase quantity condition. The field 421 is used to purchase all quantities that specify that all quantities that can be purchased by auction are purchased. There are three designation methods: a fixed quantity purchase and a range designation purchase in which the purchase quantity is designated by range. Further, in the vicinity of this field 421, a field 422 for inputting a quantity in the case of a fixed quantity purchase, and fields 423 and 424 for inputting a range in the case of a range designation purchase are provided. A field 425 is used to enter whether or not to purchase even below the desired quantity. In addition, two icons, a button 431 for registering in the rule list and a button 432 for canceling rule generation / correction in the middle, are displayed on the screen.

  When the rule is generated / corrected, the price condition is input in the fields 411 to 413, the quantity condition is input in the fields 421 to 425, and the registration button 431 is pressed. When the generation / correction of the rule is interrupted, the cancel button 432 is pressed.

  In the case where a range-designated purchase is made under the quantity condition and the upper limit is not specified, that is, when the upper limit is all the remaining amount, the field 423 is input only for the lower limit. If no lower limit is specified, only the upper limit is entered in field 424.

The generated rule can be deleted by a delete button 323. Since the generated rules are evaluated in the order of the rule list 313, priority change buttons 324 and 325 are used to change the priority.

  By pressing the send button 326, the bid order information to which at least the rule list 313 and a flag indicating whether or not to participate in the bid after bidding is added is transmitted to the electronic market server 11, and the bid participation is registered. The method of transmitting the order information at this time can be realized by using a function of a known browser for the Internet, for example, Netscape Navigator 3.0 which is a product of Netscape Corporation of the United States. When the registration number or registration time is transmitted from the electronic market server 11 after the registration is completed, it may be displayed on the output device 123 and stored in the storage device 124. The registration number sent from the electronic market server 11 may be used as an inquiry key for the electronic market server 11 at a later date. When seeing off the participation in the auction, the cancel button 327 is pressed to finish the creation of the auction order information.

  The purchaser client 12 obtains the bid registration status from the electronic market server 11 through the registration status screen 51 shown in FIG. The registration status screen 51 displays an ordered product list 511 that is a list of products ordered by the purchaser. On the screen, icons of a bid order information display / correction button 512, an order cancellation button 513, a message result display button 514, and a button 515 for closing the registration status screen 51 are also displayed. The ordered product list 511 displays a list of ordered products. Here, the date and time when the bid order information is registered, the target product number of the bid order information, and the flag indicating the end state of the bid are displayed, but other detailed information may be displayed. In addition, such ordering status may display ordering information from other purchasers.

  When displaying / correcting bid order information, the target order product is selected from the order product list 511 and the display / correction button 512 is pressed. Then, bid order information is displayed in the bid condition input editor 31. In the case of correction, new bid order information is generated based on the above-described method and registered in the electronic market server 11. When canceling the order, the target order product is selected from the order product list 511 and the cancel button 513 is pressed.

  When displaying the result, the target ordering product is selected from the ordering product list 511 and the result display button 514 is pressed. Then, a bid result screen 61 shown in FIG. 7 appears. The bid result screen 61 includes a successful bid result 611, a transaction process 612, a rule evaluation 613 included in the bid order information, and a button 614 for closing the screen.

  The successful bid result 611 includes a successful bid result regarding itself and the overall successful bid result. The overall successful bid result includes the winning bid price and the winning bid amount in the order of winning bids.

  The transaction process 612 includes price, quantity, and status. The situation indicates the situation at that time, for example, “No applicant” indicating that there is no buyer, “Successful bidder determination” indicating that there is a buyer and the winning bidder has been determined, and a price is generated to resolve the conflict. "Increase of competition, price increase" indicating that the price has been raised, "No increase in price without competition," indicating that the price has been raised for resolution, the competition has been resolved, There is “competition resolution, successful bidder determination” indicating that the price has been raised to eliminate the determination. When making a successful bid, the successful bid quantity is included.

  The rule evaluation 613 includes a behavior at the time of a bid of the rule included in the order information. The behavior at the time of bidding includes a successful bid price and a successful bid quantity in the case of a successful bid, a price lost in the competition if a successful bid cannot be made due to the competition, and a fact that it is not used if not used.

  Next, monitoring of bid order information at the electronic market server 11 will be described. FIG. 8 shows an electronic market monitor 71. The electronic market monitor 71 includes a monitor product number 711, a registered purchaser list 712, a registration number 713, a message field 714, a product change button 715, and an end button 716.

  When changing the product to be monitored, the product change button 715 is pressed and the product selection screen 81 shown in FIG. 9 is used. The product selection screen 81 includes a registered product number list 811, an OK button 812, and a cancel button 813. To change the monitored product, select the product to be monitored from the product number list 811 and press the OK button 812. When canceling the change, a cancel button 813 is pressed.

  The registered purchaser list 712 includes a registration number 7121, a purchaser ID 7122, a transmission time 7123 from the purchaser client 12 of the bid order information, and bid order information in the electronic market server 11 for each buyer who registered the bid order information. Reception time 7124 is included. The registration number 713 includes the current registration number of bid order information. In the message 714, when something occurs during monitoring, a message predetermined according to the occurrence is displayed.

  When the bid order information of the product to be monitored is received during the bid order information monitoring, as shown in FIG. 10, information 719 regarding the buyer who has sent the bid order information newly delivered to the registered buyer list 712 is displayed. At the same time, a message indicating that a new message has arrived is displayed in the message field 714. At this time, an operation for alerting the operator, such as blinking information on a newly registered purchaser or playing a sound, may be performed at the same time.

  Next, execution of bidding and monitoring of execution will be described. FIG. 11 shows a seri-monitor 91 that is a display content on the output device 113 of the electronic market server 11 when performing a bid. The line monitor 91 includes a product number 911 under bid, a purchase wish purchaser list 912, a purchase desired purchase number 913, a remaining product number 914, a current price 915, and a field 916 for visually displaying the current price (here, Transaction process 917 is included.

  The purchase wish purchaser list 912 includes a registration number 9121, a purchaser state 9122, a purchaser ID 9123, a desired quantity 9124, and a distribution quantity 9125 for each purchase desired purchaser. The purchaser state 9122 displays a state of “hope” for purchase, “abandon” for abandonment of purchase, “successful bid” for which a successful bid is determined, and the like.

  The price 915 and the field 916 move in conjunction with price fluctuations, and the gauge of the field 916 rotates counterclockwise as the price increases and clockwise as the price decreases. It is also possible to plot the price at each indication point in the field 916 for easier viewing. By doing in this way, it is provided to make it easier for a person watching the serimonitor 91 to visually determine whether the price is rising or falling.

  The transaction process 917 includes contents included in the transaction process 612 on the bid result screen 61 in the purchaser client 12. In addition, the successful bidder ID is included. In addition, a message for an operator monitoring the bid may be included.

  Next, examples of the bid monitor 91 during the bid are shown in FIGS.

  In FIG. 11, when the price reaches 90 yen, registration numbers 1, 3, and 4, that is, purchasers teramura, kosaka, and m-mori want to purchase. The desired quantities are 150, 60 and 80, respectively. Then, it is displayed in the transaction progress 917 that competition has occurred at 90 yen.

  FIG. 12 shows that the price has increased from the state of FIG. 11 to 93 yen. The current price 915 is 93, and the field 916 is rising accordingly. At the time of this 93 yen, purchasers teramura and m-mori with registration numbers 1 and 4 have given up purchasing. As a result, the conflict is resolved, and it is displayed in the transaction progress 917 that the conflict is resolved at 93 yen. When the price increases, the background color of the field 916 may be changed, a sound may be generated, etc. to emphasize that the price has increased.

  FIG. 13 shows where the successful bidder is determined after the conflict is resolved in FIG. Purchaser Kosaka with registration number 3 has made a successful bid. In the transaction progress 917, it is displayed that kosaka made a successful bid for 60 boxes at 93 yen, and the remaining number 914 has changed from 200 to 140.

  Next, the bidding method of the present invention will be described in more detail. FIG. 1 is a processing flow of the entire automatic bidding. Here, the auction is performed based on a “bid auction” method in which the auction is performed while lowering the price.

  First, an initial price is set (step 1101). This is a value that can be calculated, such as a fixed multiple of the average bid price of the previous day, a fixed multiple of the average bid price in the past, or a fixed multiple of the average bid price of the same product in other markets, and eliminates the suspicion of price manipulation by competitors. And a method that can maintain fairness.

  Next, the price is lowered by a predetermined amount (step 1102). If this price falls below a predetermined minimum price, the auction ends. If not, the process proceeds to Step 1104 (Step 1103). In step 1104, the purchase desired purchaser is searched by the purchase desired purchaser search routine. If there is a buyer who wishes to purchase, the process proceeds to step 1106, and if not, the process proceeds to 1102 (step 1105).

In step 1106, it is determined whether or not a race state is reached by a race state determination routine. If it is not in a competitive state, the process proceeds to step 1109 (step 1107). In the case of a conflict state, the conflict state is resolved by a conflict resolution routine (step 1108). Next, the product is distributed to purchase purchasers by the product distribution routine (step 1109). If there is a product remaining, go to Step 1102, and if there is no product, end the auction (Step 1110).
Next, the processing procedure of the purchase purchaser searching routine (step 1104 in FIG. 1) will be described based on FIG. If it is in a competitive state, all buyers who wish to purchase are not in a competitive state. The operation is repeated (step 1201).

  The operation up to step 1204 is repeated for all the rules excluding the rule fired once from all the rules held by the target purchaser (step 1202). Here, firing means to participate in a bid, and refers to a case where the set price of the bid matches the bid price or a case where it is included in the maximum allowable price for the bid price.

  Next, if the current price is in the competitive state, the sum of the specified price of the target rule and the maximum allowable price at the time of competition. If it is not in the competitive state, if the current price is greater than the specified price of the target rule, go to step 1204. Moves to step 1207 (step 1203).

If the price is larger than the specified price of the target rule, step 1203 is repeated until all of the rules excluding the fired rule from the buyer holding rule are completed (step 1204). When the repetitive processing is completed, the target purchaser is excluded from purchase desired purchasers (step 1205). The process is repeated until the loop condition in step 1201 is completed (step 1206).
If it is smaller than the designated price of the target rule in step 1203, the minimum desired quantity and the maximum desired quantity are set from the target rule. In other words, if the quantity specified in the target rule is full purchase, the minimum desired quantity is 0 and the maximum desired quantity is the remaining number. In addition, when the quantity designation of the target rule is quantitative purchase, the minimum desired quantity is set to 0, and the maximum desired quantity is set to the remaining number. In addition, if the quantity specified in the target rule is range-specified purchase and the upper limit is not specified, the minimum desired quantity is the lower limit, the maximum desired quantity is the remaining number, and if the lower limit is not specified, the minimum desired quantity is If the upper limit and the lower limit are both defined as 0, the maximum desired quantity is set as the lower limit value, and the maximum desired quantity is set as the upper limit value (step 1207).

  It is determined whether the remaining amount is smaller than the minimum desired quantity set in step 1207. If it is smaller, the process proceeds to step 1204. If it is larger, the process proceeds to step 1209 (step 1208). The target purchaser is the purchase purchaser, and the firing rule is the target rule (step 1209).

  Next, a detailed processing procedure of the competition state determination routine (step 1106 in FIG. 1) will be described with reference to FIG. First, the sum of the minimum desired quantities of purchasers who wish to purchase is calculated, and the sum is set to 1 (step 1301). The minimum desired quantity is set in step 1207 of FIG. If the remaining number is smaller than the sum of the total 1 obtained in step 1301 and the number of purchase-requested purchasers whose minimum desired quantity is 0, the process proceeds to step 1303. (Step 1302).

  Among the purchase desired purchasers whose minimum desired quantity is not 0, the sum of the minimum desired quantities of purchase desired purchasers who do not purchase if the quantity condition of the firing rule is equal to or less than the minimum desired quantity is calculated, and this is set to 2 (step 1303). ).

  The remaining number is the sum 2 obtained in step 1303, the number of purchase desired buyers whose minimum desired quantity is 0, and the purchase requesting purchaser whose minimum desired quantity is not 0. If it is less than the quantity and less than the sum of the number of purchase buyers to be purchased, the determination routine is terminated as a competitive state, and in the case above, the routine proceeds to step 1305 (step 1304).

  Among the purchase desired purchasers whose minimum desired quantity is not 0, even if the quantity condition of the firing rule is equal to or less than the minimum desired quantity, the minimum desired quantity of the purchase desired purchaser is set to 0, and the determination routine is terminated as an allocation possible state (step) 1305).

  Next, a detailed processing procedure of the conflict resolution routine (step 1108 in FIG. 1) will be described. In the conventional bidding method, bidding is performed by lowering the price, but the conflict resolution in the present invention is characterized in that it is performed by raising the price once a competitive state is reached.

  First, when competition occurs, the price is increased by a predetermined amount (step 1401). If the rising price exceeds a predetermined reference value, the process goes to Step 1407, and if not, the process goes to Step 1403 (Step 1402).

  The purchase desired purchaser is searched by the purchase desired purchaser search routine shown in FIG. 14 (step 1403). If there is a purchase purchaser, the process proceeds to Step 1405, and if not, the process proceeds to Step 1407 (Step 1404). Next, it is determined whether or not it is in a competition state by the competition state determination routine of FIG. 15 (step 1405).

  If it is in a competitive state, the process proceeds to step 1401. If not, the process is terminated (step 1406). If the process moves to step 1407, the previous price state is restored. In this case, returning the state relating to the purchase purchaser is also included.

  Next, the processing flow of the merchandise distribution routine (step 1109 in FIG. 1) is shown using FIGS. The minimum desired quantity and the maximum desired quantity in the following processing are those set in step 1207 of the purchase desired purchaser search routine in FIG.

  First, the processing up to step 1507 is repeated for all purchase purchasers in the order of the smallest desired quantity, in the order of registration of the bid order information to the electronic market server 11 in the same case (step 1501). If the minimum desired quantity of the target purchaser is not 0, the process proceeds to step 1503, and if it is 0, the process proceeds to step 1506 (step 1502). If the remaining amount is greater than or equal to the minimum desired quantity of the target purchaser, the process proceeds to step 1504, and if it is smaller, the process proceeds to step 1508 (step 1503).

  The minimum desired quantity is allocated to the target purchaser, and the remaining amount is reduced by the minimum desired quantity (step 1504). If the quantity designation of the firing rule of the target purchaser is not the quantitative purchase, the process proceeds to step 1506, and if the quantity purchase is the quantitative purchase, the process proceeds to step 1507 (step 1505). The target purchaser is the purchase quantity variable purchaser (step 1506).

  The processing from step 1501 is repeated until the condition of loop 1 is completed (step 1507). In step 1508, if the target buyer's firing rule is less than the desired quantity, the process proceeds to step 1509, and if not, the process proceeds to step 1507. Then, all the remaining amount is distributed to the target purchaser (step 1509), and the process is terminated.

  If it is determined in step 1507 that a product remains and there is a purchase quantity variable purchaser, the process proceeds to step 1511. If there is no product or there is no purchase quantity variable purchaser, the process ends (step 1510). .

  As loop 2, the processing up to step 1516 is repeated for all purchase quantity variable purchasers (step 1511). The distribution amount of the target purchaser is increased by 1 (step 1512). If the distribution amount of the target purchaser is the same as the maximum desired quantity, go to Step 1514. If not, the process proceeds to step 1515 (step 1513).

  In step 1514, the target buyer is not a purchase quantity variable purchaser. If the product remains, the process proceeds to step 1516, and if not, the process ends (step 1515). In step 1516, the process is repeated for all purchase quantity variable purchasers.

  Although the detailed embodiment has been described above, a specific automatic bidding method will be described with reference to FIGS.

  FIG. 19 shows a condition 2010 in automatic bidding, and FIG. 20 shows a registered purchaser and bidding order information 2020 thereof. The auction conditions 2010 include quantity, initial price, price reduction range, minimum price, competitive increase rate, and maximum increase rate. The registered purchaser and the bid order information 2020 include a bid rule for each registered purchaser and a flag indicating whether or not to participate in a bid after a successful bid.

The electronic market server 11 performs a bid using the registered purchaser and the bid order information 2020 based on the conditions included in the bid conditions 2010. Hereinafter, processing for each price of operation contents will be described.
(1) 100 yen to 96 yen The price is lowered by a predetermined amount (1 yen) from 100 yen, but there is no purchase buyer even if it is lowered to 96 yen, so the price is further lowered.
(2) 95 yen Purchaser A appears as a purchase purchaser who agrees with the rule 2021 of purchaser A, that is, the price condition (95 yen). At this time, since the desired quantity of the purchaser A is 60 boxes with respect to the remaining 200 boxes, no competition occurs. Therefore, the desired quantity of 60 boxes is allocated to the purchaser A, and the remaining quantity is 140 boxes. The bid resumption price may be a successful bid price of 95 yen, the next price of 94 yen, or an amount increased by a certain percentage, but here, it is resumed at the successful bid price.
(3) 95 yen to 91 yen The price is lowered by a predetermined amount (1 yen), and even if the price is reduced to 91 yen, there is no purchase buyer, so the price is further lowered. Purchaser A's rule 2021 is not subject to evaluation because a transaction has been established.
(4) 90 yen Purchaser B's rule 2022 and purchaser C's rule 2023 are ignited, and purchaser B and purchaser C appear as purchase purchasers. At this time, since the desired quantity is 180 boxes of 100 boxes and 80 boxes for the remaining 140 boxes, a conflict occurs. For this reason, the price is increased by a predetermined amount (1 yen) to eliminate the competition.
(5) 91 yen, 92 yen Since the maximum allowable price at the time of competition of the rule 2022 of the buyer B is 2 yen and the maximum allowable price at the time of the competition of the rule 2023 of the buyer C is 4 yen, the prices are 91 yen, 92 yen. Even if the price is raised, both the buyer B and the buyer C are willing to purchase, the competition is not resolved, and the price is further raised.
(6) 93 Yen Since the price exceeds the maximum allowable price (+2 Yen) at the time of competition in the rule 2022 of the purchaser B, the purchaser B gives up the purchase and the competition is resolved. Since the purchaser C is within the maximum allowable price (+4 yen) at the time of competition in the rule 2023 of the purchaser C, the purchase is still desired and the transaction is concluded. Therefore, the desired quantity of 80 boxes is allocated to the purchaser C, and the remaining quantity is 60 boxes.
(7) 93 yen to 89 yen Since the competition has been resolved, the price once increased in the competitive state is reconciled with the remaining number. At the restarted price of 93 yen, there is no purchase buyer, so the price is reduced by a predetermined amount (1 yen). If the price is reduced to 90 yen, it matches the price specified by buyer B, but the remaining amount is 60 boxes and does not match the purchase conditions of buyer B, so the transaction with buyer B is not established. Therefore, the price is further reduced.
(8) 88 yen Since there is no purchase purchaser at 89 yen, if the price is further reduced to 88 yen, the rule 2024 of the purchaser D is ignited, and the purchaser D appears as a purchase purchaser. At this time, since the remaining amount is 60 boxes and the minimum desired quantity is 50 boxes, no competition occurs. First, 50 boxes of the minimum desired quantity are allocated to the purchaser D, and the purchase desired quantity variable purchaser is assumed. Since the remaining amount is 10 boxes, the remaining amount of 10 boxes is distributed to the purchaser D who is the purchase desired quantity variable purchaser. As a result, the purchaser D purchases 60 boxes. As a result, the remaining amount becomes 0 boxes, and the auction ends.

  As described above, according to the present embodiment, the purchaser client 12 registers the rules regarding the bid in the electronic market server 11 as bid order information, and the electronic market server 11 performs the bid based on the bid order information. Sometimes it is not necessary for the purchaser client 12, i.e. the bidder, to be in front of the bid terminal.

  Also, by including purchase conditions in the rules, it becomes possible to automatically and flexibly respond to changes in the situation at the time of bidding, and online / real-time characteristics are not necessarily required. Therefore, it is possible to conduct auction transactions on an open network where it is difficult to ensure online real-time performance.

  Next, security measures will be described. In order to realize a safe bid, it is necessary to prevent malicious third parties from participating in transactions and to keep confidential data related to the bid (preventing eavesdropping and tampering). For this purpose, the method described below is used.

  First, when connecting to the electronic market server 11, any one or more of before obtaining product information, before sending bid order information, before obtaining bid order status, before changing bid order information, before canceling bid order information, and before obtaining bid results Personal authentication is performed by sending a purchaser ID and a password from the purchaser client 12 to the electronic market server 11 at the timing.

  The purchaser ID and password are distributed via telephone, FAX, mail, or communication network 14 when the purchaser client 12 is registered as a purchaser of the electronic market server 11.

  Next, cryptographic processing is performed on various information exchanged between the electronic market server 11 and the purchaser client 12. The encryption method used in the encryption process may be either a public key encryption method such as RAS or a common key encryption method such as DES. When the purchaser client 12 is registered as a purchaser of the electronic market server 11, the encryption key is distributed via a storage medium such as an IC card or FD, or the communication network 14.

  By taking the above measures, it is possible to prevent participation by third parties who do not know the purchaser ID and password, and to prevent wiretapping and falsification of data related to bidding for people who do not have the encryption key. Can do.

It is a whole processing flow figure of the automatic bid method in the embodiment of the present invention. It is a system configuration figure showing an embodiment of the present invention. It is a merchandise information provision screen in the embodiment of the present invention. It is a bid condition input editor in the embodiment of the present invention. It is a bid rule editor in the embodiment of the present invention. It is a bid order status screen in the embodiment of the present invention. It is a seri result screen in the embodiment of the present invention. It is an electronic market monitor in the embodiment of the present invention. It is a selection screen of goods monitored with an electronic market monitor in an embodiment of the present invention. It is an electronic market monitor when there is a new registrant in the embodiment of the present invention. It is a bid monitor at the time of competition in the embodiment of the present invention. It is a bid monitor at the time of the conflict resolution in embodiment of this invention. It is a bid monitor at the time of successful bid decision in the embodiment of the present invention. It is a processing flow figure of a purchase wish purchaser search routine which shows the embodiment of the present invention. It is a processing flow figure of the competition determination routine which shows embodiment of this invention. It is a processing flow figure of the conflict resolution routine which shows embodiment of this invention. It is a processing flow figure of the goods distribution routine which shows the embodiment of the present invention. FIG. 17 is a continuation of FIG. 17 in the process flow diagram of the commodity distribution routine showing the embodiment of the present invention. It is a bid condition which shows embodiment of this invention. It is a registration purchaser and order information which show the embodiment of the present invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 11 ... Electronic market server, 111 ... Computer, 112 ... Input device, 113 ... Output device, 114 ... Storage device, 115 ... Communication cable, 12 ... Purchaser client, 121 ... Computer, 122 ... Input device, 123 ... Output device, 124: Storage device, 125 ... Communication cable, 13 ... Shipper client, 131 ... Computer, 132 ... Input device, 133 ... Output device, 134 ... Storage device, 135 ... Communication cable, 14 ... Communication network

Claims (4)

A server computer used in an automatic bidding system comprising a plurality of purchaser client terminals and an electronic market server computer,
In a server computer that includes a computer and a storage device, and performs processing for allocating products to purchasers that specify the quantity of products by range,
First means for receiving ordering information including designation of the quantity of the product from a plurality of purchaser's client terminals, and storing it in the storage device;
With reference to each ordering information in the storage device, for each purchaser of each ordering information, when an upper limit value and a lower limit value of the product quantity range are specified, the lower limit value is set to the minimum quantity, When the upper limit value is set for the quantity and the upper limit value of the product quantity range is not specified, the lower limit value is set for the minimum quantity, the remaining quantity of the product is set for the maximum quantity, and the product quantity range If the lower limit is not specified, the 0 minimum quantity, second means for setting an upper limit to the maximum quantity,
For each purchaser of each ordering information, determine whether the minimum quantity is not 0, and if the minimum quantity is not 0, determine whether the remaining amount of the product is smaller than the minimum quantity, If the remaining amount of the product is the lowest number or the allocate minimum quantity to purchase people the minimum quantity is not 0, and third means for processing to reduce the minimum quantity from the remaining amount of the product ,
It is determined whether there is a purchaser whose remaining amount of the product is greater than 0 and the minimum quantity is 0, or a purchaser who distributes the minimum quantity and the minimum quantity is not 0, and changes the purchaser corresponding to the determination. A fourth means of setting as a buyer;
Fifth means for repeating the third means and the fourth means in order of increasing the minimum quantity for purchasers of order information in the storage device;
Sixth means for determining whether the remaining amount of the product is greater than 0 and there is a variable purchaser;
If the remaining capacity of the products are large and the variable purchase person than 0, allocating one to purchase humans is the variable purchase person, determine whether the allocation amount to the purchasing person coincides with the maximum quantity and, when the allocation amount to the purchasing person coincides with the maximum quantity, the purchase human excludes from processing object, the allocation amount is the maximum quantity of the or the purchase person if you exclude the purchase human A seventh means for performing a process of determining whether or not the remaining amount of the product is 0 if they do not match;
When the remaining amount of the product is not 0, the sixth means and the seventh means for the variable purchaser obtained by the fifth means among purchasers of the order information in the storage device a server computer having an eighth means for repeating the means descending order the minimum quantity. The server computer according to claim 1,
Said sixth means, when the remaining amount of the product is a is or wherein the variable purchase people not 0, the server computer comprising means for terminating the process for distributing the product. The server computer according to claim 1 or 2,
The third means includes
Means for determining whether or not the purchaser purchases even within the range of the quantity of the designated product when the remaining amount of the product is smaller than the minimum quantity;
A server computer having means for allocating the remaining amount of the product to the purchaser when purchasing even within the specified product quantity range. The server computer according to any one of claims 1 to 3,
A ninth means for calculating the sum of the minimum quantities of purchasers whose minimum quantity is not 0;
A tenth means for determining whether or not the remaining amount of the product is smaller than a sum of a minimum quantity of purchasers whose minimum quantity is not 0 and a number of purchasers whose minimum quantity is 0; Have
In the third means, when the remaining number of the products is equal to or more than the sum of the sum of the minimum quantities of purchasers whose minimum quantity is not 0 and the number of purchasers whose minimum quantity is 0, A server computer having means for determining whether or not the minimum quantity is not 0 for each purchaser of the ordering information.

Images