WO2001071579A1

WO2001071579A1 - Method and apparatus for bi-directionally auctioning between buyers and sellers using computer network

Info

Publication number: WO2001071579A1
Application number: PCT/IB2000/001350
Authority: WO
Inventors: Jae Kil Kim
Original assignee: Jae Kil Kim
Priority date: 2000-03-22
Filing date: 2000-08-21
Publication date: 2001-09-27
Also published as: GB0222026D0; KR100370432B1; GB2378291A; AU2000270350A1; KR20000036581A

Abstract

The present invention is a method and apparatus for bi-directionally auctioning using a computer network, wherein a plurality of selling prices and lower-price-accumulated selling quantity as to the one goods are displayed in real time. One or more sellers participate competitively by registering a selling price and selling quantity for the one goods. One or more buyers select an acceptable selling price competitively by referring to each displayed selling price and lower-price-accumulated selling quantity. A transaction between a buyer selecting first and all sellers who are related to the lower-price-accumulated selling quantity selected by the buyer is consummated.

Description

METHOD AND APPARATUS FOR BI-DIRECTIONALLY AUCTIONING BETWEEN BUYERS AND SELLERS USING COMPUTER NETWORK

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention relates generally to a method and apparatus for performing commercial transactions using a computer network, and in particular, to a method and apparatus for bi-directionally auctioning using a computer network.

Description of the Prior Art Electronic commercial transactions are typically classified as a shopping mall method, an auction method, a Dutch auction method or a brokerage method.

Most electronic commerce transactions adopt a shopping mall method. In a shopping mall method, sellers open a virtual marketplace on the internet and display goods to sell in the opened virtual marketplace, and buyers order goods by visiting the virtual marketplace. The shopping mall method is a seller-driven method in which a buyer buys goods after seeing the price presented by a seller. Typically, a buyer buys the goods from the cheapest shopping mall after surveying prices of the same products in a plurality^' of different shopping malls. Thus, a buyer has the trouble and the inconvenience of remembering the cheapest shopping mall for each of the goods after surveying prices in the plurality of different shopping malls. Also, because each shopping mall has different payment method, ordering method, delivery period and delivery fare, a buyer has the further burden of rearranging all these conditions for each purchase.

In the auction method, a seller puts up goods at auction, a large number of buyers present various prices, and a transaction is accomplished by selecting a buyer who presents the highest price for the goods. Because the auction method determines the highest price by making a plurality of buyers compete with each other, it is necessary for buyers to make an effort to acquire the auction information and to participate in the auction by finding the auction place and the auction times for related goods.

The Dutch auction method, as disclosed in U.S. Patent No. 5,794,207, is an auction in which a certain price is set and gradually lowered by the auctioneer until a bid is received, the first bidder becoming the buyer. In a Dutch auction, a large number of sellers compete for one purchase condition, and it is convenient to a buyer because it is a buyer-driven transaction. However, a seller can not expect to make a large quantity of transactions because every transaction is consummated with one buyer. In the brokerage method, as disclosed in Korean Patent application No. 1999-78767, a broker consummates a transaction between a buyer and a seller. The broker connects a buyer and a seller by finding the lowest desired selling price from a desired purchase price. In the brokerage method, a buyer and a seller register at the same time. Thus, similar to the Dutch auction, a seller can not expect a large quantity of transactions because every transaction is consummated with one buyer. Also, a buyer could not buy from a number of sellers selling small quantities of the same kinds of goods in a single transaction. A synergy auction, as can be found at the world-wide web site of www.auction.co.kr, is a kind of a cooperative purchase method wherein goods, selling quantity, purchase quantity, and present price are displayed and a fixed amount of money is discounted in response to the increase of the purchase quantity of a corresponding good. In this method, the quantity of goods is limited in advance. A buyer cannot present a purchase price, and the purchase price falls in a fixed rate. In addition, the discountable money is restricted. The above-described electronic commerce methods cannot accomplish the transaction of aggregate sales because they are an one to one or one to majority method between a seller and one or more buyers. That is, because each purchase and sale is accomplished between one seller and one buyer or one seller and many buyers, sellers cannot present various selling prices for the same kind of goods, and buyers of large quantity cannot buy goods from a number of sellers of small quantity in one transaction. SUMMARY OF THE INVENTION

The above-described and other drawbacks are overcome by a method for bi-directionally auctioning using a computer network. The method includes displaying one or more selling prices for goods and a lower-price-accumulated selling quantity of the same type of goods at or below each selling price. One or more sellers participate competitively for a desired selling price by referring to each displayed selling price and the lower-price-accumulated selling quantity, then selecting an acceptable selling price for that quantity. A transaction is confirmed between the buyer who first selects a displayed selling price and lower-price-accumulated selling quantity and all sellers at and below the selected selling price .

In one embodiment, a transaction between a plurality of sellers and a plurality of buyers is characterized by the plurality of sellers inputting data into a computer, the data including: a goods/model description, selling price, selling quantity, and sales contract money. The computer is arranged to show one or more selling prices, a selling quantity for each selling price, and a lower-price-accumulated selling quantity, which is obtained by summing the selling quantities at or below each selling price. One or more buyers select competitively an acceptable selling price and lower-price- accumulated selling quantity among the one or more selling prices and lower-price-accumulated selling quantities of each goods/model shown on the computer. The computer then gives purchase authority of the lower-price-accumulated selling quantity at the selected selling price to the buyer selecting first in the selection step. The computer then consummates a transaction between the determined buyer and all sellers having goods at or below the selected purchase price. The selling price for all buyers is the selected purchase price. In one embodiment of the method of the present invention, a buyer buys the entire lower-price-accumulated selling quantity, and in other embodiment, the buyer buys a portion of the lower-price-accumulated selling quantity. In the former embodiment, it is profitable for a buyer who purchases a large amount of goods. In the latter embodiment, a buyer can buy at lower price and can accommodate various purchase quantities. Also in the latter embodiment, the sale is consummated between the buyer and those sellers who registered their goods first.

In another embodiment, selling term information and total amount information are displayed. Selling term information indicates how long the goods will be available, and total amount information is obtained by multiplying a selling price and its accompanying lower-price-accumulated selling quantity. In another embodiment, information for analyzing the fluctuation of price and lower-price-accumulated selling quantity is displayed to help purchase strategy. Other analysis graphs can also be included, such as a graph depicting purchase quantity and lower-price-accumulated purchase quantity as a function of selling price, a graph of a confirmed purchase price as a function of selling time, and a graph of the decided accumulated purchase quantity

(transaction quantity) as a function of purchase decision time. These analysis graphs help a seller to register selling price and help a buyer to determine purchase time and selling price . In another embodiment, after a number of buyers select an acceptable selling price and lower-price-accumulated selling quantity, the purchase authority is determined by the •sequence in which purchase contract money is deposited by the buyers . An apparatus for bi-directionally auctioning using a computer network includes a storing means where a bidirectional auction program is stored, and a processor that executes .the bi-directional auction program stored in the storing means. Each seller inputs goods/model, selling price, selling quantity, and sales contract money data. The processor outputs one or more selling prices, a selling quantity as to each selling price, and an lower-price- accumulated selling quantity obtained by summing selling quantities at or below each selling price. The processor accepts input selection data from one or more buyers who select competitively an acceptable selling price and lower- price-accumulated selling quantity from the one or more selling prices of each displayed goods/model. The processor provides purchase authority of the lower-price-accumulated selling quantity to the buyer selecting first in the selection step, and confirms a transaction between the determined buyer and all sellers at or below the selected selling price.

The storing means includes a member database, a selling registration database, a selling registration display database, a purchase offer database, a purchase decision database and a registered goods database.

BRIEF DESCRIPTION OF THE DRAWINGS

An exemplary embodiment of the present invention will now be discussed in detail with reference to the attached drawings in which:

FIG. 1 is a transactional diagram of a method for bi- directionally auctioning using a computer network of the present invention;

FIG. 2 is a schematic diagram of an apparatus for bi- directionally auctioning using a computer network of the present invention;

FIG. 3 is a drawing showing the configuration of a buyer member database of an apparatus for bi-directionally auctioning using a computer network of the present invention; FIG. 4 is a drawing showing the configuration of a seller member database of an apparatus for bi-directionally auctioning using a computer network of the present invention; FIG. 5 is a drawing showing the configuration of a selling registration database of an apparatus for bi- directionally auctioning using a computer network of the present invention; FIG. 6 is a drawing showing the configuration of a selling registration display database of an apparatus for bi- directionally auctioning using a computer network of the present invention;

FIG. 7 is a drawing showing the configuration of a purchase offer database of an apparatus for bi-directionally auctioning using a computer network of the present invention;

FIG. 8 is a drawing showing the configuration of a purchase decision database ^'of an. apparatus for bi- directionally auctioning using a computer network of the present invention;

FIG. 9 is a drawing showing the configuration of a registered goods database of an apparatus for bi- directionally auctioning using a computer network of the present invention; FIGS. 10 through 13 are flowcharts illustrating the operation of a server of an apparatus for bi-directionally auctioning using a computer network of the present invention;

FIG. 14 is a flowchart illustrating the operation of a terminal of an apparatus for bi-directionally auctioning using a computer network of the present invention; FIGS. 15 through 24 are drawings showing screens illustrating the operation of a terminal of an apparatus for bi-directionally auctioning using a computer network of the present invention; and FIGS. 25 through 27 are graphs for transaction analysis of an apparatus for bi-directionally auctioning using a computer network of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT FIG. 1 shows the configuration of a method for bi- directionally auctioning of the present invention. As illustrated in FIG. 1, the bi-directional auctioning method of the present invention is accomplished by a transaction between a seller 10 and a buyer 20, which is consummated through a bi-directional auctioning system 30. Payment money is paid from the buyer 20 to the seller 10, and the seller 10 delivers the purchased goods to the buyer 20.

The present invention differs from a general auction or a Dutch auction because, in the present invention, registration of various selling prices as to one product is possible and a buyer can select a selling price by considering a lower-price-accumulated selling quantity and a total sale price for that lower-price-accumulated selling quantity. The total sale price is determined by multiplication of the lower-price-accumulated selling quantity and selling price. As a result, the present invention gives an expectation to sellers of small quantities of goods that they can sell their goods at a low price by making a large amounts of transactions consummated at a reasonable price generally by inducing a selling registration of sellers competitively to a selling price having a high possibility to select seller according to a lower-price- accumulated selling quantity. Also, a buyer can secure a large quantity of desired goods by making a deposit of only a portion of the purchase money, for example 10 % of the purchase money. The method of the present invention is useful, for example, for transactions between producers of small quantities of goods, such as farm products or marine products, and wholesale dealers who buy a large quantity of the goods. Also, the method of the present invention is useful for transactions between sellers of small quantities of unlisted stocks or off-board transaction stocks and bonds and government or institutional buyers who would buy a large quantity of the stocks or bonds from the sellers .

Referring to Table 1, an example of the bilateral auction method of 'the present invention can be described. As shown in Table 1, seven sellers, each selling a small quantity of similar goods at different prices, express a selling intention on a bilateral auction site. The product has a production cost of 30,000 South Korean won and a general selling price (retail price) of 50,000 won. It should be noted that the present invention is not limited to one form of currency. Therefore, while the present example uses South Korean won, any currency (e.g., U.S. dollars) can be similarly used.

Buyers, determine a purchase strategy using the total amount of purchase money, which is obtained by multiplying the selling price and the lower-price-accumulated selling quantity. When a buyer selects a purchase price, the goods at or below the purchase price are bought at that purchase price, For example, if the purchase price is 40,000 won, the goods priced at the lower prices of 35,000 won, 30,000 won, and 28,000 won are bought at 40,000 won. Thus, sellers registered at lower selling prices sell at a selling price higher than the selling price at which they registered. As a result, sellers of a small quantity of goods can expect an increase in earnings, and, therefore, the method of the present invention will induce more sellers of small quantity to register their goods. Also, when a purchase is decided, it is possible for a buyer to buy a small quantity at a lower selling price. Therefore, this method can also benefit a buyer.

Referring again to Table 1, a seller having sufficient funds will register at a selling price of 45,000 won to achieve high earning rate. A seller who urgently needs funds will register at a low selling price, below 40,000 won, to achieve a rapid sale.

Buyers offer a purchase price according to the number of goods they need and the purchase strategy profitable to themselves. Meanwhile, because a seller participates competitively for a selling price having a purchase determination possibility in the highest price at the earliest time, an accumulated selling quantity of higher possibility of purchase determination shows a relatively higher increase than other selling price. This phenomenon is a natural free market competition principle and induces a selling price of a seller to a selling price of highest consumer's interest.

Referring now to the following Table 2, a generalized example of the bilateral auction method of the present invention can be described.

The method of transacting goods G using a computer network involves receiving selling offer information from a seller. The selling offer information includes a recommended selling price P and a recommended selling quantity A for the goods G. Next, the received recommended selling quantity A is added to a recommended selling quantity Qj for the same recommended selling price Pj , where 1 ≤ j < n, and where Pj is lower than P(j+1). Pj is the same recommended selling price as the received recommended selling price P among selling prices between PI ~ Pn for the goods G. The lower- price-accumulated selling quantity AQn = Qj is consequently updated as a result of adding the received recommended selling quantity A.

Selling offer registration information is provided to at least one buyer where the selling offer registration information has lower-price-accumulated selling quantities AQ1, AQ2, . . . and AQn for the corresponding recommended selling prices PI, P2, . . . and Pn for the goods G.

The selection of at least one buyer is received where the selection is the lower-price-accumulated selling quantities acceptable by each of the buyers in total selling price. Finally, the transaction is confirmed between a buyer and a plurality of sellers, where the plurality of sellers are related to the lower-price-accumulated selling quantity selected by the buyer. In an alternative embodiment, the transaction is decided between the plurality of sellers related to the lower-price-accumulated selling quantity AQn and a plurality of buyers who have each bid for a portion of the lower-price accumulated selling quantity AQn. Additionally, it is desirable that the selling offer registration information further includes each selling total amount, TA(l)n = ∑Pj x Qj , and/or TA(2)n = Pn x AQn of all the recommended selling prices. Referring back to Table 2, TA(l)j shows the case that the transaction is achieved with recommended selling prices PI, . . . , Pj-1, and Pj of each of the sellers, and TA(2)n shows the case that the transaction is achieved with a recommended selling price Pj selected by a buyer. Therefore, in case that TA(2)n is determined, sellers having requested a recommended selling price at lower prices Pi, . . . and Pj-1 accomplish the transaction at a price Pj , which is higher than their desired recommended selling price.

FIG. 2 shows a configuration of a bi-directional auctioning apparatus of the present invention.

A bi-directional auctioning apparatus includes a server 100 with a processor to execute a bi-directional auction program, and a storing means 110 where a database is stored. The server 100 executes the bi-directional auction program by referring to or renewing various databases stored in the storing means 110.

Database includes buyer member database BMDB 111, seller member data base SMDB 112, selling registration data base SRDB 113, selling registration display data base SRDDB 114, purchase offer database PODB 115, purchase decision data base PDDB 116 and registered goods data base RGDB 117. A bi-directional auctioning apparatus includes terminals 130 and 140 that are connected to the server 100 through a computer network, like an internet 120. Terminals 130 and 140 include any display output such as a personal computer, a notebook computer, a hand computer, an internet cellular phone and an internet television. A purchase offer and a selling registration program are installed in a purchase offer terminal 130 and a selling registration terminal 140, respectively. The purchase offer and selling registration programs are downloaded from the server 100 through the internet, or are installed on a hard disc drive of terminals 130 and 140 via a distributed recording medium such as a compact disc (CD) or floppy disc. Referring to FIG. 3, buyer member database 111 includes fields such as: ID, password, name (company name), resident registration number (business registration number) , zip code, address, emergency contact, E-MAIL, new selling registration list, bonus point, purchase result list, bonus point, and credit rating.

Address includes a home address or a recipient address. Emergency contact includes a telephone number, mobile phone, or pager number.

New selling registration list includes data for the cases when a buyer registers new goods not registered on server 100, or registers a new selling price not included in the proceeding selling prices for goods registered on server 100. For example, if selling prices registered to A goods are 10,000 won and 9,000 won, a buyer can register 9,500 won as a new selling price. A buyer can reserve bonus points according to new selling registration and substitute it for electronic money. A member of the bi-directional auction site is awarded bonus points according to the frequency of site use or the amount of transactions made on the site. In the purchase result list, contents such as purchase decision content, goods, quantity, total amount of purchase money related to a selling price selected by a buyer, and an accumulated selling quantity are listed.

Buyer member management is performed using an automatically-graded credit rating. The credit rating is performed by considering the number of new selling registrations, bonus point reservations according to purchase result, the rate of returned goods, the number of dissatisfaction complaints, and the number of delivery accidents.

Referring to FIG. 4, the seller member database 112 includes: ID, password, name (corporate name or company name), resident registration number (business registration number) , zip code, address, emergency contact, E-MAIL, new selling registration list, bonus points, proceeding selling registration list, selling result list, bonus points, and credit rating.

The proceeding selling registration list includes selling registration content for goods that the seller is selling whose selling terms are not ended and whose purchase is not decided. Therefore, a seller can view the progress of his own selling registration by referring to the proceeding selling registration list. An invalid selling registration situation is one in which a seller participates in selling result list but whose purchase is not decided. A valid selling registration situation is one whose purchase is decided and whose transaction is completed. A whole selling registration situation includes both invalid and valid selling registrations, _ including the total amount of accumulated sales whose transactions are accomplished. Therefore, the rate of sales according to the number of selling registrations of each seller can be checked. As a result, a manager of server 100 can provide electronic money or bonus goods by reserving bonus points according to selling results. by considering the total number of registrations, the selling hit rate and total amount of accumulated sales. Credit rating is used in seller management whereby the credit grade of a seller is automatically given by reflecting the number of cancellations after selling registration, the number of returned goods, and the selling result of the corresponding seller. Referring to FIG. 5, selling registration database 113 includes selling registration number, name of goods and model, selling price, selling quantity, selling term, seller ID, sales contract money, credit card number, term of card validity, name on card, other items. Selling registration number is provided automatically by the server 100 according to the order in which selling registrations are received. Selling term is determined at by a seller by considering the amount of time needed to sell the goods . Sales contract money is calculated automatically as a portion, for example 10%, of the selling price. Sales contract money is not repaid when a selling registration is cancelled and is repaid into a settlement account of a credit card when the selling term ends.

When a transaction is consummated by a purchase decision, sales money is received into a credit card settlement account.

Referring to FIG. 6, the selling registration display database 114 includes goods registration number, name of goods and model, general selling price, brief description, selling price, selling quantity, lower-price-accumulated selling quantity, total amount of purchase money, and % of a day purchase term closing quantity among total accumulated selling quantity.

Selling registration display data is provided to terminals 130 and 140 in real time in order for a buyer and a seller to see the selling registration situation.

Selling quantity is the total selling quantity (i.e. number of goods) registered at the corresponding selling price. Lower-price-accumulated selling quantity indicates the selling quantity obtained by accumulating the total selling quantity of goods at and below the corresponding selling price.

The selling registration distribution for each good is distributed concentratively around a prime cost and rapidly decreases as the cost approaches the wholesale (general) selling price and as the cost approaches zero. In other words, the selling quantity for each selling price can be depicted as a bell-shaped curve.

However, because the goods comprising the lower-price- accumulated selling quantity are all sold at the higher selling price, the lower-price-accumulated selling quantity draws a S character curve having high slope around the prime cost.

Total amount of purchase money is calculated automatically by multiplication of the lower-price- accumulated selling quantity and selling price. The total amount of purchase money helps the buyer to determine the total cost of the purchase. Also, the seller can determine the time at which to buy by viewing the selling quantity whose selling term is ended when the day passes as a percentage to the total accumulated selling quantity. Referring to FIG. 7, purchase offer database 115 includes: purchase offer number, goods registration number, name of goods and model, selling price, lower-price- accumulated selling quantity, total amount of purchase money, buyer ID, purchase contract money, credit card number, term of card validity, and name on card.

Purchase offer database^" 115 comprises data inputted when a buyer offers a purchase through a terminal 130 or 140. Purchase contract money is calculated automatically as 10% of the total amount. Purchase contract money is drawn out from a settlement account of an inputted credit card number and is paid to an account of an operator. The purchase authority is given to the buyer who pays first. When a purchase is cancelled, the purchase contract money is not repaid but is distributed to the related sellers as an indemnity.

Referring to FIG. 8, purchase decision database includes: purchase decision number, goods registration number, name of goods and model, purchase price, lower-price- accumulated selling quantity, total amount of purchase money, buyer ID, and IDs of total related sellers, other items.

The purchase decision database is automatically created by referring to the purchase offer database and the selling registration database. Purchases from all sellers related to the selected selling price and the lower-price-accumulated selling quantity are decided once the purchase is decided by competitive purchase offer.

Referring to FIG. 9, the registered goods database includes: goods registration number, name of goods and model, general selling price, brief description, detail description, large classification, medium classification, small classification, accumulated sales quantity, and manufacturing company homepage link information URL (UNIFORM RESOURCE LOCATORS) .

The brief description of registered goods database includes a photograph of the goods, representative specification, simple presentation of goods, and manufacturing company. The detail description includes a concrete detail description, structure, various photographs of goods and includes the reliability and a narrow view of goods investigated by an operator of the bilateral auction. FIG. 10 shows a flow chart to illustrate the server operation in a bi-directional auctioning apparatus of the present invention.

The process begins which server 100 checking for a specific time 1002. For example, 11:59 p.m. may be checked 1002 everyday. At the specific time, server 100 deletes selling registration instances whose selling term ended on that day, referring to SRDB 113. Server 100 also investigates 1004 the sales quantity of the selling registration instances whose selling term ended on the next day. Server 100 renews the sales quantity, lower-price- accumulated selling quantity, and total amount in the SRDDB of each good relating to the deleted selling registration instance. Server 100 renews 1008 SRDDB by calculating the % of the next day' s purchase term closing quantity among the total accumulated selling quantity for each type of good, and then registers 1008 the percentage in BMDB and SMDB.

If time is not checked at step 1002, the server 100 checks 1010 whether there is an application for member admission from terminals 130 and 140.

In the case that there is an application for member admission at step 1010, the server 100 checks 1012' whether it is an application for buyer member admission or for seller member admission. If it is an application for buyer member admission at step 1012, the server 100 inputs 1014 buyer member data and registers 1016 the inputted buyer member data in BMDB. If it is an application for seller member admission at step 1012, the server 100 inputs 1018 seller member data and registers 1020 the inputted seller member data in SMDB.

If it is not an application for member admission in step 1012, the server 100 checks whether there is selling registration offer from terminals 130 and 140.

In the case that there is selling registration offer at step 1022, the server 100 checks 1024 whether it is a new registration. If a new registration is found at step 1024, the server 100 checks 1026 whether it is a new goods registration. If it is a new goods registration at step 1026, the server 100 inputs 1028 the name of goods and model, selling price, selling quantity, selling term, seller ID, credit card number, term of card validity, and the name on card, and registers 1030 the inputted goods and model in the RGDB.

If a new goods registration is not found at step 1026, the server 100 inputs 1032 selling price, sales quantity, selling term, seller ID, credit card number, term of card validity, and name on card.

If it is not a new registration at step 1024, server 100 inputs 1034 sales quantity, selling term, seller ID, credit card number, term of card validity, and name on card.

The server 100 then checks 1036 for the receipt of money by requesting selling contract money from a payment account of a credit card number inputted in steps 1030, 1032 or 1034. In the case that selling contract money is not received at step 1036, server 100 handles 1038 as an error. In the case that selling contract money is received at step 1036, server 100 registers 1040 selling registration content inputted in SRDB, renews 1042 the related content of SRDDB, and registers 1044 selling registration content in BMDB or SMDB of the related ID.

If there is no selling registration offer at step 1022, the server 100 checks 1046 whether there is a purchase offer. In the case that there is a purchase offer from terminals 130, 140 at step 1046, server 100 inputs 1048 buyer ID, credit card number, term of card validity, and name on card, and registers 1050 the inputted purchase offer data in the PODB. Next, server 100 requests 1052 the payment of purchase contract money from the credit card settlement account of the inputted purchase offer and checks whether it is received or not. In the case that purchase contract money is not received at step 1052, server 100 handles 1054 the case as an error. In the case that purchase contract money is received at step 1052, server 100 determines 1056 the buyer whose contract money is received first.

When a buyer is determined, server 100 registers in the PDDB by referring to SRDB, PODB, and renewing the selling registration content of the decided purchase in the SRDDB. Server 100 also deletes the selling registration content in the SRDB, and registers 1058 the purchase decision content of the decided buyers and sellers in the BMDB and SMDB. Then, server 100 settles 1060 the purchase money payment by receiving money left, except the contract money of the purchase money, from each credit card settlement account of buyers.

Server 100 reads the delivery information of the purchase-decided buyer from the BMDB and provides all the decided sellers with delivery information of the buyer through E-mail. At the same time, server 100 provides .1062 a buyer with an ID list of all the sellers by referring to the SMDB. If there is not a purchase offer at step 1046, server 100 checks 1064 whether there is a data output request. If there is, server 100 outputs 1066 related data by referring to the database.

If there is no data output request at step 1064, server 100 checks 1068 whether there is a delivery completion report, and when a delivery completion report is received, server 100 pays 1070 the selling money and sales contract money of related sellers through a settlement account of a seller by referring to the PDDB. FIG. 14 is a flow chart to illustrate the operation of terminal 130 or 140 of a bi-directional auctioning apparatus of the present invention, and FIG. 15 through FIG. 24 show screen state drawings.

Referring to Figures 14 and 15, in terminals 130 and 140, if a user clicks a bi-directional auction icon on a window start screen, a bi-directional auction program is executed. For example, a user can gain access to a bi- directional auction site through the internet via a web browser. At step 1102, if access is gained to a bidirectional auction site, a server 100 and terminals 130 and 140 are interconnected through the internet 120. The server 100 provides a bi-directional auction homepage of FIG. 15 and displays a homepage screen on the terminal by the request of the terminal.

On the homepage screen of FIG. 15, there is a main menu including: home, member admission, selling registration, purchase offer, selling registration list, registered goods list, and purchase decision list. On the left of the screen is a goods retrieval tool. The goods retrieval tool can perform retrieval using goods classifications or through character and number input such as goods name, goods registration number, selling registration number, purchase checking number, and selling price. The center of the screen displays information indicating the large classification name for goods retrieval and the number of selling registration instances of each large classification. The displayed large classification name is only one example, and various large classifications and names thereof can be selected in designing the screen.

If the user clicks 1106 member admission menu item on the homepage screen, a member admission screen of FIG. 16 is displayed 1108. If the user clicks buyer member on the member admission screen of FIG. 16, a buyer member input window is displayed as shown. If the user clicks seller member, a seller member input window, similar to the buyer member input window, is displayed. If the user inputs member information in the input fields of FIG. 16 and clicks the member admission button on the screen, the inputted member information is sent to the server 100 and registered in the BMDB or SMDB of database 110.

Referring again to Figure 15, if member admission is not selected at step 1106, the server 100 checks 1112 whether there is a goods retrieval command. A goods retrieval command is inputted by clicking one category among the large classification of goods displayed on the screen or using the retrieval tool on the left of the screen. If the user clicks "1. furniture/commodities" among the large classification in FIG. 15, a small and medium classification screen of FIG. 17 is displayed. If the user selects "lighting apparatus" on the small and medium classification screen of FIG. 17, a registered goods list screen of FIG. 18 is displayed 1114.

On Fig. 17, if the user clicks 1116 on a desired good, for example "inverter desk lamp", on the screen displayed at step 1114, a selling registration list screen of an inverter desk lamp of FIG. 19 is displayed 1118.

If the user clicks "graph view" on the screen of FIG. 19, one can see graphs of FIG. 25 through FIG. 27. For example, one can see a sales quantity for each selling price and accumulated sales quantity graph of FIG. 25, a fluctuation graph of decided selling price as a function of purchase decision date and time of FIG. 26, and a fluctuation graph of decided accumulated sales quantity (transaction amount) as to purchase decision data and time of FIG. 27. A seller or a buyer can determine a desired selling price or purchase offer price by referring to the analysis graphs of FIGsM 25-27.

On the screen of FIG. 19, if the user clicks 1120 one of the selling prices, a selection window for selecting either purchase or selling is displayed on the screen. If the user selects selling on the displayed selection window, the selling registration screen of FIG. 20 is displayed 1126. If the user selects purchase on the selection window, the purchase offer screen of FIG. 22 is displayed 1134.

If the user clicks 1124 selling registration menu item on the main screen of FIG. , 15, the selling registration screen of FIG. 20 is displayed. If the user clicks 1132 purchase offer menu item on the main menu of FIG. 15, the purchase offer screen of FIG. 22 is displayed 1126. If the user clicks 1142 selling registration list menu item on the main screen of FIG. 15, the selling registration list screen FIG. 19 of step 1118 is displayed. Of course, because in this case there is no goods selection such as "inverter desk lamp" of FIG. 19, a list related to goods in the sequence of the selling registration number is displayed. If the user clicks 1144 registered goods list menu item on the main screen of FIG. 15, the registered goods list screen of step 1114 is displayed. Again, because there is no category selection, a list in sequence of their registered goods number is displayed.

In the case that a desired good is not registered at step 1114, the user selects "new goods registration" by moving to the selling registration screen of FIG. 20 and clicking the selling registration menu on the screen.

On the selling registration screen of FIG. 20, if the user clicks "new goods registration" on the screen to register new goods_/ all input fields are displayed as blank (without data) . If the user clicks "new purchase price registration" , the names of recorded goods and model are displayed in their appropriate fields.

If the user clicks "registration selling price participation", the names of recorded goods, the model and the selling price are displayed in the appropriate input fields. Thus, a seller inputs 1128 selling registration information using a desired input field. If the user inputs sales quantity, the total amount of purchase money and the purchase contract money are calculated automatically and displayed in the corresponding input field.

Inputted selling registration information is transmitted to server 100 through the internet 120, and the transmitted selling registration information is registered in various related databases. Then, a selling registration check screen of FIG. 21 is displayed 1130. The user checks the accuracy of the selling registration number and registered content and, if they are accurate, then clicks a confirmation button. The selling registration procedure is then completed.

At step 1126, information related to selling price selected by a buyer is displayed within the input fields on the purchase offer screen of FIG. 22. Such information may include the name of goods and model, selling price, lower- price-accumulated sales quantity, total amount of purchase money, and purchase contract money. A purchase offerer inputs 1128 only the content of seller ID, credit card number, term of card validity and name on card. After inputting, if the user clicks a bi-directional auction purchase offer button on the bottom of the screen, the purchase offer confirmation screen of FIG. 23 is displayed 1138. Inputted purchase offer information is sent to a server 100 through the internet 120, and the server 100 processes the inputted purchase offer information and registers the processed offer information in a related database. The server 100 then processes the receipt of purchase contract money from the credit card settlement account of a buyer. If the purchase contract money is received and the purchase is determined, a purchase decision result such as "Congratulations. Purchase of Mr. ID is decided." of FIG. 23 is displayed.

If the user clicks the "next' button on the screen after the purchase decision result is displayed, a seller ID list of FIG. 24 is displayed 1140. Contents of names of all sellers related to the selling price selected by a buyer and the lower selling prices, sales quantity, address, and emergency contact are listed on the seller ID list. A buyer prints and outputs a seller ID list and is delivered goods from each seller. The buyer then delivers a signed check to a bi-directional auction operator. The operator pays the sales money and sales contract money, minus commission, to each seller.

One example mentioned is the case where only a buyer who can accommodate the whole quantity of lower-price- accumulated sales quantity can make an offer to purchase. That is, where a buyer cannot accommodate the entire lower- price-accumulated sales quantity, that buyer cannot compete in purchase offer. This is to secure sales quantity of higher price in order to induce a large quantity of amount of purchase.

Alternatively, it is possible to offer purchases of a portion of the lower-price-accumulated sales quantity. For example, even though the lower-price-accumulated sales quantity is 100 pieces, a buyer can purchase 50 pieces. In this case, the determination of the seller is such that a transaction is consummated by determining the number of corresponding sellers capable of buying according to the selling registration ranking among the total sellers related to the selected selling price and lower selling prices. The other sellers outside the ranking are maintained as they are. This method induces competition for the selling registration of buyers . In the example, a credit card settlement method is described, but settlement methods such as an electronic bank transfer or electronic money such as cyber money or e-money are possible. Also, the above-described example illustrates the display of the closing % of the day to help to establish a purchase strategy. It is also possible to show the change in the rate of selling registrations per hour, the sales quantity corresponding to each selling price, and the lower- price-accumulated sales quantity in the form of various graphs. Moreover, it is preferable to show analysis data or an analysis graph for analyzing the selling registration situation of a seller to determine purchase strategy.

As described hereinabove, with the present invention, a number of sellers in small quantity can register their selling price and sales quantity through the internet. Information such as various selling prices, sales quantity according to each selling price, lower-price-accumulated sales quantity, and the total amount of purchase money as to the same goods is then provided to a number of buyers.

Therefore, the present invention simultaneously achieves mass sales and the reduction of selling price due to mass sales by making buyers of large quantities of goods make purchase offers competitively according to their own purchase strategy. Also, sellers in groups and buyers in groups participate in purchasing and selling competitively. Therefore, it is possible to embody a complete free market competition principle on the internet by determining selling price synergistically, through mutual competition.

The present invention can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. The present invention can also be embodied in the form of computer program code containing instructions embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other computer-readable storage medium,^' wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. The present invention can also be embodied in the form of computer program code, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. When implemented on a general-purpose microprocessor, the computer program code segments configure the microprocessor to create specific logic circuits.

While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims .

What is claimed is

Claims

1. A method for bi-directionally auctioning using a computer network, the method including: accepting as input a plurality of selling prices for a goods model and each selling quantity for the plurality of selling prices; displaying each lower-price-accumulated selling quantity for the plurality of selling prices, the lower- price-accumulated selling quantity being obtained by summing the selling quantities at and below the purchase price; accepting as input a selection of at least one buyer, the selection being one of the lower-price-accumulated selling quantities > acceptable by a buyer in total selling price ; and confirming a transaction between a buyer and all sellers who are related to the selected lower-price- accumulated selling quantity.

2. A method for bi-directionally auctioning using a computer network the method comprising: accepting a goods model, a selling price, a selling quantity, and a selling contract deposit as input into a computer; displaying on the computer a plurality of selling prices, a selling quantity for each selling price, and a lower-price accumulated selling quantity for each selling price, the lower-price-accumulated selling quantity being obtained by summing the selling quantities at and lower each selling price; authorizing the purchase of one of the lower-price- accumulated selling quantities to a buyer who first selects the selling price corresponding to the one lower-price- accumulated selling quantity; and confirming a transaction between the authorized buyer and all sellers who input a selling price at and lower the selected selling price.

3. The method of claim 2, wherein said accepting includes : accepting selling term information as input into the computer.

4. The method of claim 2, wherein said displaying includes: displaying a total amount for each selling price, the total amount being obtained by multiplying the selling price and the lower-price-accumulated selling quantity.

5. The method of claim 2, wherein said displaying further includes: displaying the fluctuation of lower-price accumulated selling quantity.

6. The method of claim 2, wherein said displaying further includes: displaying selling price from higher to lower price.

7. The method of claim 2, wherein said authorizing includes : determining the order in which selling contract money is deposited.

8. The method of claim 7, wherein the selling contract money is a portion of the total amount, the total amount being obtained by multiplying the selected selling price and the lower-price-accumulated selling quantity.

9. An apparatus for bi-directionally auctioning using a computer network the apparatus comprising: a storing means arranged to store a bi-directional auction program; a processor configured to execute the bi-directional auction program, said bi-directional auction program directing said processor to: accepting a goods model, a selling price, a selling quantity, and a selling contract deposit as input into a computer; displaying on the computer a plurality of selling prices, a selling quantity for each selling price, and a lower-price-accumulated selling quantity for each selling price, the lower-price-accumulated selling quantity being obtained by summing the selling quantities at and lower each selling price; authorizing the purchase of one of the lower- price-accumulated selling quantities to a buyer who first selects the selling price corresponding to the one lower-price-accumulated selling quantity; and confirming a transaction between the authorized buyer and all sellers who input a selling price at and lower the selected selling price.

10. The apparatus of claim 9, wherein said storing means includes a member database, a selling registration • database, a selling registration display database, a purchase offer database, a purchase decision database and a registered goods database.

11. A method for bi-directionally auctioning using a f computer network that the method comprising: accepting a goods model, a selling price, a selling quantity, and a selling contract deposit amount as input into a computer; displaying on the computer a plurality of selling prices, a selling quantity for each selling price, and a lower-price-accumulated selling quantity for each selling price, the lower-price-accumulated selling quantity being obtained by summing selling quantities at and lower each selling price; authorizing the purchase of a portion of the lower- price-accumulated selling quantity to a buyer who first selects the selling price corresponding to the portion of the lower-price-accumulated selling quantity; and confirming a transaction between the authorized buyer and sellers who are related to the portion of the selected lower-price-accumulated selling quantity.

12. The method of claim 11, wherein said authorizing includes : the sellers is determined by the sequence of selling registration numbers among all sellers who are related to the selected lower-price-accumulated selling quantity.

13. The method of claim 11, wherein said displaying includes : displaying selling term information, and total amount information, the total amount information being obtained by multiplying the selling price with the lower-price- accumulated selling quantity.

14. The method of claim 11, wherein said displaying data includes: displaying the selling prices from higher to lower price.

15. The method of claim 11, wherein said authorizing includes : determining the sequence that selling contract money is deposited.

16. A method for transacting with goods G using a computer network, comprising the steps of: receiving a selling offer information including a selling price P and a selling quantity A for said goods G; adding said received selling quantity A to a selling quantity Qj of the same selling price (Pj: 1 <j ≤n, Pj is lower than P(j+1)) as said received selling price P among a plurality of selling prices PI ~ Pn as to said goods G; updating each lower-price-accumulated selling quantity (AQn = ∑Qj ) of said plurality of selling prices in response to said received selling quantity A; providing a selling offer registration information including lower-price-accumulated selling quantities AQl, AQ2, . . . and AQn as to a plurality of selling prices Pi, P2, . . . and Pn of said goods G to at least one buyer; and receiving each selection of the at least one buyer, the selection being one of the lower-price-accumulated selling quantities acceptable by each buyer in total selling price ; and confirming a transaction between a buyer and all sellers, the buyer being one of the at least one buyer, the all seller being related to the lower-price-accumulated selling quantity selected by the buyer.

17. The method for transacting goods using a computer network according to claim 16, wherein said selling offer registration information further includes each selling total amount (TA(l)n = ∑Pj x Qj) of said plurality of selling prices.

18. The method for bi-directionally auctioning using a computer network according to claim 17, wherein each transaction price between all sellers and the buyer is decided with selling prices Pi, . . . and Pj of each of seller.

19. The method for transacting goods using a computer network according to claim 16, wherein said selling offer registration information further includes each selling total amount (TA(2)n = Pn x AQn) of said plurality of selling prices.

20. The method for transacting goods using a computer network according to claim 19, wherein a transaction price between all sellers and the buyer is decided with a selling price Pj selected by the buyer.

21. An apparatus for transacting goods G using a computer network, including: a storing means arranged to store a bi-directional auction program; a processor configured to execute the bi-directional auction program, said bi-directional auction program directing said processor to: receiving a selling offer information including a selling price P and a selling quantity A for said goods G; adding said received selling quantity A to a selling quantity Qj of the same selling price (Pj: 1 <j ≤n, Pj is lower than P(j+1)) as said received selling price P among a plurality of selling prices PI ~ Pn as to said goods G; updating each lower-price-accumulated selling quantity (AQn = ∑Qj ) of said plurality of selling prices in response to said received selling quantity A; providing a selling offer registration information including lower-price-accumulated selling quantities AQl, AQ2, . . . and AQn as to a plurality of selling prices PI, P2, . . . and Pn of said goods G to at least one buyer; and receiving each selection of the at least one buyer, the each selection being one of the lower-price- accumulated selling quantities acceptable by each buyer in total selling price; and confirming a transaction between a buyer and all sellers, the buyer being of the at least one buyer, the all seller being related to the lower-price-accumulated selling quantity selected by the buyer.

22. The apparatus for transacting goods using a computer network according to claim 21, wherein said selling offer registration information further includes each selling total amount (TA(l)n = ∑Pj x Qj ) of said plurality of selling prices.

23. The apparatus for transacting goods using a computer network according to claim 22, wherein said selling offer registration information further includes each selling total amount (TA(2)n = Pn x AQn) of said plurality of selling prices.

24. A method for providing selling offer registration information, wherein goods G are dealt through a computer network, comprising the steps of: receiving a selling offer information including a selling price P and a selling quantity a for said goods G; adding said received selling quantity A to a selling quantity Qj of the same selling price (Pj: 1 ≤j ≤n, Pj is lower than P(j+1)) as said received selling price P among a plurality of selling prices Pi ~ Pn as to said goods G; updating each lower-price-accumulated selling quantity (AQn = ∑Qj ) of said plurality of selling prices in response to said received selling quantity A; and providing a selling offer registration information including lower-price-accumulated selling quantities AQl, AQ2, . . . and AQn as to a plurality of selling prices PI, P2, . . . and Pn of said goods G to at least one buyer.

25. The method for providing selling offer registration information according to claim 24, wherein said selling offer registration information further includes each selling total amount (TA(l)n = Jpj x Qj ) of said plurality of selling prices .

26. The method for providing selling offer registration information according to claim 24, wherein said selling offer registration information further includes each selling total amount (TA(2)n = Pn x AQn) of said plurality of selling prices.

27. The method for providing selling offer registration information according to claim 24, wherein a received selling price P is registered as a new selling price Pk and a selling quantity Qk of said goods G in case that there is no selling price Pk equal to the received selling price P among a plurality of selling prices of said goods G.

28. The method for providing selling offer registration information according to claim 25, wherein said selling offer registration information further includes the number of each seller of said plurality of selling prices.

29. A method for providing selling offer registration information, wherein goods G are dealt through a computer network, comprising the steps of: receiving a selling offer information including a selling price P and a selling quantity A for said goods G; adding said received selling quantity A to a selling quantity Qj of the same selling price (Pj: 1 ≤j ≤n, Pj is lower than P(j+1)) as said received selling price P among a plurality of selling prices Pi ~ Pn as to said goods G; updating selling total amount (TA ( 1) = pj x Qj ) of said plurality of selling prices in response to said received selling quantity A; and providing a selling offer registration information including each selling total amount TA(1)1, TA(1)2, . . . and TA(l)n as to a plurality of selling prices PI, P2, . . . and Pn of said goods G to at least one buyer.

30. A method for providing selling offer registration information, wherein goods G are dealt through a computer network, comprising the steps of: receiving a selling offer information including a selling price P and a selling quantity A for said goods G; adding said received selling quantity A to a selling quantity Qj of the same selling price (Pj: 1 ≤j ≤n, Pj is lower than P(j+1)) as said received selling price P among a plurality of selling prices Pi ~ Pn as to said goods G; updating lower-price-accumulated selling quantity (AQn = ∑Qi) and selling total amount (TA (2) n = Pn x AQn) of said plurality of selling prices in response to said received selling quantity A; and providing a selling offer registration information including each selling total amount TA(2)1, TA(2), . . . and TA(2)n as to a plurality of selling prices PI, P2, . . . and Pn of said goods G to at least one buyer.

31. An apparatus for providing selling offer registration information, wherein goods G are dealt through a computer network, including: a storing means arranged to store program for providing a selling offer registration information; a processor configured to execute the program, said program directing said processor to: receiving a selling offer information including a selling price P and a selling quantity A for said goods G; adding said received selling quantity A to a selling quantity Qj of the same selling price (Pj: 1 ≤j ≤n, Pj is lower than P(j+1)) as said received selling price P among a plurality of selling prices PI ~ Pn as to said goods G; updating each lower-price-accumulated selling quantity (AQn = Qj ) and each selling total amount (TA (2) n = Pn x AQn) of said plurality of selling prices in response to said received selling quantity A; and providing a selling offer registration information including each selling total amount TA(2)1, TA(2)2, . . . and TA(2)n as to a plurality of selling prices PI, P2, . . . and Pn of said goods G to at least one buyer.

32. The apparatus for providing selling offer registration information according to claim 31, wherein said selling offer registration information further includes each selling total amount (TA (1) n = ∑Pj x Qj ) of said plurality of selling prices.

33. The apparatus for providing selling offer registration information according to claim 31, wherein said selling offer registration information further includes each selling total amount (TA (2) n = Pn x AQn) of said plurality of selling prices.

34. A storage medium encoded with machine-readable computer program code for bi-directionally auctioning using a computer network, the storage medium including instructions for causing a computer to implement a method comprising: accepting as input a plurality of selling prices for a goods model and each selling quantity for the plurality of selling prices; calculating each lower-price-accumulated selling quantity for the plurality of selling prices, the lower- price-accumulated selling quantity being calculated by summing the selling quantities at and below the purchase price; accepting as input a selection of at least one buyer, the selection being one of the lower-price-accumulated selling quantities acceptable by a buyer in total selling price ; and confirming a transaction between a buyer and all sellers who are related to the selected lower-price- accumulated selling quantity.

35. A storage medium encoded with machine-readable computer program code for bi-directionally auctioning using a computer network, the storage medium including instructions for causing a computer to implement a method comprising: accepting a goods model, a selling price, a selling quantity, and a selling contract deposit as input; displaying a plurality of selling prices, a selling quantity for each selling price, and a lower-price accumulated selling quantity for each selling price, the lower-price-accumulated selling quantity being obtained by summing the selling quantities at and lower each selling price; displaying confirmation of a transaction of one of the lower-price-accumulated selling quantities between a buyer who first selects the selling price corresponding to the one lower-price-accumulated selling quantity and all sellers who input a selling price at and below the selected selling price.

36. The storage medium of claim 35, further comprising instructions for causing a computer to implement: accepting selling term information as input into the computer.

37. The storage medium" of claim 35, further comprising instructions for causing a computer to implement: displaying a total amount for each selling price, the total amount being obtained by multiplying the selling price and the lower-price-accumulated selling quantity.

38. The storage medium of claim 35, further comprising instructions for causing a computer to implement: displaying the fluctuation of lower-price accumulated selling quantity.