JP2005242671A - Reverse auction system, its execution method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a reverse auction system suitable for the case having an intermediate layer between a supplier and a buyer. <P>SOLUTION: An information processor for executing reverse auction RA is provided with a bid information storage means storing first price information offered for an objective commodity of the reverse auction by a supplier and second price information offered from the intermediate layer in association with each other, a distribution route storage means storing correspondence between the supplier and the intermediate layer, and reverse auction management means 102 referring to the correspondence between the supplier and the intermediate layer stored in the distribution route storage means 122 for carrying out the reverse auction based on a bidding price found by specifying a combination between the first price information and the second price information stored in the bid information storage means. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to an information processing technology for conducting a reverse auction, and more particularly to an information processing technology for conducting a reverse auction suitable when an intermediate layer exists on a distribution route for distributing products from a supplier to a buyer.

In recent years, a so-called reverse auction using the Internet has been known. A reverse auction is a competition in which multiple sellers present their own prices for the product conditions and desired amount presented by the buyer of the target product, and the buyer finally deals with the seller who offered the cheapest price. This is a bidding method. A technique related to such a reverse auction system is described in, for example, Japanese Patent Application Laid-Open No. 2003-331158 (Patent Document 1).
JP 2003-331158 A

  By the way, when there are a plurality of vendors on the distribution channel of the product targeted by the buyer buyer (for example, company A), the final price of the product is established after the price is determined by the plurality of vendors. It is normal to do. Here, a trader that affects the final price of such a product is called a product price determiner.

  The reverse auction is intended to obtain a price reduction effect of a product by participating in competitive bidding as a product price determiner as a supplier. For a product having a plurality of price determiners as described above. When conducting a reverse auction, it is considered that the effect of reducing the final price of a product differs depending on which price determiner Company A is a supplier of the reverse auction.

  For example, the distribution channel of a product is the manufacturer that produced the product, and the book company, agency, vendor, wholesaler, trading company, distributor, etc. that purchases the product from this manufacturer and provides it to company A If the cost is determined by the manufacturer, the price obtained by adding the commission of the booked company or the like to the cost determined by the manufacturer is provided to the company A as the final price of the product. In such a case, the price maker who has the most influence on the final price of the product is the manufacturer, so that the company A as a buyer costs more than performing a reverse auction with a book company as a supplier as the supplier. It is considered that a higher price reduction effect can be obtained by conducting a reverse auction with the manufacturer as the supplier.

  However, since the existing reverse auction framework is based on the premise that two parties that directly deal with on the distribution channel are buyers and suppliers, for example, when conducting a reverse auction with the above-described configuration, The company had to be a registered company that deals directly. Because a manufacturer can bid for the cost of a product for which it has a price decision right, but cannot determine the price of a registered company, etc., the final price of the product is given to the buyer, Company A. It is because it cannot bid.

  In other words, in the existing reverse auction framework, even if a buyer tries to conduct a reverse auction with an arbitrary price determiner existing on the distribution channel of the target product as a supplier, the buyer and the arbitrary price determiner If there are other price determiners in the middle (hereinafter referred to as “intermediate layer”), it is difficult to conduct a reverse auction with any given price determiner as the supplier. Met.

  Therefore, the inventors of the present application, as a result of deep consideration of the above problems, do not perform a reverse auction based on the relationship between the supplier and the buyer as in the past, but assume the relationship between the supplier, the buyer, and the intermediate layer. I came to think that the above problem could be solved if a reverse auction was conducted.

  Therefore, an object of the present invention is to provide a new framework capable of performing a reverse auction based on the relationship between a supplier, a buyer, and an intermediate layer.

  The present invention for solving the above problems includes a supplier terminal installed on the supplier side, a buyer terminal installed on the buyer side, and a target product (including intangibles) of a reverse auction (hereinafter referred to as “RA”). An information processing apparatus for performing RA connected to an intermediate layer terminal installed on an intermediate layer side existing on a distribution route distributed from a supplier to a buyer via a network, Bid information storage means for storing the first price information presented by the supplier and the second price information presented by the intermediate layer in association with each of the supplier or the intermediate layer, and storing the correspondence between the supplier and the intermediate layer Refer to the correspondence relationship between the distribution route storage means and the supplier and the intermediate layer stored in the distribution route storage means. And RA management means for executing the RA on the basis of the first price information and bid price obtained by specifying the combination of the second price information stored in the bid information storage means, characterized in that it comprises a.

  In the present specification, the “product” is a concept including not only a tangible object but also an intangible object such as a service. A “buyer” is a buyer of a product that is the subject of a reverse auction, and includes not only corporations such as companies but also individuals. The “supplier” and the “intermediate layer” are providers of products that are the targets of the reverse auction, and price determiners that influence the final price of the products. The former refers to the price determiner that is located at the most upstream position on the distribution channel that the buyer pays attention to (there is no further upstream), and the latter refers to other positions that are located between the supplier and the buyer that are noted on the distribution route. Refers to the price determiner. Any price determiner on the distribution channel can function as a supplier or an intermediate layer, and which price determiner is to be a supplier or an intermediate layer can be arbitrarily set according to RA specifications and buyer's wishes, etc. Is possible. For example, when there are a price determiner A, a price determiner B, a price determiner C, and a final purchaser (buyer) on the distribution channel of the product, if the buyer pays attention to the price determiner A, the price determination When the buyer A pays attention to the price determiner B, the supplier A and the price determiners B and C correspond to the intermediate layer, and when the buyer pays attention to the price determiner B, the supplier A and the price determiner C correspond to the intermediate layer. For example, when the buyer pays attention only to the price determiner C, the price determiner corresponds to the supplier, and there is no intermediate layer.

  In addition, when the RA management unit receives the first price information transmitted from the supplier terminal during the execution of the RA, the RA management unit specifies an intermediate layer corresponding to the supplier from the distribution route storage unit, and specifies the specified intermediate layer Bid processing means for reading out the second price information from the bid information storage means and calculating a bid price based on the read second price information and the received first price information; and a predetermined RA And a successful bid processing means for selecting, as a successful bidder, a supplier corresponding to the lowest bid price at that time when the end condition is satisfied.

  Further, the RA management means accepts the first price information transmitted from the supplier terminal and the second price information transmitted from the intermediate layer terminal and stores them in the bid information storage means during the execution of RA. A bid processing means for reading the first price information and the second price information matching the correspondence relationship between the supplier identified from the distribution route storage means and the intermediate layer from the price information storage means and calculating a bid price; When a predetermined RA termination condition is satisfied, a supplier corresponding to the lowest bid price at that time and successful bid processing means for selecting an intermediate layer as a successful bidder are provided.

  Furthermore, the bid processing means calculates a bid price based on the first price information and the second price information in accordance with a bid price calculation method provided from an intermediate layer.

  The RA management means includes first RA means for executing the first RA using the first price information transmitted from the supplier terminal as a bid price, and second price information transmitted from the intermediate layer terminal. A second RA means for executing a second RA as a bid price, wherein the first RA means sets a predetermined successful bid condition at that time when a predetermined first RA termination condition is satisfied. A plurality of suppliers to be satisfied are selected as successful bidders, and the second RA means receives second price information transmitted from an intermediate layer terminal of an intermediate layer corresponding to the supplier selected as the successful bidder in the first RA. Processing as a bid price, and when a predetermined secondary RA termination condition is met, selecting a combination of an intermediate layer and a supplier corresponding to the lowest bid price at that time as a successful bidder And it features.

  Still further, the RA management means includes first RA means for executing the first RA using the first price information transmitted from the supplier terminal as a bid price, and second price information transmitted from the intermediate layer terminal. Secondary RA means for executing the secondary RA using the bid price as the bid price, the primary RA means calculates a bid result for each intermediate layer, and a predetermined primary RA termination condition is satisfied In this case, a supplier corresponding to the lowest bid price at that time is selected as a successful bidder in units of intermediate layers, and the second RA means determines the successful bid price in the first RA of the supplier corresponding to each intermediate layer. Assuming that the second price information transmitted from the intermediate layer is processed as a bid price, and a predetermined second RA termination condition is satisfied, an intermediate corresponding to the lowest bid price at that time And selects the ear as the successful bidder.

  In addition, the present invention provides a supplier terminal installed on the supplier side, a buyer terminal installed on the buyer side, and an intermediate existing on the distribution channel through which the target product (including intangible items) of the reverse auction is distributed from the supplier to the buyer. An information processing method in an information processing apparatus for performing RA connected to each of an intermediate layer terminal installed on a layer side via a network, and a first price presented by a supplier for an RA target product Storing the information and the second price information presented from the intermediate layer in the bid information storage means in association with each of the supplier or the intermediate layer, and storing it in the distribution route storage means for storing the correspondence between the supplier and the intermediate layer The first information stored in the bid information storage means with reference to the correspondence relationship between the supplier and the intermediate layer Performing a RA based on the bid price obtained by specifying the combination of price information and the second price information, characterized in that it comprises a.

  The program of the present invention causes each step of the information processing method of the present invention to be executed on a computer. The program in this case can be installed or loaded on a computer through various media such as a CD-ROM, a magnetic disk, a semiconductor memory, and a communication network. It also includes the case where a computer program is recorded and distributed on a PC card or an option board.

  In this specification, the term “means” does not simply mean a physical means, but also includes a case where the functions of the means are realized by software. Further, the function of one means may be realized by two or more physical means, or the functions of two or more means may be realized by one physical means.

  According to the present invention, it is possible to provide a new reverse auction framework based on the relationship between suppliers, buyers, and intermediate layers.

  Hereinafter, a reverse auction system according to the present invention will be described in detail with reference to the drawings. In addition, “buyers”, which will be described later, are the buyers of the target product of the reverse auction, and “suppliers” are the price determiners that are positioned at the most upstream position on the distribution channels that buyers are paying attention to. Can set other price determiners located between the supplier and the buyer who are noted on the distribution channel.

[Overview of reverse auction system]
First, the configuration of an information processing system (hereinafter referred to as “RA system”) for performing a reverse auction according to the present embodiment will be described with reference to FIGS. 1 and 2. FIG. 1 is a block diagram showing a schematic configuration of the RA system. FIG. 2 is a block diagram showing the hardware configuration of the RA server.

  As shown in FIG. 1, an RA system 100 includes an RA server 1 as an information processing apparatus installed on the RA site operator side that operates RA on the site, and a supplier terminal as an information processing terminal installed on the supplier side. 2, an intermediate layer terminal 3 as an information processing terminal installed on the intermediate layer side, and a buyer terminal 4 as an information processing terminal installed on the buyer side, which are connected to a predetermined network N (LAN, Internet, dedicated line, Any of a packet communication network, a combination thereof, and the like may be used, including both wired and wireless). Here, a case will be described in which such an RA system is configured using the technology of the Web application server system.

  The RA server 1 typically has functions such as a Web server, an AP (application) server, and a database server. When receiving a predetermined request regarding RA transmitted from each terminal as a client according to the HTTP protocol, for example, It has a function of performing processing according to a predetermined request regarding RA and transmitting the processing result regarding RA to each terminal.

  A general-purpose computer having a CPU, ROM, RAM, external storage device, user interface, display, printer, and communication interface as shown in FIG. 2 can be applied to the RA server 1. The RA server 1 may be composed of a single computer or may be composed of a plurality of computers distributed on a network. In the RA server 1, the CPU executes various functions realizing means (FIG. 5) by executing a predetermined program (a program defining the processing contents of the RA according to the present invention) stored in a ROM, a RAM, an external storage device or the like. The RA server 1 is caused to function.

  On the other hand, the supplier terminal 2, the intermediate layer terminal 3, and the buyer terminal 4 mount a web browser, for example, and transmit a predetermined request regarding RA to the server 1 according to the operation of each operator, and processing results regarding the RA Is displayed on the Web browser.

  The supplier terminal 2, the intermediate layer terminal 3 and the buyer terminal 4 are each provided with a CPU, a ROM, a RAM, an external storage device, a user interface, a display, a printer, a communication interface and the like, and a user (supplier, intermediate layer) using each terminal. And the like, and can output information to the user. The supplier terminal 2, the intermediate layer terminal 3 and the buyer terminal 4 can be general-purpose personal computers. However, mobile terminals such as mobile phones and PDAs (Personal Digital Assistance) having a network connection function can be used. An apparatus may be used.

[Description of RA scheme]
Next, an RA scheme realized by the RA system 100 will be described with reference to FIGS. 3 and 4 are diagrams showing an RA scheme realized by the RA system. In the figure, “SP” indicates a supplier.

  Note that, in the RA scheme according to the present invention, the final price of the target product of RA is determined by each of the intermediate layers as the first price information presented by the supplier and the second price information presented by the intermediate layer. Calculated by applying to the price calculation method.

  Here, the “first price information” and the “second price information” can be arbitrarily set by the supplier and the intermediate layer according to their price structures. For example, if the supplier is a manufacturer and the middle layer is a book company, etc., the cost of the product is set in the “first price information”, and the cost is added to the “second price information”. Set the commission rate and commission to be used. If the supplier is a product raw material manufacturer and the intermediate layer is a product processing manufacturer, etc., the cost of the raw material is set in the “first price information” and the “second price information” Set costs for processing materials and other raw materials.

  The “final price calculation method” defines a process for calculating the final price of a product based on the first price information and the second price information, and is optional depending on the price structure of each intermediate layer. Can be set. For example, when the second price information is an intermediate layer fee rate, the calculation formula 1 of “final price = first price information × (1 + second price information)” is set, and the second price is set. When the information is an intermediate layer fee or processing fee, Formula 2 can be set as “final price = first price information + second price information”. Each calculation formula may be configured such that the second price information is determined according to the price range.

  Next, a conventional RA scheme and three RA schemes according to the present invention will be described.

  FIG. 3A shows a conventional scheme (conventional type) of RA. In the conventional type shown in the figure, when there is an intermediate layer on the distribution route, it can be seen that RA is executed with the intermediate layer as a bidder instead of the supplier. According to this configuration, since the first price information presented by the supplier, that is, the supplier is not subject to RA, it is difficult for the buyer to obtain a price reduction effect that has an impact on the target product.

  FIG. 3 (B) is a diagram showing a first RA scheme (supplier competitive type) according to the present invention. In the first scheme shown in the figure, even if there is an intermediate layer on the distribution route by disclosing the second price information presented by the intermediate layer in advance to the RA and reflecting it in the bid price The RA can be executed with the supplier as the bidder.

  Specifically, in the first scheme, when the supplier bids the first price information in RA, the first price information bid, the second price information of the intermediate layer set in advance, and the final price. According to this calculation method, the final price of the target product, that is, the bid price is calculated. Therefore, it is possible to execute RA with the price structure of the intermediate layer being glazed.

  FIG. 4A shows a second RA scheme (simultaneous bidding type) according to the present invention. In the second scheme shown in the figure, both the supplier and the intermediate layer are bidders in the RA, and the buyer is the chooser.

  In the second scheme, when the supplier bids the first price information and the intermediate layer bids the second price information in the RA, the first price information bid, the second price information, and the preset value are set. In accordance with the final price calculation method, the bid price of the target product is calculated. Therefore, as in the first scheme, the price structure of the intermediate layer is glazed and the RA with the supplier as the bidder is executed. Is possible.

  FIG. 4B is a diagram showing a third RA scheme (two-stage RA type) according to the present invention. The third scheme shown in the figure performs RA (primary RA) with the supplier as the bidder, and then performs RA (secondary RA) with the middle layer as the bidder. The third scheme is the third scheme A in which the first RA with the entire supplier as the bidder and the buyer as the selector is performed, and the intermediate layer corresponding to each of the suppliers as bidders in the middle layer unit. Can be divided into the third scheme B in which the first RA is performed.

  In the third scheme A, first, when the supplier bids the first price information in the first RA and the buyer selects a plurality of suppliers using the first price information as a bid price, The first price information of the supplier is notified to an intermediate layer on each distribution route. Subsequently, in the second RA, each intermediate layer determines the final price based on the notified first price information (the notified first price information and the company's second price information When a bid is placed on the final price obtained by applying the calculation method, the buyer selects an intermediate layer (and supplier) based on the final price. According to this configuration, it is possible to execute RA without disclosing the price structure of the intermediate layer to the supplier. Next, in the third scheme B, first, the first RA is performed for each intermediate layer (for each supplier existing on the route of the intermediate layer), and each intermediate layer selects a supplier. Subsequently, in the second RA, when each intermediate layer bids for the final price based on the first price information of the selected supplier, the buyer selects the intermediate layer (and supplier) based on the final price. According to this configuration, it is possible to execute RA without disclosing the price structure of the intermediate layer to the supplier or the buyer.

  In the third scheme A, it is common for all suppliers to provide equivalent products regardless of the intermediate layer, but in the third scheme B, products with different suppliers are provided depending on the intermediate layer. May be provided.

  As described above, in the RA scheme targeted by the present invention, the RA bidder and the selector are different for each scheme. The suppliers and buyers are basically bidders or selectors, but the middle layer is a bidder or selector depending on the scheme and situation. Note that the RA scheme targeted by the present invention is not limited to the configuration described above as long as the presence of suppliers, intermediate layers, and buyers is assumed. Each scheme can be subjected to arbitrary partial improvements or modifications depending on the RA specifications and the settings of users (RA server operators, buyers, intermediate layers, or suppliers).

[Functional configuration of RA system]
Hereinafter, functions of the RA system 100 for realizing each scheme will be described with reference to FIGS. 5 and 6. FIG. 5 is a block diagram illustrating a functional configuration diagram of the RA server according to this embodiment. FIG. 6 is a diagram illustrating an example of a data configuration of the storage unit of the RA server according to the present embodiment.

  As shown in FIG. 5, the server 1 has, as main components in the present invention, a control unit 10 that controls the entire operation of the server 1 for performing RA, and a storage unit for storing information necessary for RA processing. 12 and a communication unit 11 for performing data communication with each terminal.

  The control unit 10 includes an initial setting unit 101 and an RA management unit 102, and the RA management unit 102 includes a bid processing unit 103 and a successful bid processing unit 104. The storage unit 12 includes a bid information storage unit 121 and a distribution route storage unit 122.

  The initial setting unit 101 performs processing for setting initial information regarding RA. As the initial information setting, information according to RA can be arbitrarily set. For example, information relating to RA requirements (RA requirement information that defines the product targeted by RA, the highest price specified by the buyer, etc.) ), Information on the RA scheme to be executed (first scheme, second scheme, third scheme, etc.), information on participants (suppliers, intermediate layers and buyers) participating in RA, and calculating the final price For example, setting of calculation formulas and the like, and setting of information (distribution route information, etc.) regarding the correspondence between the supplier and the intermediate layer.

  The RA management means 102 performs processing for controlling the progress of RA and controls the operations of the bid processing means 103 and the successful bid processing means 104. For example, the RA management unit 102 transmits an RA start instruction to the bidder's terminal via the communication unit 11 when a predetermined RA start condition is satisfied. Further, when a predetermined RA termination condition is satisfied, the RA is terminated, and the RA termination result (successful bid result) is transmitted to the bidder or the selector's terminal via the communication unit 11.

  For the predetermined RA start condition and RA end condition, conditions according to RA specifications can be arbitrarily set. For example, when a disclosure time and an end time are defined, these times are used as conditions. can do. Further, the RA termination condition may include automatic extension under a predetermined condition.

  The bid processing means 103 starts accepting bid processing when the RA management means 102 starts RA. Specifically, when the communication unit 11 receives price information transmitted from the bidder's terminal in response to the bidder's input operation, a process of registering the received price information in the bid information storage unit 121 is performed. If price information has already been received, a process of updating the bid information storage unit 121 based on the received price information is performed (re-bidding).

  In addition, the bid processing means 103 performs processing for specifying the bid result at the target time point periodically or in accordance with the update timing of the price information. The bid result is progress information for notifying the bidder of the progress of the RA, and may include information indicating the possibility that the bidder can make a successful bid. For example, the bid processing means 103 specifies information indicating whether or not the bid price is the lowest bid price, the bidder's rank when the bid prices are arranged in order of the lowest price, the current lowest bid price, etc. It can be considered. In addition, when sending a bid result including a bid price, in principle, it is desirable not to send information on the bidder who bids the bid price to other bidders so that RA is performed fairly.

  The successful bid processing means 104 starts the successful bid processing when the RA management means 102 ends the RA. Specifically, referring to the bid information storage means 121, a bidder (successful bidder) satisfying a predetermined successful bid condition is selected at the end of RA. As predetermined successful bid conditions, conditions according to RA specifications and buyer's wishes can be arbitrarily set. For example, the configuration may be such that the lowest bid price (successful bid price) is specified, and the bidder who bids on the successful bid price is automatically selected as the successful bidder. The configuration may be selected arbitrarily by the buyer in consideration.

  The successful bid processing means 104 transmits the successful bid result to the bidder and the selector's terminals via the communication unit 11. The successful bid result is information for notifying the bidder or the selector of the successful bid result of the RA, and the contents according to the RA specification can be arbitrarily set. What is necessary is just to include the information which shows a price, and should just contain the information which shows whether it was successful at least to the bidder. The successful bid processing means 104, for example, makes a successful bid result, a list in which bid prices are arranged in the order of the successful bidder, the successful bid price, and the lowest price for the selected person, and the successful bidder determines whether or not the successful bid is successful and the successful bid price for the bidder. It can be considered as a result.

  The communication unit 11 is configured to be able to input / output information to the supplier terminal 2, the intermediate layer terminal 3, and the buyer terminal 4 via the communication network N (that is, to the supplier, the intermediate layer, and the buyer). Communication modules such as a PPP driver and a TCP / IP driver are provided.

[Data structure of RA system]
Next, the data configuration of each storage unit included in the storage unit 12 will be described with reference to FIG.

  As shown in FIG. 6, the bid information storage unit 121 includes a first price information table, a second price information table, and a bid result table. The distribution route storage unit 122 includes a distribution route table.

  The first price information table is for storing the price information of the supplier. For example, a supplier ID that uniquely identifies the supplier, a supplier name, and the first price information that is the price of the supplier are associated with each other. Stored.

  The second price information table is for storing the price information of the intermediate layer, the intermediate layer ID that uniquely identifies the intermediate layer, the intermediate layer name, the second price information that is the price of the intermediate layer, Are stored in association with each other.

  The bid result table is for storing information related to the bid result, and stores, for example, list information when bid prices at target time points from the start to the end of RA are arranged in ascending order. Accordingly, the bid price stored at the top of the bid result table at the end of RA becomes the lowest bid price.

  The distribution route table is used to store information (distribution route information) related to the distribution route of the target product, and stores correspondences (combinations) between suppliers and intermediate layers existing on the distribution route. The distribution route information typically stores the contents along the distribution route performed in the existing commercial transaction, but a new route can be stored if it can be implemented.

  Specifically, a route ID that uniquely identifies a route, a supplier ID of a supplier that constitutes the route, an intermediate layer ID of an intermediate layer that constitutes the route, a calculation formula for calculating a final price in the route, and the like Are stored in association with each other. Information based on the setting of the intermediate layer is stored in the calculation formula for calculating the final price. Arbitrary configurations can be adopted as the information storage form. For example, when setting a calculation formula for each intermediate layer, the calculation formula itself or a program defining a calculation procedure is stored separately. Alternatively, when a plurality of calculation formulas are defined in advance, identification information indicating the defined calculation formula may be stored. In the case where the calculation formula is positioned as an attribute of the intermediate layer, the intermediate layer ID and the calculation formula may be associated with each other and stored in the second price information table.

  One supplier may constitute a plurality of intermediate layers and a plurality of routes, or a plurality of suppliers and one intermediate layer may constitute a plurality of routes. In addition, when there is no intermediate layer on the supplier's distribution route, it is possible to register that fact and set the second price information to 0 when calculating the bid price.

[Processing flow of RA in the first scheme]
Next, the flow of processing by the RA server for realizing the first RA scheme (supplier competition type) according to the present invention will be described with reference to FIGS. The first scheme is characterized in that the second price information presented by the intermediate layer is disclosed in advance by the RA and reflected in the bid price. In the first scheme, the bidder is the supplier and the elector is the buyer. FIG. 7 is a flowchart showing the flow of RA processing according to the first scheme. FIG. 8 is a flowchart showing the flow of a bid result calculation process. FIG. 9 is a diagram illustrating an example of a bid result screen according to the first scheme.

  As shown in FIG. 7, the initial setting means 101 starts an initial setting process as a pre-process for starting the RA (STEP 101). For example, RA requirement information, participant information, etc. are set in an initial information storage means (not shown). Registration of participant information is performed by associating information of each company with a position (supplier, intermediate layer, buyer) in RA. The formula for calculating the final price uses the one presented by the intermediate layer. At this time, distribution route information (including a final price calculation formula) may be registered in the distribution route storage unit 122.

  The initial setting process in the first scheme includes a process of registering the second price information presented from the intermediate layer in the second price information table of the bid information storage unit 121. The registration of the second price information can adopt an arbitrary configuration according to the specification, and may be a configuration where the operator of the RA server 1 inputs the information submitted from the intermediate layer, The layer may be registered through the network N. Here, the latter case will be described.

  Upon receiving the second price information transmitted from the intermediate layer terminal 3 (STEP 102), the initial setting unit 101 registers the received second price information in the second price information table in association with the intermediate layer ID. (STEP 103). The second price information may be transmitted to the supplier terminal 2 of the corresponding supplier so that the supplier can grasp before starting the RA.

  Next, when the predetermined RA start condition is satisfied, the RA management unit 102 determines that the RA has started (YES in STEP 104), and transmits an RA start instruction to the supplier terminal 2 via the communication unit 11. Then, it instructs the bidding processing means 103 to start processing.

  The supplier of the supplier terminal 2 that has received the RA start instruction can operate the input means of the supplier terminal 2 to input the first price information. The supplier terminal 2 transmits the first price information to the RA server 1 in response to the input operation. The supplier terminal 2 can transmit the supplier ID and other necessary information in association with the first price information.

  On the other hand, when receiving the first price information and other related information transmitted from the supplier terminal 2 (STEP 105), the bid processing means 103 of the RA server 1 associates the supplier ID and the first price information with the first price information. Are registered in the price information table (STEP 106).

  Next, the bid processing means 103 performs a process of calculating a bid result in accordance with the registration process or periodic timing (STEP 107). The bid result calculation process will be described with reference to FIG.

  The bid processing unit 103 selects a predetermined distribution route from the distribution route storage unit 122, and extracts a supplier ID, an intermediate layer ID, and a calculation formula corresponding to the selected selected distribution route (STEP 201). Then, the first price information of the supplier is obtained from the first price information table based on the specified supplier ID (STEP 202), and the second price information of the intermediate layer is obtained based on the specified intermediate layer ID. 2. Obtained from the price information table (STEP 203).

  Next, the bid processing means 103 calculates the final price according to the acquired calculation formula (STEP 204). For example, when “route ID = route 01” is selected from the distribution route table of FIG. 6, the first price information of the supplier (ID = 101) constituting the route 01 is “¥ 1,000”. The second price information of the intermediate layer (ID = 201) is “10%”, and the calculation formula is set to “bid price = sale price × (1 + fee rate)”. Therefore, the bid price is “1,000 × (1 + 0.1) = 1,100 (bid price)”.

  Note that if there is no intermediate layer on the supplier's distribution route (for example, when “absent” is set in the intermediate layer ID), the first price information is set as the bid price as it is. As a result, it is possible to perform RA for both a supplier having an intermediate layer on a distribution route and a supplier having no intermediate layer.

  The bid processing means 103 stores the calculated final price in the bid result table as a bid price in association with the supplier and the intermediate layer (STEP 205). The bid price and the route ID may be stored in association with each other.

  The bidding processing means 103 determines whether or not all distribution routes have been selected. If not selected (No in STEP 206), the bidding processing means 103 returns to STEP 201 to similarly calculate bid prices for the remaining distribution routes. On the other hand, when all the distribution routes are selected (YES in STEP 206), the bid prices are rearranged in the order of low price (STEP 207).

  In the bid result table shown in FIG. 6, it can be seen that the bid results sorted in the order of low price are stored. In the above process, the case where the bid price is calculated for all the selected routes has been described. However, after the process is performed once for all the selected routes, the bid price is calculated only for the selected route whose price information is updated. You may do it.

  Returning to FIG. The bid processing means 103 transmits the bid result as RA progress information to the supplier terminal 2 (STEP 108). Moreover, it transmits to the buyer terminal 4 as needed. Each terminal displays the received bid result on the screen. FIG. 9 shows an example of a bid result screen displayed on the screen of the buyer terminal 4.

  The bid result transmitted to the supplier terminal 2 may be information indicating the possibility that the supplier can bid as described above, and the content can be arbitrarily set according to the specification. For example, it may be configured to transmit a bid price and information indicating whether or not the bid price is the minimum bid price, or may be configured to transmit only the ranking of the supplier in the bid result. In the latter case, the second price information of the intermediate layer is not disclosed to the supplier. The supplier can re-bidding based on the received bid result, and the supplier terminal 2 transmits the re-input first price information to the RA server 1.

  On the other hand, the bid result transmitted to the buyer terminal 4 can be arbitrarily set according to the specifications of the RA and the buyer's desire. For example, in FIG. 9, only the bid price is displayed, but the first price information of the supplier and the second price information of the intermediate layer may be displayed.

  On the other hand, the bid processing means 103 of the RA server 1 accepts and processes the bid for the first price information transmitted from the supplier terminal 2 until the RA management means 102 notifies the end of the RA (No in STEP 109). .

  Thereafter, when the RA management means 102 notifies the end of the RA (Yes in STEP 109), the bid processing means 103 ends the bidding process, and the successful bid processing means 104 starts the process. For example, the successful bid processing unit 104 acquires the lowest bid price at the end of RA from the bid result table and sets it as the successful bid price, and sets the supplier corresponding to the lowest bid price as the successful bidder. Then, the successful bid result is transmitted to the buyer terminal 4 and the supplier terminal 2 (STEP 110).

  As described above, according to the first scheme, since the price structure of the intermediate layer is disclosed in advance, RA can be implemented with the price structure of the intermediate layer being glazed. Even when there is an intermediate layer between them, it is possible to execute RA with the supplier as a bidder.

  In addition, since the buyer can perform RA by designating any price determiner existing on the distribution channel of the target product as a supplier, the method of utilizing RA is expanded, and the buyer has more variety. Price reduction effect can be obtained.

[Processing flow of RA in the second scheme]
Next, the flow of processing by the RA server for realizing the second RA scheme (simultaneous bidding type) according to the present invention will be described with reference to FIG. The second scheme is characterized in that both the supplier and the intermediate layer are bidders in one RA, and the buyer is the elector. FIG. 10 is a flowchart showing the flow of RA processing according to the second scheme.

  As shown in FIG. 10, the initial setting means 101 executes an initial setting process as a pre-process for starting RA (STEP 300). For example, RA requirement information, participant information, a final price calculation formula, and the like are set in an initial information storage means (not shown). In the second scheme, since the intermediate layer is also a bidder, the second price information presented from the intermediate layer is not registered as in the first scheme.

  Next, when the predetermined RA start condition is satisfied, the RA management unit 102 determines that the RA has started (YES in STEP 301), and sends the communication unit 11 to the supplier terminal 2 and the intermediate layer terminal 3 to send the RA start instruction. Send through. Then, it instructs the bidding processing means 103 to start processing. The supplier of the supplier terminal 2 that has received the RA start instruction and the intermediate layer of the intermediate layer terminal 3 can input the first price information and the second price information by operating the input means of the terminals 2 and 3. it can.

  Each terminal 2, 3 transmits the first price information or the second price information to the RA server 1 in accordance with these input operations. Each terminal 2 and 3 can transmit the supplier ID, the intermediate layer ID, and other necessary information to the RA server 1 in association with the first price information and the second price information.

  When the bid processing means 103 of the RA server 1 receives the first price information and other related information transmitted from the supplier terminal 2 from the communication unit 11 (STEP 302), the bid processing means 103 associates the supplier ID and the first price information with the first price information. 1 is registered in the price information table (STEP 303). Similarly, when receiving the second price information and other related information transmitted from the intermediate layer terminal 3 from the communication unit 11 (STEP 304), the bid processing means 103 associates the intermediate layer ID with the second price information. It is registered in the second price information table (STEP 305).

  Next, the bid processing means 103 performs a process of calculating a bid result in accordance with the registration process or periodic timing (STEP 306). Since the bid result calculation process can be executed according to the flowchart of FIG. 8 described in the first scheme, the description is omitted here.

  After completing the bid result calculation process, the bid processing means 103 transmits the bid result based on the bid result table to the supplier terminal 2 and the intermediate layer terminal 3 as RA progress information (STEP 307). Further, a bid result screen as shown in FIG. 9 is transmitted to the buyer terminal 4 as necessary.

  The bid result transmitted to the supplier terminal 2 and the intermediate layer terminal 3 may be information indicating the possibility that the supplier or the intermediate layer can bid, and the content can be arbitrarily set according to the specification. For example, it may be configured to transmit a bid price and information indicating whether the bid price is the minimum bid price, or may be configured to transmit only the ranking of the supplier and the middle layer in the bid result. Good. In the latter case, the second price information of the intermediate layer is not disclosed to the supplier, and the first price information of the supplier is not disclosed to the intermediate layer.

  The supplier and the intermediate layer can re-bidding based on the received bidding results, respectively, and the supplier terminal 2 and the intermediate layer terminal 3 receive the re-input first price information or second price information as the RA server 1. Send to.

  On the other hand, the bid processing means 103 of the RA server 1 accepts the bid information transmitted from the terminals 2 and 3 and processes it until the RA management means 102 notifies the end of the RA (No in STEP 308). . When re-bidding is performed from the supplier or the intermediate layer, the corresponding bid price is updated, and the bid result is updated based on the updated bid price.

  Then, the RA management unit 102 determines that the RA has been completed when a predetermined RA termination condition is satisfied (Yes in STEP 308), notifies the bid processing unit 103 of acceptance cancellation of the bid processing, and notifies the successful bid processing unit 104. Instruct the start of processing.

  The successful bid processing means 104, for example, specifies the minimum bid amount from the bid result table at the end of RA, sets the minimum bid amount as the successful bid amount, and wins the combination of the supplier and the intermediate layer corresponding to the minimum bid amount. Set as a user. Then, the successful bid result including the successful bid amount and the successful bidder is transmitted to the buyer terminal 4, the supplier terminal 2 and the intermediate layer terminal 3 through the communication unit 11 (STEP 309).

  As described above, according to the second scheme, since the intermediate layer is allowed to participate in RA together with the supplier as a bidder, the RA can be implemented with the price structure of the intermediate layer being glazed. Even when an intermediate layer exists with the supplier, it is possible to execute RA with the supplier as a bidder.

  In addition, since a plurality of price deciders that affect the final price of the product can participate in the competitive bidding, buyer procurement costs can be further reduced.

[Processing flow of RA in the third scheme]
Next, the flow of processing by the RA server for realizing the third RA scheme (two-stage RA type) according to the present invention will be described with reference to FIGS. The third scheme is characterized in that RA (primary RA) with a supplier as a bidder is performed, and then RA (secondary RA) with a middle layer as a bidder is performed. As described above, since the third scheme includes the third scheme A and the third scheme B, these two schemes will be described. FIG. 11 is a flowchart showing the flow of the first RA process according to the third scheme A. FIG. 12 is a flowchart showing the flow of the second RA process according to the third scheme A. FIG. 13 is a diagram illustrating an example of a bid result screen according to the third scheme A. FIG. 14 is a flowchart showing the flow of the first RA process according to the third scheme B.

  First, the flow of processing by the RA server for realizing the third scheme A will be described. In the third scheme A, a first RA is performed in which the entire supplier is the bidder and the buyer is the selector.

  As shown in FIG. 11, the initial setting means 101 executes an initial setting process as a pre-process for starting the RA (STEP 401). For example, RA requirement information, participant information, final price calculation formulas, etc. are set in the initial information storage means (not shown). The initial setting process in the third scheme A includes setting the start condition and end condition in the first RA and the second RA, and setting the bidder's successful bid condition in the first RA and the second RA. included.

  Next, if the start condition of the first RA is satisfied, the RA management means 102 determines that the RA has started (YES in STEP 402), and sends the start instruction of the first RA to the supplier terminal 2 through the communication unit 11. Send through. Then, the bidding processing means 103 is instructed to start processing (STEP 403).

  When receiving the first price information and other related information transmitted from the supplier terminal 2 from the communication unit 11 (STEP 404), the bid processing means 103 associates the received first price information with the supplier ID as a bid price. Register in the bid result table (STEP 405).

  Next, the bidding processing means 103 performs a process of calculating a bidding result in the first RA according to the registration process or periodic timing. For example, the first price information in the bid result table is rearranged in order of low price, and the bid result is transmitted to the supplier terminal 2 and the buyer terminal (STEP 406). FIG. 13A is an example of a bid result displayed on the screen of the buyer terminal 4. The supplier can bid again based on the received bid result, and the supplier terminal 2 transmits the re-input first price information to the RA server 1.

  On the other hand, the bid processing means 103 of the RA server 1 accepts and processes the first price information transmitted from the supplier terminal 2 until the RA management means 102 notifies the end of the first RA (No in STEP 407). ).

  Thereafter, when the RA management means 102 notifies the end of the first RA (YES in STEP 407), the bid processing means 103 ends the bid processing for the first RA, and the successful bid processing means 104 starts processing. The successful bid processing means 104 identifies a plurality of suppliers and successful bid prices that match the first RA successful bid conditions for passing through the first RA from the bid result table at the end of the first RA (STEP 408). The first RA successful bid condition can be arbitrarily set according to the specifications of the first RA. For example, the top n companies when the bid prices are arranged in order of the lowest price, a predetermined percentage from the lowest bid price. It is possible to consider items included in the above-mentioned range, items that are below a predetermined amount set in advance, determination based on a matrix of bid price and quality evaluation, selection by buyer, and the like.

  The successful bid processing unit 104 identifies the intermediate layers on the path of the selected plurality of first successful bidders (suppliers) from the path information storage unit 122 (STEP 409), and the first successful bid price (supplier first price). Price information) is notified to the corresponding intermediate layer (STEP 410). Further, the successful bid processing means 104 notifies the buyer of the successful bid result of the first RA (STEP 411). The buyer terminal 4 displays a successful bid result screen based on the notified first RA successful bid result on the screen. Thereby, the first RA is completed.

  When the first RA is completed, the second RA is started. Note that the intermediate layer that can participate in the second RA is one in which the supplier on its route is selected by the first RA. Therefore, when the supplier on its route is not selected in the primary RA, the intermediate layer cannot participate in the secondary RA. In addition, when there are a plurality of suppliers on its own route and two or more suppliers are selected in the primary RA, the intermediate layer is in the secondary RA. Two or more suppliers (a plurality of distribution channels) may be designated for bidding, or one supplier (one distribution channel) may be bid for. It should be noted that a supplier who does not have an intermediate layer on his / her own distribution channel from the beginning may participate from the secondary RA, or may participate from the primary RA and pass through the primary RA. You may be allowed to participate in the next RA.

  As shown in FIG. 12, the RA management means 102 instructs the intermediate layer terminal 3 and the bid processing means 103 of the intermediate layer selected in the first RA to start the second RA. Here, the intermediate layer bids the final price of the product considering the notified first successful bid price. That is, the intermediate layer bids the final price obtained by applying the first price information of the confirmed supplier and its second price information to a predetermined calculation formula. When bidding for a plurality of suppliers, the supplier is designated and the final price of the product is bid.

  When the start of the second RA is instructed (Yes in STEP 501), the bid processing means 103 starts accepting the final price that the intermediate layer bids. Upon receiving the final price and other related information transmitted from the intermediate layer terminal 3 (STEP 502), the bid processing means 103 associates it with the intermediate layer ID as a bid price and registers it in the bid result table (STEP 503). When the intermediate layer bids for a plurality of suppliers, the intermediate layer is registered in the bid result table in association with the intermediate layer ID and the supplier ID.

  Next, the bidding processing means 103 calculates a bidding result in the second RA according to the registration process or the regular timing. For example, the bid prices in the bid result table are rearranged in ascending order, and the bid results are transmitted to the intermediate layer terminal 3 and the buyer terminal 4 (STEP 504). FIG. 13B is an example of a bid result displayed on the screen of the buyer terminal 4. The intermediate layer can re-bidding based on the received bidding result, and the intermediate layer terminal 3 transmits the re-entered final price to the RA server 1.

  On the other hand, the bid processing means 103 of the RA server 1 accepts and processes the final price transmitted from the intermediate layer terminal 3 until the end of the second RA is notified from the RA management means 102 (No in STEP 505).

  Thereafter, when the end of the second RA is notified from the RA management means 102 (Yes in STEP 505), the bid processing means 103 ends the second bidding process, and the successful bid processing means 104 starts the process. The successful bid processing means 104 sets a bid price that matches the successful bid condition of the second RA from the bid result table at the end of the second RA as the successful bid price, and sets an intermediate layer (and supplier) corresponding to the successful bid price. The winning bidder is identified (STEP 506). As the successful bid condition of the second RA, conditions according to the RA specifications can be arbitrarily set. For example, the minimum bid price, the determination by the matrix of the bid price and the quality evaluation, the selection by the buyer, etc. are considered. It is done.

  The successful bid processing means 104 transmits the successful bid result of the second RA including the successful bidder (intermediate layer and supplier) and the successful bid price to each terminal via the communication unit 11 (STEP 507). The buyer terminal 4 displays a second RA successful bid result screen on the screen based on the transmitted second RA successful bid result. In addition, in the successful bid result transmitted to the supplier terminal 2, information indicating whether or not the successful bidder has been reached is transmitted together with the intermediate layer, and the final price is not transmitted.

  As described above, according to the third scheme A, both the supplier and the intermediate layer can participate in the competitive bidding, so that the procurement cost of the buyer can be further reduced.

  In addition, the bidding act of the supplier and the middle layer is performed separately, and the final price is not disclosed to the supplier, so the RA is executed without disclosing the middle layer price structure, the second price information and the final price to the supplier. Is possible.

  Next, the flow of processing by the RA server for realizing the third scheme B of RA according to the present invention will be described with reference to FIG. The third scheme B is characterized in that the supplier is a bidder for each intermediate layer and the corresponding intermediate layer is a selector. FIG. 14 is a flowchart showing the flow of the second RA process according to the third scheme B.

  Although the third scheme B is basically different from the third scheme A described above in that the supplier bids in the middle layer unit, the other points are the same. Shall be explained. Therefore, the processing of STEP 601 to STEP 605 in FIG. 14 is the same as the processing of STEP 401 to STEP 405 in FIG.

  In STEP 606 of FIG. 14, the bid processing means 103 calculates the result of bidding for the first RA in units of intermediate layers. Specifically, by sorting the price data of each supplier in the middle layer unit (for each group of suppliers existing on the route of the identified intermediate layer) in ascending price order, Bid price). In this case, since the bid results differ for each intermediate layer, the bid processing means 103 transmits the bid results for each intermediate layer to the corresponding supplier terminal 2 (STEP 606). In addition, since the selection person in the 3rd scheme B is an intermediate | middle layer, you may transmit a bid result to an intermediate | middle layer terminal.

  Thereafter, when the RA management means 102 notifies the end of the first RA (YES in STEP 607), the bid processing means 103 ends the bid processing for the first RA, and the successful bid processing means 104 starts processing. The successful bid processing means 104 specifies suppliers and successful bid prices that match the first RA successful bid conditions for passing the first RA from the bid result table at the end of the first RA in units of intermediate layers (STEP 608). . The primary RA successful bid condition can be arbitrarily set according to the specifications of the first RA. For example, the lowest bid price (successful bid price) is specified for each intermediate layer and the successful bid price is bid. The configuration may be such that the selected supplier is automatically selected as the first successful bidder, or that each intermediate layer arbitrarily selects in consideration of factors other than the bid price (for example, information relating to the quality of the product).

  The successful bid processing means 104, when selecting the first successful bidder (supplier) for each intermediate layer, notifies the intermediate layer of the successful bid result of the first RA (STEP 609). Thereby, the first RA is completed.

  When the first RA is completed, the second RA is started. In the third scheme B, since the supplier is selected in units of intermediate layers, unlike the third scheme A, all the intermediate layers participate in the second RA. Note that the secondary RA in the third scheme B is basically the same as the processing of the secondary RA in the third scheme A, and thus description thereof is omitted here.

  As described above, according to the third scheme B, since the successful bidder of the first RA is selected in units of intermediate layers, it becomes possible to give all the intermediate layers opportunities to participate in the second RA.

  In addition, since the supplier and the middle layer bidding are performed separately and the final price is not disclosed to the supplier, the RA can be executed without disclosing the price structure of the intermediate layer to the supplier.

  Further, since only the final price is presented to the buyer, the price structure of the supplier and the middle layer itself can execute RA without disclosing it to the buyer.

[Other]
The present invention is not limited to the above-described embodiment, and can be applied with various modifications. For example, each step in the flowchart (including a partial step to which no code is assigned) can be executed in any order or in parallel within a range that does not contradict the processing contents.

  (1) For example, in the above-described embodiment, the case where the intermediate layer that is a price determiner other than the supplier is configured from one layer has been described, but the layer of the intermediate layer depends on the distribution form targeted by the RA. It can be set arbitrarily. For example, when a plurality of price determiners are present between a buyer and a supplier, the plurality of price determiners are viewed from the supplier side (or from the buyer side) and grasped as intermediate layers from the first layer to the Nth layer. Thus, it is possible to set the intermediate layer in each of the above schemes.

  For example, in the first scheme, when there are intermediate layers from the first layer to the Nth layer between the buyer and the supplier, each price information and calculation method is set in advance from the intermediate layer of each layer. In addition, when a supplier who is a bidder makes a bid, the final price may be calculated based on the set price information and calculation method.

  In the second scheme, the calculation method is set in advance from the intermediate layer of each hierarchy, and the supplier and each of the intermediate layers of the first to Nth layers are assigned to the RA as bidders. It is conceivable to configure to bid.

  Further, in the case of the third scheme, when a plurality of price determiners are grasped as intermediate layers from the first layer to the Nth layer when viewed from the supplier side, the first RA for the supplier, the intermediate layer of the first layer Can be configured to execute RA for each layer, such as a second order RA for the third order, a third order RA for the intermediate layer of the third hierarchy, and so on. On the other hand, when grasped as an intermediate layer from the first layer to the Nth layer as seen from the buyer side, the first RA for the supplier, the second RA for the intermediate layer of the Nth layer, and the (N-1) th layer It may be configured to execute RA for each hierarchy, such as a third order RA for the intermediate layer.

  (2) In the above embodiment, the case where RA is executed by a plurality of suppliers and a plurality of intermediate layers has been described. However, even when the intermediate layer is 1, RA can be executed.

  For example, when a distributor wants to reduce the procurement cost of a product purchased from manufacturer A, a method of conducting a reverse auction for manufacturer A can be considered, but considering the actual situation of existing transactions, the manufacturer A reverse auction for A may not be appropriate.

  In such a case, it is effective to perform RA with a supplier of a packaging material manufacturer that provides the packaging material of the product to the manufacturer A, for example, the manufacturer A. Since manufacturer A, which is a layer, has already been fixed, RA is executed on the premise of a plurality of suppliers (packaging material manufacturers) and one intermediate layer (manufacturer A).

  According to this, the buyer can take advantage of flexible RA for cost reduction while considering the actual situation of existing transactions, etc., and the supplier should perform RA with the buyer as the buyer. The middle layer can be provided with the advantage that the final price can be reduced without lowering its own price.

It is a block diagram which shows schematic structure of RA system. It is a block diagram which shows the function block diagram of a server. It is a figure which shows the scheme of RA implement | achieved from RA system. It is a figure which shows the scheme of RA implement | achieved from RA system. It is a block diagram which shows the function block diagram of RA server. It is a figure which shows an example of a data structure of RA server. It is a flowchart which shows the flow of the process of RA which concerns on a 1st scheme. It is a flowchart which shows the flow of a bid result calculation process. An example of the bid result screen concerning the 1st scheme is shown. It is a flowchart which shows the flow of the process of RA which concerns on a 2nd scheme. It is a flowchart which shows the flow of RA process which concerns on a 3rd scheme. 12 is a flowchart showing a flow of RA processing according to a third scheme A. It is a figure which shows an example of the bid result screen which concerns on the 3rd scheme A. 12 is a flowchart showing a flow of RA processing according to a third scheme B.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 RA server 2 Supplier terminal 3 Middle layer terminal 4 Buyer terminal 10 Control part 11 Communication part 12 Storage part 101 Initial setting means 102 RA management means 103 Auction processing means 104 Auction processing means 121 Price information storage means 122 Distribution route storage means 100 RA system

Claims (8)

A supplier terminal installed on the supplier side, a buyer terminal installed on the buyer side, and a target product (including intangibles) of the reverse auction (hereinafter referred to as “RA”) is present on the distribution channel from the supplier to the buyer. An information processing device for performing RA connected to each of the intermediate layer terminals installed on the intermediate layer side through the network,
Bid information storage means for storing the first price information presented from the supplier and the second price information presented from the intermediate layer in association with each of the supplier or the intermediate layer for the RA target product;
Distribution channel storage means for storing the correspondence between the supplier and the intermediate layer;
Bid obtained by specifying the combination of the first price information and the second price information stored in the bid information storage means with reference to the correspondence relationship between the supplier and the intermediate layer stored in the distribution route storage means RA management means for performing RA based on price;
An information processing apparatus comprising: The RA management means includes:
When the first price information transmitted from the supplier terminal is received during the execution of RA, the intermediate layer corresponding to the supplier is identified from the distribution route storage means, and the second price information of the identified intermediate layer is Bid processing means that reads out from the bid information storage means and calculates a bid price based on the read second price information and the accepted first price information;
Successful bid processing means for selecting, as a successful bidder, a supplier corresponding to the lowest bid price at that time when a predetermined RA termination condition is satisfied;
The information processing apparatus according to claim 1, further comprising: The RA management means includes:
During the execution of RA, the first price information transmitted from the supplier terminal and the second price information transmitted from the intermediate layer terminal are respectively received and stored in the bid information storage means, and specified from the distribution route storage means. Bid processing means for reading the first price information and the second price information that match the correspondence relationship between the supplier and the intermediate layer to be read from the price information storage means and calculating a bid price;
Successful bid processing means for selecting a supplier and an intermediate layer corresponding to the lowest bid price at that time as a successful bidder when a predetermined RA termination condition is satisfied;
The information processing apparatus according to claim 1, further comprising: The bid processing means
4. The information processing apparatus according to claim 1, wherein a bid price based on the first price information and the second price information is calculated according to a bid price calculation method provided from an intermediate layer. The RA management means includes:
First RA means for executing the first RA using the first price information transmitted from the supplier terminal as a bid price;
A second RA means for executing a second RA using the second price information transmitted from the intermediate layer terminal as a bid price,
The first RA means selects, as a successful bidder, a plurality of suppliers that satisfy a predetermined successful bid condition at that time when a predetermined primary RA termination condition is satisfied,
The second RA means processes the second price information transmitted from the intermediate layer terminal of the intermediate layer corresponding to the supplier selected as the successful bidder in the first RA as a bid price, 2. The information processing apparatus according to claim 1, wherein when the RA termination condition is satisfied, a combination of an intermediate layer and a supplier corresponding to the lowest bid price at that time is selected as a successful bidder. The RA management means includes:
First RA means for executing the first RA using the first price information transmitted from the supplier terminal as a bid price;
A second RA means for executing a second RA using the second price information transmitted from the intermediate layer terminal as a bid price,
The first RA means calculates a bid result for each intermediate layer, and when a predetermined first RA termination condition is satisfied, a supplier corresponding to the lowest bid price at that time is determined as a successful bidder for each intermediate layer. Selected,
The second RA means processes the second price information transmitted from the intermediate layer as a bid price on the basis of the winning bid price in the first RA of the supplier corresponding to each intermediate layer, and the predetermined second 2. The information processing apparatus according to claim 1, wherein when the next RA termination condition is satisfied, an intermediate layer corresponding to the lowest bid price at that time is selected as a successful bidder. The supplier terminal installed on the supplier side, the buyer terminal installed on the buyer side, and the target product (including intangible items) of the reverse auction were installed on the intermediate layer side that exists on the distribution channel from the supplier to the buyer. An information processing method in an information processing apparatus for performing RA connected to an intermediate layer terminal and each via a network,
Storing the first price information presented from the supplier and the second price information presented from the intermediate layer in the bid information storage means in association with each of the supplier or the intermediate layer for the RA target product;
The first price information and the second price information stored in the bid information storage means with reference to the correspondence relation between the supplier and the intermediate layer stored in the distribution route storage means for storing the correspondence relation between the supplier and the intermediate layer. Performing RA based on a bid price obtained by identifying a combination of:
An information processing method comprising:   An information processing program for causing a computer to execute the information processing method according to claim 7.

Images