KR20010070710A - Bid type on-line auction method and system thereof - Google Patents

Abstract

PURPOSE: A method for intermediating a network based service and a system thereof are provided to voluntarily fix the optimal price tendered by setting an upper limit of price tendered as planned construction expenses estimated from a computer program, and by selecting a tenderer who presents an approximate price tendered for a successful bidder. CONSTITUTION: An orderer connects to an intermediate server and inputs an ID and a password for authentication. After that, the ID and the password are transmitted to the intermediate server(S10). The intermediate server judges whether the orderer is a registered user using member information(S12). Estimated data on planned construction expenses are received from the orderer(S14). The intermediate server inputs the data in a computer program for estimating construction expenses(S16). The orderer inputs construction expenses desired referring to planned construction expenses estimated(S18). The intermediate server stores the construction expenses desired(S20). An inverse auction is started(S22). A plurality of tenderers connect to the intermediate server(S24). The intermediate server judges whether registered user(S26). Tenderers make requests for catalogs of the inverse auction(S28). The intermediate server searches inverse auctions(S30). The tenderers select one among the catalogs(S32). The intermediate server transmits proceeding information(S34).

Description

Network-based service mediation method and system {BID TYPE ON-LINE AUCTION METHOD AND SYSTEM THEREOF}

The present invention relates to a network-based service brokering method and system for service order, and more particularly, to an electronic commerce method and system that is performed online.

Recently, due to the development of communication networks such as the Internet, online bidding and online auctions / reverse auctions have emerged. The characteristic of online bidding and online auction / reverse auction is that by bringing the existing offline bidding online, the remote bidding or auction participants do not have to go to the place where the actual bidding or auction is performed.

In general, bidding is a method in which a buyer is the exclusive seller or service provider who has offered the lowest price based on the price presented by the seller of the goods or services. The auction is a method in which the seller determines the exclusive buyer as the auction participant who has offered the highest price among the amounts presented by the auction participants. Unlike traditional auctions, reverse auctioning is a way for the buyer to decide on the auction participant who is the lowest price among the prices offered by sellers who are the auction participants.

Representative bidding methods include the limited bidding method, the lowest bidding method, and the average bidding method.

In the limited bidding method, the bidder who set the estimated cost in advance, and the bidder who presented more than a certain percentage of the estimated cost (about 85% in the case of building construction) among the bidders calculated by the participating companies. Is chosen as a successful bidder. The reason for selecting bidders who have offered bidders above a certain percentage of the estimated construction cost is to minimize the cost required by selecting a bidder that fits the above by limiting a certain percentage to the lower limit.

The lowest bidding method is a method of selecting a bidder who presents the lowest bidder among the bidders as the bidder. The lowest bidding method has the advantage of being able to construct a building desired by the owner at the lowest price, but since the construction of the building is carried out at a very low price, there is a disadvantage that can not be avoided caused by this.

The average bidding method is a method of selecting a bidder who presents a bidder closest to the calculated average after calculating an average of the bidders. The average price bidding method is, according to the rule of thumb, the bidding price suggested by each bidder is generally the optimal construction cost for constructing the corresponding building, and therefore, it is advantageous for both the client and the builder to select the bidding price based on the average value thereof.

However, in the bidding method, a bidding participant may present a bidder only once, and cannot check the bidders suggested by other competitors. Therefore, the bidding was very likely to involve cheating to determine the expected winning bidder and the bidder of the competitor, and the online fair bidding frequently raises the issue of fairness and transparency. In addition, the reverse auction method has the advantage that the bid price can be adjusted several times while checking the price suggested by other competitors.However, due to excessive competition, a seller who has been offered a low price refuses to enter into a contract or fulfill the contract contents. There is a disadvantage that occurs.

In particular, if the total required cost varies depending on the construction method and the materials used, such as building construction, and when the damage caused by poorly constructed buildings is enormous, the construction companies are unconditionally selected at low prices by the aforementioned bidding or reverse auction. It is not desirable. Therefore, the client can obtain the building of desired quality only when the contractor who selects the proper construction cost is selected within the limit not exceeding the upper limit of the construction cost calculated on the basis of the expected building quality. However, the existing bidding or reverse auction is an exorbitant low-cost auction due to illegal or successful bidding or excessive competition other than to limit the eligibility of the participant, and thus can not prevent the damage.

Therefore, in order to solve the above problems, an object of the present invention is to set the planned cost calculated by the cost calculation computer program verified by the expert (or evaluator) to the bid price upper limit, and to the desired cost selected by the client (or service consumer). The present invention provides a network-based service brokering method and system for ordering a service that selects a bidder (or service provider) who has presented the closest bidder as a successful bidder.

Another object of the present invention is to allow bidders participating in reverse auctions to bid on the same reverse auction repeatedly, thereby allowing the optimal price range of the construction cost to be voluntarily formed by at least one bidder, thereby improving the disadvantages of the conventional bidding. It is to provide a network-based service brokering method and system for the service order.

Another object of the present invention is that the bidder participating in the reverse auction can view the data of the scheduled construction cost and the estimated construction cost, but because the client can not know the desired construction cost, it is impossible to present the dumping price for unconditional order purposes, It is to provide a network-based service brokering method and system for ordering a service that can lead to the proposal of the best price.

Still another object of the present invention is that the bidder's auction price is disclosed in the order of participation but does not disclose the rest of the bidder's information, namely the company name and the number of bidders. It is to provide a network-based service brokering method and system for ordering a service that can prevent the occurrence of insolvent construction by inducing a proposal of a project value that is unpredictable and reliable.

Another object of the present invention is that the bidders of the bidders participating in reverse auction on the Internet is disclosed in real time, so that the occurrence of irregularities such as collusion in the reverse auction process or the outflow of the bidable amount is fundamentally blocked, so that a fair auction service order is possible. To provide a network-based service brokering method and system therefor.

It is still another object of the present invention to provide a network-based service intermediation method and system for selecting a bidder who presents a bidder closest to a desired service cost selected by a client for reverse auction on a general service as a successful bidder.

1 is a schematic configuration diagram of a system for performing a network-based service intermediation method for service ordering according to an embodiment of the present invention.

2 is a flowchart illustrating the overall processing flow of a network-based service brokering method for service ordering according to an embodiment of the present invention.

3 is a flowchart illustrating a process of participating in a reverse auction of a bidder during a processing flow in a mediation server of a network-based service brokering method for service ordering according to an exemplary embodiment of the present invention.

4 is a flowchart illustrating a process of selecting a successful bidder in a processing flow in a mediation server of a network-based service mediation method for service ordering according to an exemplary embodiment of the present invention.

5 is a block diagram of a reverse auction information table of a network-based service brokering method for service ordering according to an embodiment of the present invention.

6 is a block diagram of a progress information table of a network-based service brokering method for service ordering according to an embodiment of the present invention.

7 is an exemplary diagram illustrating a reverse auction progression process when a bidding price corresponding to a client's desired construction cost is presented by a network-based service brokering method for service ordering.

FIG. 8 is an exemplary diagram illustrating a reverse auction process when three bidders present bidders meeting client's desired construction cost upper limit by a network-based service brokering method for service ordering.

9 is an exemplary diagram illustrating a reverse auction process in the case where three bidders present bidders that do not meet the client's upper limit on the desired construction cost by a network-based service brokering method for service ordering.

FIG. 10 is an exemplary diagram illustrating a reverse auction progress process when a bidder presents a bidder meeting a client's desired construction cost upper limit by a network-based service brokering method for service ordering.

FIG. 11 is an exemplary diagram illustrating a reverse auction process when two bidders present bidders that do not meet the client's upper limit on a desired construction cost by a network-based service brokering method for service ordering.

In order to achieve the above object, a preferred embodiment of the present invention is coupled to at least one orderer terminal and at least one orderer terminal through a network to be executed in an intermediary server for the reverse auction requested by the client In the online reverse auction method, a predetermined service price is calculated according to a predetermined service price calculation data inputted from the orderer terminal, and a desired service price, a desired service price upper limit, and reverse auction information-consumer information and number of bidders received from the orderer terminal. And generate a reverse auction information table and a progress information table corresponding to the lower limit, the bidding process, and the reverse auction progression period and the predetermined service price, and generate the desired service price, the desired service price upper limit, the reverse auction information and the scheduled service price. The reverse auction information table Store and search the reverse auction information table and the corresponding bid price calculation data in the reverse auction information table and the progress information table according to the reverse auction list request received from the bidder terminal, and transmit the data to the bidder terminal. A bid price repeatedly inputted from the store is stored in the progress information table, and it is determined whether the bidder satisfies a predetermined reverse auction end condition, and when the reverse auction end condition is met, the reverse auction is terminated and the predetermined bidder selection condition corresponds. Provides a network-based service brokering method and system for ordering a service for selecting a bidder who presented the bidder as a successful bidder.

Here, the scheduled service price calculation data and bid price calculation data may include a design book and a specification.

A desired service price, a desired service price upper limit and a reverse auction information received from the orderer terminal, a reverse auction information table and a progress information table corresponding to the predetermined service price, and generate the desired service price, a desired service price upper limit, a reverse auction information, and the like. The storing of the predetermined service price in the generated reverse auction information table may include: generating a reverse auction information table to store the reverse auction information corresponding to the reverse auction information received from the client terminal, storing the reverse auction information, and assigning an identifier. And receiving a desired service price and a desired service price upper limit from the orderer terminal and storing the desired service price in the reverse auction information table, and generating a progress information table to store progress information on the reverse auction requested by the client, and in the reverse auction information table.Characterized by including the step of assigning the same identifier and the assigned identifier.

The reverse auction information table includes an identifier, order information, a predetermined service price, a desired service price, a desired service price upper limit, a lower number of bidders, a bidding process, a reverse auction progression period, a planned service price calculation data, and a registration date field. do.

The reverse auction progress information table may include an identifier, bidder information, bid date and time, and bid price fields.

The reverse auction end condition is, if the bid price is equal to the desired service price of the orderer or the bid price is included in the desired service price or the upper limit of the desired service price (hereinafter referred to as 'optimal price range') of the orderer, the reverse auction ends; Otherwise, the reverse auction may be terminated when the reverse auction end date and time elapse.

When the reverse auction end condition is met, the reverse auction is ended, and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a successful bidder may include a minimum bidder average of each bidder participating in the reverse auction as the first successful bidder selection condition. And selecting a bidder who has presented the bidder closest to the lowest bidder average as a successful bidder.

According to another preferred embodiment of the present invention, the reverse auction end condition is characterized in that the reverse auction ends when the reverse auction end date and time elapse.

When the reverse auction end condition is met, the reverse auction is terminated, and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a successful bidder includes selecting a second successful bidder whether or not there is a bidder that matches the desired service price. Selecting a bidder who presented the bidder as a successful bidder if there is a bidder that matches the desired service price using the condition; and if there is no bidder included in the optimum price range when no successful bidder is selected in the step Selecting a bidder who presented the bidder as a bidder if there is a bidder included in the optimum price range using a third bidder selection condition; and if the bidder is not selected at the step, the lowest of each bidder who participated in the reverse auction. Use bid average as fourth bidder selection condition And selecting a bidder who presents the bidder closest to the lowest bidder average as a successful bidder.

According to another embodiment of the present invention, the reverse auction information table may further include at least one lowest limit bid value field.

The reverse auction end condition is a condition that the reverse auction ends when the bid price coincides with the desired service price of the client or the bid price is within an optimal price range, otherwise the reverse auction ends when the reverse auction end date elapses. It features.

When the reverse auction end condition is met, the reverse auction is ended, and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a successful bidder may include a minimum bidder average of each bidder participating in the reverse auction as the first successful bidder selection condition. And selecting a bidder who has presented the bidder closest to the lowest bidder average as a successful bidder.

When the reverse auction end condition is met, the reverse auction is ended, and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a bidder may include a bidder lower than the minimum limited bidder and a bidder who presented the bidder, respectively. The bidder may further include the step of excluding from the target of calculating the average bidders.

According to another preferred embodiment of the present invention, the reverse auction end condition is characterized in that the reverse auction ends when the end date of the reverse auction.

When the reverse auction end condition is met, the reverse auction is terminated, and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a successful bidder includes selecting a second successful bidder whether or not there is a bidder that matches the desired service price. Selecting a bidder who presented the bidder as a successful bidder if there is a bidder that matches the desired service price using the condition; and if there is no bidder included in the optimum price range when no successful bidder is selected in the step Selecting a bidder who presented the bidder as a bidder if there is a bidder included in the optimum price range using a third bidder selection condition; and if the bidder is not selected at the step, the lowest of each bidder who participated in the reverse auction. Use bid average as fourth bidder selection condition And selecting a bidder who presents the bidder closest to the lowest bidder average as a successful bidder.

When the reverse auction end condition is met, the reverse auction is ended, and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a bidder may include a bidder lower than the minimum limited bidder and a bidder who presented the bidder, respectively. The bidder may further include the step of excluding from the target of calculating the average bidders.

According to still another preferred embodiment of the present invention, a service intermediation method executed in a service intermediation server coupled to at least one service provider, at least one evaluator, and a service consumer through a network, wherein the service is provided through the network. Receiving a service and cost calculation data of the service from a consumer, providing the service and cost calculation data of the service to the at least one evaluator, and a first service for the service from the at least one evaluator Receiving a price, providing the first service price to the at least one service provider, receiving a second service price for the service from the service consumer, and receiving the first service price or the At least one of a second service price Calculating a reference price based on the method, executing the auction by inputting at least one bid price for the service from the at least one service provider, and performing an auction on the basis of the reference price and a predetermined dropout condition. A network for service ordering which determines a bid price or service provider to drop out and determines at least one service provider and bid price that meets predetermined bidding conditions among the non-dropped bid prices or service providers Based service mediation method is provided.

According to another preferred embodiment of the present invention, a service brokering method executed in a service brokering server coupled to at least one service provider and a service demander through a network, the service and the service from the service demander through the network; Receiving a cost calculation data of a service, receiving a first service price for the service based on the service and the cost calculation data of the service, the first service price and the at least one service provider; / Or providing to the service consumer, receiving a second service price from the service consumer, calculating a reference price based on at least one of the first service price or the second service price; From the at least one provider to the service Executing an auction by receiving at least one bid price for the bidder, determining a bid price or service provider to be dropped from the auction based on the reference price and a predetermined rule; A network based service brokering method is provided which performs the step of determining at least one service provider and a bid price that meet a predetermined bidding condition among service providers.

The present invention is to calculate the starting price of the reverse auction by an objective criterion, to induce the optimal price range is formed by the bidder through repeated participation, and to select a service provider to implement a certain service at the optimal price formed through the system and the system It is about. The present invention can be applied to service reverse auctions in various fields. For example, it can be applied to professional services such as website building, consulting, construction services such as indoor interior construction, building remodeling, building design or building construction, and general service areas such as security agency, building disinfection or building cleaning. . The application field described above is merely an example, and is not limited to the application field of the present invention. In the present specification, the building design service and the building construction service are described for convenience of description.

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

1 is a schematic structural diagram of a system for performing a network-based service brokering method for service ordering according to an embodiment of the present invention.

Referring to FIG. 1, a system for performing a network-based service brokering method for service ordering according to the present invention includes an orderer system 100, an intermediary server 200, and a plurality of bidder systems 300-1, 300-2,. ... 300-n, hereinafter referred to collectively as 300-n).

The orderer system 100 is connected to the communication network, connected to the intermediary server 200 to select a construction company for building construction orders, requesting and confirming the planned construction cost, requesting and confirming the construction company through reverse auction, and confirming the successful bidder. And online contract work (PROCESS).

The orderer system 100 is any wired / wireless terminal capable of connecting to a wired / wireless internet network using a TCP / IP protocol, and typically includes a personal computer (PC), a portable telephone, a PDA, It is not necessarily limited thereto.

The mediation server 200 is connected to a communication network, and may perform a scheduled construction cost calculation, reverse auction progress, and online contract relay. Detailed description of the intermediate server 200 will be described with reference to the accompanying drawings.

The bidder system 300-n is connected to a communication network, and may connect to an intermediary server 200 for building construction order, and check the scheduled construction cost and calculation data, participate in reverse auction, and online contract work (PROCESS). .

The bidder system 300-n is any wired / wireless terminal capable of connecting to a wired / wireless internet network using a TCP / IP protocol, and typically includes a personal computer, a portable telephone, a PDA, and the like. It is not.

Hereinafter, a network-based service brokering method for service ordering will be described in detail with reference to the accompanying drawings.

2 is a flowchart illustrating the overall processing flow of a network-based service brokering method for service ordering according to an embodiment of the present invention.

Referring to FIG. 2, in step S10, the orderer 100 connects to an intermediate server 200, inputs an ID and password for authentication, and transmits the ID and password to the intermediate server 200.

In step S12, the intermediary server 200, which has received the ID and password from the orderer 100, determines whether the user is a registered user using previously stored member information. As a result of the determination, when the orderer 100 is a registered user, the process proceeds to step S14, and when the orderer 100 is not a registered user, the procedure proceeds to the member registration procedure. 2, a general member registration procedure is omitted.

In step S14, the orderer 100 inputs the planned construction cost calculation data and transmits it to the mediation server 200. The planned construction cost calculation data may include a design book and specifications of the building to be placed by the client to reverse auction.

In step S14, the reverse order of the reverse auction including the online reverse auction information may be input from the orderer 100 together with the estimated construction cost calculation data. When the broker server 200 receives the online reverse auction order from the orderer 100, the mediation server 200 generates a reverse auction information table for storing reverse auction information of the orderer 100. 5 to describe the online reverse auction information and the reverse auction information table. 5 is a block diagram of a reverse auction information table of a network-based service brokering method for service ordering according to an embodiment of the present invention.

Referring to Fig. 5, the reverse auction information table includes an identifier 401, an orderer information 402, a planned construction cost 403, a desired construction cost 404, a desired construction cost upper limit 405, a bidder lower limit 406, and a bidding process ( 407, the reverse auction progression period 408, the planned construction cost calculation data 409 and the registration date 410 fields.

Among the fields, contents stored in the identifier 401, the orderer information 402, the scheduled construction cost 403, the reverse auction proceeding period 408, the planned construction cost calculation data 409, and the registration date 410 fields may be disclosed to the bidder. have. The contents stored in the desired construction cost 404, the desired construction cost upper limit 405, the minimum number of bidders 406, and the bidding processing 407 are not disclosed to the bidder.

The identifier 401 is a unique number for distinguishing each reverse auction registered in the mediation server 200 and is a serial number assigned in the order of registration. The identifier 401 is a PRIMARY KEY field having a unique value across all tables and databases held by the mediation server 200. The field value stored in the identifier 401 field may be an integer or an integer + character.

The orderer information 402 includes information that can distinguish each orderer, such as a company name, ID, etc. of the orderer 100 that inputs the reverse auction order information. The field value stored in the orderer information 402 field may be a character or a character + integer.

The estimated construction cost 403 is an objectively estimated construction cost estimate calculated based on the planned construction cost calculation data. The scheduled cost of construction is calculated after step S16 and stored.

Desired construction cost 404 is an estimated construction cost desired by the orderer 100. The desired construction cost is input from the orderer 100 in step S18.

The desired construction cost upper limit 405 is an amount corresponding to the upper limit of the desired construction cost desired by the orderer 100. The desired construction cost upper limit 405 may be a predetermined value input from the orderer 100, or may be calculated by adding the desired construction cost to a value obtained by multiplying the desired construction cost by a predetermined ratio. The predetermined ratio may be, for example, within the range of 5% to 7%. The range between the desired cost of construction and the upper limit of the desired cost of construction is referred to as an optimum price range.

The lower number of bidders 406 is the minimum number of bidders to participate in the reverse auction, and when bidders below the lower number of bidders participate in the reverse auction, they are used as a reference value for automatically bidding the reverse auction. The field value stored in the lower number of bidders 406 field may be an integer or a character.

The bidding process 407 is a reference value that bids back the reverse auction when the actual number of bidders is lower than the value stored in the lower bidder number limit 406 field value and performs reverse auction again.

The reverse auction progression period 408 is a field storing a date and time for starting the reverse auction (hereinafter referred to as 'start date and time') and ending date and time (hereinafter referred to as 'end date and time').

The planned cost calculation data 409 is a field for storing design documents and specifications for a building put on reverse auction. More precisely, the estimated cost calculation field 409 stores link information regarding a location where the planned cost calculation data including the design book and the specification are stored. If the object of the reverse auction is a building design rather than a building construction, the planned construction cost calculation data (409) field includes the use, scale (design area), Information about system decisions such as structure (steel, concrete, brick structure), interior and exterior materials of building, equipment, electricity, etc. is stored.

The registration date 410 is a field for storing the date of registering the reverse auction.

The reverse auction information table may further include at least one lowest limit bid value field. The lowest limit bidder may be used as a criterion for excluding bidders who are trying to win at an exorbitantly low price from a bidder selection target of reverse auction. For example, (1) the final bidder lower than the minimum limit bidder and the bidder who presented it are excluded from the bidder selection target, and (2) the bidder who presented the bidder lower than the minimum limit bidder N or more times from the bidder selection target is excluded. , (3) Two or more differential penalty sections may be set by two or more minimum limit bidders, and if the sum of the penalty points by the bidders included in the differential penalty section is greater than or equal to a predetermined value, the bidder may be excluded.

2 will be described again.

If the estimated construction cost of the building to be put on the reverse auction has already been calculated, it is possible to request the feasibility study of the previously calculated planned construction cost in step S14. Since the planned cost may be calculated by the building office that designed the building to be constructed, the estimated cost may be directly used as the starting price of the reverse auction, but may be reviewed appropriately by an expert. It may be. Therefore, when the client wants to review the validity of the already-expected project cost, the client may input the project cost together with the project cost and then request for review.

In step S16, the intermediary server 200 inputs the estimated construction cost calculation data received from the client 100 into the construction cost calculation computer program to calculate the planned construction cost of the building desired by the client.

The estimated construction cost is a total construction cost that is expected to be spent on building a desired building by the orderer 100, and is a cost calculated based on an objective criterion. The planned construction cost is a construction cost in consideration of the market price, labor costs and necessary technical construction cost of the interior / exterior materials of the building based on the contents described in the design book and specifications provided by the orderer 100.

In order to reduce the error of the calculated construction cost, the construction cost calculation computer program that calculates the estimated construction cost uses the objective costs notified by the government for the cost of building internal / exterior materials, labor costs, and technology construction. In order to reduce the calculation error of the construction cost calculation program, an error correction process may be further included in step S16 by a person skilled in the industry.

When the client has requested the feasibility study of the already-expected estimated construction cost in the step S14, the step S16 may be changed to requesting a feasibility study from the expert and receiving the review result.

In another embodiment of the present invention, the predetermined cost calculation step may be performed by a group of experts. In the case of being calculated by the expert, the step S16 may be changed to a step of providing the expert with the estimated cost of construction and receiving the calculated estimated cost of construction.

In step S18, the orderer 100 inputs a desired construction cost by referring to the calculated scheduled construction cost and transmits the desired construction cost to the intermediary server 200. The desired construction cost is a building cost that the orderer 100 actually wants to spend as a construction cost, and is not a verified cost that has been subjected to a mathematical calculation process like a planned building cost, but usually constructs a building as desired by the orderer 100. A reasonable amount of money is enough. If the purchaser 100 inputs a ridiculously low desired cost of construction, the bidder who proposes the bidder closest to the optimum price range formed by the lowest bidder offered by the plurality of bidders is selected as the bidder or the desired cost of construction. If is below the optimal price range, the method of probing the reverse auction can be selectively applied.

In step S20, the mediation server 200 stores the desired construction cost received from the orderer 200 in the desired construction cost field of the reverse auction information table.

In step S22, when the date and time stored in the reverse auction progression period 408 field arrives, the reverse auction is started. Reverse auction start means that the bidder can participate in the detailed auction and reverse auction online.

In step S24, the plurality of bidders 300-n access the intermediary server 200 by using a terminal connected to a network such as the Internet, input an ID and a password, and then transmit the ID and password to the intermediary server 200. .

In step S26, the mediation server 200, which has received the ID and password from the bidder 300-n, determines whether the user is a registered user using previously stored member information. As a result of the determination, when the bidder 300-n is a registered user, the process proceeds to step S28, and when the bidder 300-n is not a registered user, the procedure proceeds to the member registration procedure. 2, a general member registration procedure is omitted.

In step S28, the bidder 300-n requests the relay server 200 to check the reverse auction list in order to confirm the reverse auction currently in progress or in progress.

In step S30, when the mediation server 200 receives a reverse auction list request from the bidder 300-n, the reverse auction information server may search for a reverse auction currently in progress or scheduled to be displayed in the system of the bidder 300-n. Send it after converting it to a format. The method of searching for an ongoing auction currently in progress or in progress uses a method of comparing a reverse auction start date and time and a current date and time in the reverse auction progress period 408 field of the reverse auction information table. When the mediation server 200 selects one from the list received by the bidder 300-n, the bidder 300-n provides the bidder calculation data necessary for the bidder 300-n to calculate the bid price for the selected reverse auction. To the system. The bidder calculation data includes design documents and specifications stored in the reverse auction information table, and does not include a construction cost statement calculated / reviewed by the mediation server 200 or any expert.

In step S32, the bidder 300-n selects one list from the displayed reverse auction list received from the intermediary server 200 and requests to participate in the reverse auction. The reverse auction participation request is transmitted to the mediation server 200.

In step S34, the mediation server 200 transmits the progress information to the system of the bidder 300-n according to the reverse auction participation request received from the bidder 300-n. 6 to describe the progress information and the progress information table. 6 is a block diagram of a progress information table of a network-based service brokering method for service ordering according to an embodiment of the present invention.

Referring to FIG. 6, the progress information table includes an identifier 421, bidder information 422, a bid date and time 423, and a bidder 424 field. The contents stored in the bid date and time 423 and the bid 424 field may be disclosed to other bidders. Among the fields, the content stored in the bidder information 422 field is limited to the bidder's ID.

The identifier 421 is a field for storing a unique identifier that distinguishes each reverse auction registered in the mediation server 200. The identifier 421 is a primary key field having a unique value across all databases held by the mediation server 200. The field value stored in the identifier 421 field may be an integer or an integer + character.

The bidder information 422 includes information that can distinguish each bidder, such as a company name, an ID, and the like of the bidder 300-n participating in the reverse auction. The field value stored in the bidder information 422 field may be a character or a character + integer.

The bid date and time 423 is a field for storing information on the date and time at which the bidder 300-n participated in the reverse auction and presented a bid price. The bid date and time 423 field is updated or generated when the bidder presents the bidder.

The bid price 424 is a field for storing the amount of money offered by the bidder 300-n to the reverse auction. The bidder 424 is input by the bidder 300-n in step S36, and stored in the progress information table in step S38.

2 will be described again.

In step S36, the bidder 300-n checks the received progress information, inputs the bidder calculated through the necessary bidder calculation process, and transmits the bidder to the intermediate server 200.

In step S38, the mediation server 200 stores the information on the bidder and the bidding date and time received from the bidder 300-n in the progress information table.

In step S40, when the predetermined reverse auction end date arrives, the mediation server 200 uses the desired construction cost and the desired construction cost upper limit selected by the orderer 100 among a plurality of bidders 300-n participating in the reverse auction. Select. If there is no bidder that satisfies the desired construction cost and the desired construction cost upper limit, or when the number of bidders who participated in the reverse auction is less than or equal to the value stored in the bidding processing field, the mediation server 200 bids the reverse auction and then newly makes a reverse auction. Conduct. The mediation server 200 notifies the purchaser 100 and the bidder 300-n of the termination result of the reverse auction.

In step S42, the reverse auction result received from the mediation server 200 is displayed on the system of the bidder (300-n).

In step S44, the reverse auction result received from the mediation server 200 is displayed on the system of the client 100.

3 is a flowchart illustrating a process of participating in a reverse auction of a bidder during a processing flow in a mediation server of a network-based service mediation method for service ordering according to an exemplary embodiment of the present invention.

Referring to FIG. 3, in step S100, the bidder logs in by inputting an ID and password after accessing a mediation server subjected to reverse auction. The intermediary server determines the validity of the ID and password transmitted by the bidder and then performs an authentication procedure for allowing access.

In step S120, the mediation server searches for reverse auction information and progress information for the reverse auction selected by the authenticated bidder in the reverse auction information table and the progress information table. The method of searching for the reverse auction currently in progress or going on is performed by comparing the current date and time with the start date and the end date and time stored in the reverse auction progress period field of each reverse auction information.

In step S140, the mediation server converts the retrieved reverse auction information and the progress state into a form that can be displayed on the bidder terminal and transmits it to the bidder terminal.

In step S160, the mediation server stores the bidder received from the bidder in the progress information table of the reverse auction. The updated bidder has the same number as the identifier given to the reverse auction and is stored with information on the bidding date and time.

In step S180, the mediation server selects a successful bidder based on a predetermined construction cost and a desired construction cost upper limit. The successful bidder selection process will be described in detail with reference to FIG. 4.

4 is a flowchart illustrating a process of selecting a successful bidder in a processing flow in a mediation server of a network-based service mediation method for service ordering according to an exemplary embodiment of the present invention.

Referring to FIG. 4, in step S200, when a random bidder inputs a bid price for the reverse auction or no successful bidder is selected by the end date of the reverse auction, a successful bidder selection process is started. When the successful bidder selection process starts, the mediation server reads the latest bidder input for the reverse auction stored in the progress information table.

In step S220, it is determined whether the bidder read in step S200 is equal to the desired construction cost of the client. If the bidder is the same as the desired construction cost, the process proceeds to step S240, and if it is not the same, proceeds to step S260. In step S240, the bidder who presented the same bidder as the desired construction cost is selected as a successful bidder, and the reverse auction is terminated.

In step S260, it is determined whether the bidder is larger than the desired cost of construction and less than the upper limit of the desired cost of construction. If the bidder is larger than the desired construction cost and smaller than the upper limit of the desired construction cost, the process proceeds to step S280, otherwise, the process proceeds to step S300. In step S280, a bidder who has presented a bidder that is larger than the desired construction cost and less than the desired construction cost upper limit is selected as a successful bidder, and the reverse auction is terminated.

In step S300, it is determined whether the reverse auction has passed the end time limit. If the reverse auction does not exceed the end date and time, the process of selecting a successful bidder is terminated until a new bidder is input, and if the reverse auction is passed, the process proceeds to step S320.

In step S320, after reading the minimum bid prices of all the bidders participating in the reverse auction from the progress information table, the minimum bid average is calculated. Because of the nature of the reverse auction, since the bidder last suggested by each bidder is the lowest bidder, the bidder with the latest bidding date and time for each bidder is read out to calculate an average.

In step S320, when using at least one lowest limit bidder, the bidder may be excluded from the bidder selection target according to a predetermined criterion. (1) exclude the final bidder who is lower than the minimum limit bidder and the bidder who presented it from the bidder selection, (2) exclude the bidder who has selected the bidder lower than the minimum limit bidder N or more times from the bidder selection target, (3) Two or more differential penalty sections may be set by two or more minimum limit bidders, and if the sum of the penalty points by the bidders included in the differential penalty section is greater than or equal to a predetermined value, the successful bidder may be excluded.

In step S340, a bidder who presents a bidder closest to the lowest bidder average is selected based on the lowest bidder average calculated in step S320. The criterion for selecting the successful bidder in the step S340 is a method of selecting a bidder who presents a bidder close to the lowest bidder among bidders higher than the minimum bidder average and a bidder closest to the lowest bidder among the bidders lower than the minimum bidder average. There is a method of selecting a bidder who has presented a bidder as a successful bidder. The selection criteria may be selected in advance by the operator or orderer of the mediation server, and may be input in step S340 as a reference for selecting a successful bidder when no successful bidder is selected by the step S220 or the step S260.

In step S360, the bidder who presented the bidder based on the criterion of the step S340 is selected as a successful bidder, and the reverse auction is terminated. When the reverse auction ends, no more information is provided to other bidders.

FIG. 7 is an exemplary diagram illustrating a reverse auction process when a bidding price corresponding to a client's desired construction cost is presented by a network-based service brokering method for service ordering.

Referring to FIG. 7, the planned construction cost calculated by the mediation server is 1,000, the desired construction cost of the client is 830, the upper limit of the desired construction cost is 840, and the companies participating in the reverse auction are three companies: A company, B company, and C company. Company participated.

Company A, the first to participate in the reverse auction, offered 950 bidders. When a bidder is input from the A company, the mediation server executes a successful bidder selection process. As a result of the execution, the bidder is more expensive than the desired construction cost, so the reverse auction is continued.

Company B, who participated in the reverse auction for the second time, cannot know the information about Company A marked by code (****), but the bid price suggested by Company A can be confirmed. The company B presented 850 with reference to the bidder of the company A and the construction cost calculated by the company A. When the bidder is input from the B company, the mediation server executes a successful bidder selection process. As a result of the execution, the bidder is more expensive than the desired construction cost, so the reverse auction is continued.

The third company, which participated in the reverse auction, cannot know the information about the A and B companies and the number of bidders, and can only confirm the two bidders for the reverse auction. The C company presented 830 with reference to the two bidders and the construction cost calculated by the company, and the bidding price presented by the company C matches the client's desired construction cost, so the broker server selects the C company as the successful bidder. The reverse auction requested by the client is completed.

FIG. 8 is an exemplary diagram illustrating a reverse auction process when three bidders present bidders corresponding to a client's desired construction cost upper limit by a network-based service brokering method for service ordering. In particular, in the example shown in FIG. 8, (1) no bidding price corresponding to the desired construction cost was presented, (2) only one of three bidders included in the optimum price range, and (3) a successful bidder in real time. The case where the reverse auction is carried out until the end of the reverse auction without selecting is described.

Referring to FIG. 8, the planned construction cost calculated by the mediation server is 1,000, the desired construction cost of the client is 830, the upper limit of the desired construction cost is 840, and the companies participating in the reverse auction are three companies: A company, B company, and C company. Company participated.

Company A, the first to participate in the reverse auction, offered 950 bidders.

Secondly, Company B who participated in reverse auction cannot know the information about Company A marked by code, and only bidder who receives the construction construction service by the reverse auction by referring to the bid price suggested by company A and the construction cost calculated by him. Can be presented. Company B offered 860 as a bid.

The third company, which participated in the reverse auction, cannot know the information about the A and B companies and the number of bidders, and can only confirm the two bidders for the reverse auction. The company C proposed 840 by referring to the two bidders and the construction cost calculated by the company, and the bidder presented by the company C met the upper limit of the desired construction cost of the client.

The fourth company participating in the reverse auction cannot know the information and number of bidders about the B and C companies, which are coded, and can only see their first bid for the reverse auction and the two bidders presented by other competitors. . Therefore, Company A revised the bid price to 820 in order to offer a price more competitive than the competitor who offered a lower bid, based on the bid price suggested by the company.

The fifth company to participate in reverse auctions cannot know the information and number of bidders about Company A and C coded, but can only see their first bid for the reverse auction and the three bidders presented by other competitors. . Therefore, Company B revised the bid price that he suggested at the time of initial participation to 780 by referring to the bid price of another competitor presented above.

The sixth company who participated in reverse auctions cannot know the information and number of bidders about Company A and Company B coded, but can only see their first bid for the reverse auction and the four bidders presented by other competitors. . Accordingly, Company C revised the bid price suggested at the time of its initial participation to 700 by referring to the bid price of another competitor.

After the bidding of company C, the reverse auction is ended, and the intermediary server selects the bidder C who presented the bidder located at the upper limit of the desired construction cost and the desired construction cost as the successful bidder, and the successful bidding price is 840, and the reverse auction ends. do.

FIG. 9 is an exemplary diagram illustrating a reverse auction process when three bidders present bidders that do not meet a client's upper limit on a desired construction cost by a network-based service brokering method for service ordering. In particular, in the example shown in FIG. 9, (1) no bidder matching the desired construction cost was presented, (2) none of the three bidders included in the optimal price range, and (3) a bidder was selected in real time. Instead, the case where the reverse auction proceeds to the end date of the reverse auction will be described.

Referring to FIG. 9, the planned construction cost calculated by the mediation server is 1,000, the desired construction cost of the client is 830, the upper limit of the desired construction cost is 840, and the companies participating in the reverse auction are three companies: A company, B company, and C company. Company participated.

Company A, the first to participate in the reverse auction, offered 950 bidders.

The second company, which participated in the reverse auction, cannot know the information about the company A coded, but can only confirm the initial bidder for the reverse auction. Therefore, the company B may present a bidder for the successful bidding of the building construction service by the reverse auction by referring to the bidder proposed by the company A and the construction cost calculated by the company A. Company B offered 860 as a bid.

The third company participating in the reverse auction cannot know the information and number of bidders about the companies A and B which are coded, and can only check the two bidders suggested by other competitors for the reverse auction. Therefore, the company C proposed 820 based on the two bidders and the construction cost calculated by them.

Company A who participated in the reverse auction for the fourth time does not know the information and number of bidders about Company B and Company C which are coded, but only the two bidders presented by other competitors for the reverse auction and the bidder first presented by them. Can be. Therefore, Company A revised the bid price to 810 in order to offer a price more competitive than the competitor who offered a lower bid, based on the bid price suggested by the company.

The fifth company that participated in reverse auctions cannot know the information and number of bidders about Company A and C which are coded, but only the three bidders presented by other competitors for the reverse auction and the bidder first presented by them. Can be. Accordingly, Company B revised the bidders suggested at the time of their first participation to 780 with reference to the three bidders and the bidders suggested by them.

After the auction of the company B, the reverse auction is ended, the mediation server selects the successful bidder, calculates the minimum bid average of the A, B and C companies participating in the reverse auction, and then closes the bidder 810.33. The B company which presented KEB was selected as a successful bidder, the winning bid amount was 810, and the reverse auction was ended.

FIG. 10 is an exemplary diagram illustrating a reverse auction progress process when a bidder presents a bidder meeting a client's upper limit on a desired construction cost by a network-based service brokering method for ordering a service. In particular, the example shown in FIG. 10 is a case of reverse auction in which (1) no bidding price corresponding to the desired construction cost is presented, and (2) bidders are set to bid when the bidder bids less than 2, and (3) The case where the reverse auction is performed until the end of the reverse auction without selecting the winner in real time.

Referring to FIG. 10, the planned construction cost calculated by the mediation server is 1,000, the desired construction cost of the client is 830, the upper limit of the desired construction cost is 840, and the company participating in the reverse auction is a company A and B. It was.

Company A, the first to participate in the reverse auction, offered a bid of 900.

The second company, which participated in the reverse auction, cannot know the information about the company A coded, but can only confirm the initial bidder for the reverse auction. Therefore, the company B may present a bidder for the successful bidding of the building construction service by the reverse auction by referring to the bidder proposed by the company A and the construction cost calculated by the company A. Company B offered 840 as a bid.

Third, the company A who participated in the reverse auction cannot know information about the company B marked by the code, and can only confirm the first bidder of B company and the bidder of B company. Therefore, A company revised the bid price to 800 in order to win the building construction service by the reverse auction by referring to the bid price suggested by company B.

The fourth company, which participated in the reverse auction, cannot know the information about the company B which is coded, and can identify only the two bidders and the bidders of the B company which he presented twice. Therefore, Company A revised the bidder to 750 in order to win the building construction service by the reverse auction by referring to the bidder presented at the third participation.

Fifth, A company participating in the reverse auction cannot know information about Company B marked by code, and can only identify three bidders and B bidders that he presented three times. Accordingly, Company A revised the bid price to 700 in order to win the building construction service by the reverse auction by referring to the bid price suggested at the fourth participation.

After the fifth auction of Company A, the reverse auction is ended, and the mediation server determines whether the number of bidders participating in the reverse auction exceeds the bidding limit set by the client in advance (assuming two or less companies in this case). In the example shown in FIG. 10, Company A presented the bidder four times, and Company B presented the bidder only once. Therefore, Company B cannot know the number of bidders who participated in reverse auctions, while Company A is the second of the five bidders presented, and the number of bidders who participated in reverse auctions is not the bidder he offered. It can be seen. After the reverse auction ends, even if the number of bidders is 2 and one of the bidders can know the number of bidders participating in the reverse auction, if the result of the reverse auction matches the intention of the client, there is no need to send the reverse auction again. That is, even if a bidder knows that there are two bidders participating in the reverse auction, the bidder's desired construction cost is not known. Therefore, the bidder who first presents or revises the bidder's desired quality and provides the bidder's own profit. It can be the lowest price that can be paid. Therefore, when there is no defect in the result of the reverse auction, such as when the successful bid price is included in the optimum price range, the reverse auction may not be processed by additionally asking the intention of the client.

As a result of the determination, since the bidder is 2 or less, and there is a bidder meeting the upper limit of the desired cost of construction, the reverse auction may be processed and sent to the reverse auction, or the result of the reverse auction may be terminated according to the selection of the client. In this example, since there is a bidding price of B company that meets the upper limit of the desired cost of the client, the bidder is selected as a successful bidder who presented the bidder located at the upper limit of the desired cost and the desired cost of the bidder according to the client's choice. After 840, reverse auction ends.

FIG. 11 is an exemplary diagram illustrating a reverse auction process when two bidders present bidders that do not meet a client's upper limit on a desired construction cost by a network-based service brokering method for service ordering.

In particular, the example shown in FIG. 11 is a case of reverse auction in which (1) no bidding price corresponding to the desired construction cost is presented, and (2) bidders are set to bid when the bidder bids less than 2, and (3) The case where the reverse auction is performed until the end of the reverse auction without selecting the winner in real time.

Referring to FIG. 11, the planned construction cost calculated by the mediation server is 1,000, the desired construction cost of the client is 830, and there is no upper limit of the desired construction cost. A company participating in the reverse auction is a company A and a company B. A total of two companies participate. It was.

Company A, the first to participate in the reverse auction, offered a bid of 900.

The second company, which participated in the reverse auction, cannot know the information about the company A coded, but can only confirm the initial bidder for the reverse auction. Therefore, the company B may present a bidder for winning the building construction service by the reverse auction by referring to the bidder first presented and the construction cost calculated by the company. Company B offered 840 as a bid.

Third, the company A who participated in the reverse auction cannot know information about the company B marked by the code, and can only confirm the first bidder of B company and the bidder of B company. Therefore, the company A modified the bidder to 800 to receive a bid for building construction service by the reverse auction by referring to the bidder proposed for the second time.

The fourth company, which participated in the reverse auction, cannot know the information about the company B which is coded, and can identify only the two bidders and the bidders of the B company which he presented twice. Therefore, Company A revised the bidder to 790 in order to win the building construction service by the reverse auction by referring to the bidder presented at the third participation.

Fifth company B who participated in the reverse auction cannot know the information about Company A that is coded, and can only check the three bidders presented by the bidders presented by him and the other competitors. Accordingly, Company B revised the bidder to 780 to receive the construction construction service by the reverse auction by referring to the bidder proposed for the fourth time.

The sixth company who participated in the reverse auction cannot know the information about the company B coded, but can only identify the three bidders presented by him three times and two bidders presented by other competitors. Therefore, the company A modified the bidder to 750 to receive the bid for building construction service by the reverse auction by referring to the bidder proposed for the fifth time.

The seventh company who participated in the reverse auction cannot know the information about the company B coded, but can only identify the four bidders he presented four times and two bidders presented by other competitors. Therefore, Company A revised the bidder to 740 to receive the bid for building construction service by the reverse auction by referring to the bidder proposed for the sixth time.

After the 7th bid of Company A, the reverse auction ends, and the intermediary server calculates the minimum bid average of the A and B companies that participated in the reverse auction through the selection of successful bidders, and then closes the bid 750 which is the closest to the minimum bid average (760). Company A is selected as a successful bidder, the winning bid amount is 750, and the reverse auction ends.

As described above, the present invention has been described with reference to detailed embodiments, but the present invention is not limited to the above embodiments, and many modifications are possible by those skilled in the art within the spirit of the present invention. Of course.

As described above, the bidder who bids the bidder closest to the desired construction cost selected by the client as the bidder's upper limit on the appropriate scheduled construction cost calculated by an expert or a computer program that can calculate the appropriate planned construction cost according to the present invention. Network-based service brokering method and system for ordering service to be selected as was provided.

In addition, the bidder who participated in the reverse auction can read the scheduled construction cost and the data on which the estimated construction cost is calculated.However, the bidder's desired construction cost cannot be known, and therefore, it is impossible to present the dumping price for unconditional order. The optimal price for the construction cost of the building can be derived.

In addition, since the bidder's auction price is disclosed in the order of participation, the rest of the bidder's information, namely the company name and the number of bidders, are not disclosed, so it is impossible to estimate the approximate value of the bidding price, that is, the estimated construction cost or the average price, Proposal of the construction cost can be induced to prevent the occurrence of poor construction.

In addition, since the bid price of the bidder participating in the reverse auction on the Internet is disclosed in real time, the occurrence of irregularities such as collusion in the reverse auction process, the outflow of the successful bid price can be fundamentally blocked.

In addition, by allowing the bidder participating in the reverse auction can be repeatedly bid on the same reverse auction, the optimal price range of the construction cost is voluntarily formed by at least one bidder, thereby improving the disadvantages of the conventional bid.

In addition, since the client directly inputs the desired construction cost as a code number, information leakage of the desired construction cost is blocked, and even if the bidder presents an inappropriate price for the purpose other than normal reverse auction, the bidder cannot receive the bid unless it meets the client's desired construction cost. In other words, imagination can be blocked at the source to lower the winning bid.

Claims (29)

In the online reverse auction method, which is executed in an intermediary server which is coupled to at least one client terminal and at least one bidder terminal through a network and performs reverse auction requested by the client, Calculating a predetermined service price according to the estimated service price calculation data received from the orderer terminal; Desired service price, desired service price upper limit and reverse auction information received from the client terminal, including ordering information, bidder lower limit, bidding processing, reverse auction progress period, and reverse auction information table and progress information table corresponding to the scheduled service price. Generating and storing the desired service price, a desired service price upper limit, reverse auction information, and a planned service price in the generated reverse auction information table; Retrieving the reverse auction and corresponding bid price calculation data in progress or corresponding to the reverse auction list request received from the bidder terminal from the reverse auction information table and the progress information table and transmitting the data to the bidder terminal; Storing a bidder repeatedly input from the bidder terminal in the progress information table, and determining whether the bidder satisfies a predetermined reverse auction end condition; And Ending the reverse auction if the reverse auction end condition is met, and selecting a bidder who has provided a bidder corresponding to a predetermined successful bidder selection condition as a successful bidder. The method of claim 1, The scheduled service price calculation document mentioned above, Network-based service mediation system including design books and specifications The method of claim 1, A desired service price, a desired service price upper limit and a reverse auction information received from the orderer terminal, a reverse auction information table and a progress information table corresponding to the predetermined service price, and generate the desired service price, a desired service price upper limit, a reverse auction information, and the like. The storing of the predetermined service price in the generated reverse auction information table may include: Generating a reverse auction information table to store the reverse auction information corresponding to the reverse auction information received from the orderer terminal, storing the reverse auction information, and assigning an identifier; Receiving a desired service price and a desired service price upper limit from the orderer terminal and storing the desired service price in the reverse auction information table; And Generating a progress information table for storing progress information on the reverse auction requested by the client, and allocating an identifier identical to the identifier assigned to the reverse auction information table; The method of claim 1, Bid calculation data, Network based service mediation system including the design book and specifications The method of claim 1, The reverse auction information table, Network based service brokerage system including identifier, orderer information, scheduled service price, desired service price, desired service price upper limit, bidder lower limit, bidding processing, reverse auction progression period, scheduled service price calculation data and registration date fields The method of claim 5, The reverse auction information table, A network based service brokerage system further comprising at least one lowest limit bidder field. The method of claim 1, The reverse auction progress information table, Network based service mediation system including identifier, bidder information, bid date and bidder fields The method of claim 1, The reverse auction end condition, The reverse auction ends when the bid price is equal to the desired service price of the orderer or the bid price is included in the desired service price or the upper limit of the desired service price (hereinafter, referred to as an 'optimal price') of the orderer; Network-based service brokerage system, which is a condition to end reverse auction when the end date has elapsed The method of claim 8, When the reverse auction end condition is met, the reverse auction is terminated, and the bidder who presents the bidder corresponding to the predetermined bidder selection condition may be selected as a successful bidder. A network-based service brokerage system comprising selecting a bidder who presents a bidder closest to the lowest bidder average as a bidder using the minimum bidder average of each bidder participating in the reverse auction as a first bidder selection condition. The method of claim 1, The reverse auction end condition, Network-based service brokerage system that is a condition to terminate the reverse auction when the reverse auction end date and time The method of claim 9, When the reverse auction end condition is met, the reverse auction is terminated, and the bidder who presents the bidder corresponding to the predetermined bidder selection condition may be selected as a successful bidder. Selecting a bidder who presents the bidder as a successful bidder if there is a bidder that matches the desired service price using a bidder that matches the desired service price as a second bidder selection condition; In the case of failing to select a successful bidder in this step, if a bidder included in the optimal price range exists by using a bidder included in the optimum price range as a third bidder selection condition, the bidder who presents the bidder is selected as a successful bidder. Doing; And If the bidder is not selected in the step, selecting a bidder who presents the bidder closest to the minimum bidder average by using the minimum bidder average of each bidder who participated in the reverse auction as a fourth bidder selection condition; Network based service mediation system The method of claim 6, The reverse auction end condition, A network-based service intermediation system is a condition that terminates reverse auction if the bid price matches the desired service price of the client or the bid price is within the optimal price range, otherwise, the reverse auction ends when the reverse auction end date elapses. The method of claim 12, When the reverse auction end condition is met, the reverse auction is terminated, and the bidder who presents the bidder corresponding to the predetermined bidder selection condition may be selected as a successful bidder. A network-based service brokerage system comprising selecting a bidder who presents a bidder closest to the lowest bidder average as a bidder using the minimum bidder average of each bidder participating in the reverse auction as a first bidder selection condition. The method of claim 13, When the reverse auction end condition is met, the reverse auction is terminated, and the bidder who presents the bidder corresponding to the predetermined bidder selection condition may be selected as a successful bidder. The network-based service intermediation system further comprises the step of excluding the bidder lower than the minimum limit bidder and the bidder who presented the bidder from the lowest bidder average calculation target and the successful bidder selection target, respectively. The method of claim 1, The reverse auction end condition, Network-based service brokerage system that is a condition to terminate the reverse auction when the reverse auction end date and time The method of claim 9, When the reverse auction end condition is met, the reverse auction is terminated, and the bidder who presents the bidder corresponding to the predetermined bidder selection condition may be selected as a successful bidder. Selecting a bidder who presents the bidder as a successful bidder if there is a bidder that matches the desired service price using a bidder that matches the desired service price as a second bidder selection condition; In the case of failing to select a successful bidder in this step, if a bidder included in the optimal price range exists by using a bidder included in the optimum price range as a third bidder selection condition, the bidder who presents the bidder is selected as a successful bidder. Doing; And If the bidder is not selected in the step, selecting a bidder who presents the bidder closest to the minimum bidder average by using the minimum bidder average of each bidder who participated in the reverse auction as a fourth bidder selection condition; Network based service mediation system The method of claim 16, When the reverse auction end condition is met, the reverse auction is terminated, and the bidder who presents the bidder corresponding to the predetermined bidder selection condition may be selected as a successful bidder. The network-based service intermediation system further comprises the step of excluding the bidder lower than the minimum limit bidder and the bidder who presented the bidder from the lowest bidder average calculation target and the successful bidder selection target, respectively. In a service brokering method executed in a service brokering server coupled to at least one service provider, at least one evaluator, and a service consumer through a network, Receiving a service and cost calculation data of the service from the service consumer through the network; Providing the service and cost calculation data of the service to the at least one evaluator; Receiving a first service price for the service from the at least one evaluator; Providing the first service price to the at least one service provider; Receiving a second service price for the service from the service consumer; Calculating a reference price based on at least one of the first service price and the second service price; Executing an auction by entering at least one bid price for the service from the at least one service provider; Determining a bid price or service provider to be dropped from the auction based on the reference price and a predetermined dropout condition; And And determining at least one service provider and a bid price meeting a predetermined bid condition among the non-dropout bid prices or service providers. The method of claim 18, The predetermined dropout condition is, A bidding price lower than the lowest limit bidding price and a network-based service brokerage method which is a condition for excluding bidders who have presented the bidding price from the bidder selection target. The method of claim 18, The predetermined bidding condition is A first successful bid condition for selecting a service provider that has provided a bid price that matches the reference price as a successful bidder, or a second for selecting a service provider who has provided a bid price included between the reference price and a second service price as a successful bidder A network-based service intermediation method, which is one of a third successful bid condition of selecting a service provider who has provided a bid price closest to a successful bid condition and an average price of a plurality of final bid prices. The method of claim 20, Determining at least one service provider and a bid price that meets a predetermined bid condition among the non-dropout bid price or service provider, Selecting a successful bidder using the first successful bid condition; Selecting a successful bidder using a second successful bid condition when the successful bidder is not selected at the step; And If the successful bidder is not selected at the step, selecting a successful bidder using a third successful bid condition. In a service brokering method executed in a service brokering server coupled to at least one service provider and a service consumer through a network, Receiving a service and cost calculation data of the service from the service consumer through the network; Receiving a first service price for the service based on the service and cost calculation data of the service; Providing the first service price to the at least one service provider and / or the service consumer; Receiving a second service price from the service consumer; Calculating a reference price based on at least one of the first service price and the second service price; Executing an auction by receiving at least one bid price for the service from the at least one provider; Determining a bid price or service provider to be dropped from the auction based on the reference price and a predetermined rule; And determining at least one service provider and a bid price meeting a predetermined bid condition among the non-dropout bid prices or service providers. In the network-based service brokerage system coupled to the at least one client terminal and at least one bidder terminal via the network to proceed with the reverse auction requested by the client, Means for calculating a predetermined service price corresponding to the estimated service price calculation data received from the orderer terminal; Desired service price, desired service price upper limit and reverse auction information received from the client terminal, including ordering information, bidder lower limit, bidding processing, reverse auction progress period, and reverse auction information table and progress information table corresponding to the scheduled service price. Means for generating; Means for storing the desired service price, a desired service price upper limit, reverse auction information, and a predetermined service price in the generated reverse auction information table; Means for searching the reverse auction information table and the progress information table for a reverse auction and a corresponding bid calculation data in progress or corresponding to the reverse auction list request received from the bidder terminal; Means for transmitting the ongoing or planned reverse auction and corresponding bid calculation data to the bidder terminal; Means for storing a bidder repeatedly input from the bidder terminal in the progress information table and determining whether the bidder satisfies a predetermined reverse auction end condition; And And a means for terminating the reverse auction if the reverse auction end condition is met and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a successful bidder. The method of claim 23, wherein The reverse auction information table, Network-based service brokerage system for service ordering including identifier, orderer information, scheduled service price, desired service price, desired service price upper limit, bidder lower limit, bidding processing, reverse auction progression period, estimated service price calculation data and registration date fields . The method of claim 24, The reverse auction information table, A network based service brokerage system for service ordering further comprising at least one lowest limit bidder field. The method of claim 24, The reverse auction progress information table, A network-based service brokerage system for ordering services that includes an identifier, bidder information, bid date and time, and bidder fields. In the network-based service brokerage system that is coupled to the at least one client terminal and at least one bidder terminal via a network running on a broker server for the reverse auction requested by the client A memory in which a program is stored; A processor coupled with the memory to execute the program Including but not limited to: The processor by the program, Calculating a predetermined service price corresponding to the estimated service price calculation data received from the client terminal; Desired service price, desired service price upper limit and reverse auction information received from the client terminal, including ordering information, bidder lower limit, bidding processing, reverse auction progress period, and reverse auction information table and progress information table corresponding to the scheduled service price. Generating the desired service price, the desired service price upper limit, the reverse auction information, and the planned service price in the generated reverse auction information table; Retrieving the reverse auction and corresponding bid price calculation data in progress or corresponding to the reverse auction list request received from the bidder terminal from the reverse auction information table and the progress information table and transmitting the same to the bidder terminal; Storing the bidder repeatedly input from the bidder terminal in the progress information table, and determining whether the bidder satisfies a predetermined reverse auction end condition; and And ending a reverse auction and selecting a bidder who has provided a bidder corresponding to a predetermined bidder selection condition as a successful bidder if the reverse auction end condition is met. In a service brokering method executed in a service brokering server coupled to at least one service provider, at least one evaluator, and a service consumer through a network, A memory in which a program is stored; A processor coupled with the memory to execute the program Including but not limited to: The processor by the program, Receiving a service and cost calculation data of the service from the service consumer through the network; Providing the service and cost calculation data of the service to the at least one evaluator, Receiving a first service price for the service from the at least one evaluator, Providing the first service price to the at least one service provider; Receiving a second service price for the service from the service consumer; Calculating a reference price based on at least one of the first service price and the second service price, Executing an auction by entering at least one bid price for the service from the at least one service provider, Determining a bid price or service provider to be dropped from the auction based on the reference price and a predetermined dropout condition, and A network-based service brokerage system that performs the step of determining at least one service provider and a bid price that meets a predetermined bidding condition among the non-dropout bid price or service provider In a service brokering method executed in a service brokering server coupled to at least one service provider and a service consumer through a network, A memory in which a program is stored; A processor coupled with the memory to execute the program Including but not limited to: The processor by the program, Receiving a service and cost calculation data of the service from the service consumer through the network; Receiving a first service price for the service based on the service and cost calculation data of the service, Providing the first service price to the at least one service provider and / or the service consumer, Receiving a second service price from the service consumer; Calculating a reference price based on at least one of the first service price and the second service price, Executing an auction by receiving at least one bid price for the service from the at least one provider, Determining a bid price or service provider to be dropped from the auction based on the reference price and a predetermined rule, And determining at least one service provider and a bid price meeting a predetermined bid condition among the non-dropout bid price or service provider.