Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
  • G06Q30/00—Commerce
  • G06Q30/06—Buying, selling or leasing transactions
  • G06Q30/08—Auctions

Definitions

• 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.
• 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.
• a buyer buys the goods from the cheapest shopping mall after surveying prices of the same products in a plurality ' of different shopping malls.
• 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.
• 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.
• 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 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.
• 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.
• a seller can not expect to make a large quantity of transactions because every transaction is consummated with one buyer.
• 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.
• a synergy auction 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.
• the quantity of goods is limited in advance. A buyer cannot present a purchase price, and the purchase price falls in a fixed rate.
• 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 .
• 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.
• 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.
• it is profitable for a buyer who purchases a large amount of goods.
• a buyer can buy at lower price and can accommodate various purchase quantities.
• the sale is consummated between the buyer and those sellers who registered their goods first.
• 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.
• 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
• 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.
• 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
• FIGS. 25 through 27 are graphs for transaction analysis of an apparatus for bi-directionally auctioning using a computer network of the present invention.
• FIG. 1 shows the configuration of a method for bi- directionally auctioning of the present invention.
• 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.
• 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.
• 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 .
• 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.
• any currency e.g., U.S. dollars
• 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.
• 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.
• sellers registered at lower selling prices sell at a selling price higher than the selling price at which they registered.
• 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.
• this method can also benefit a buyer.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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
• 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.
• 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.
• 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.
• 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.
• 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.
• a manager of server 100 can provide electronic money or bonus goods by reserving bonus points according to selling results.
• 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.
• 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.
• the selling quantity for each selling price can be depicted as a bell-shaped curve.
• 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.
• 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.
• 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.
• 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.
• 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.
• server 100 checking for a specific time 1002. For example, 11:59 p.m. may be checked 1002 everyday.
• 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.
• the server 100 checks 1010 whether there is an application for member admission from terminals 130 and 140.
• 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.
• the server 100 checks whether there is selling registration offer from terminals 130 and 140.
• 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.
• the server 100 inputs 1032 selling price, sales quantity, selling term, seller ID, credit card number, term of card validity, and name on card.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• a main menu including: home, member admission, selling registration, purchase offer, selling registration list, registered goods list, and purchase decision list.
• a goods retrieval tool 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.
• 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.
• 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.
• a selling registration list screen of an inverter desk lamp of FIG. 19 is displayed 1118.
• FIG. 25 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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 .
• 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.
• 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.
• 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.
• 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.
• computer program code segments configure the microprocessor to create specific logic circuits.

Priority Applications (2)

Applications Claiming Priority (2)

Publications (1)

Family

ID=19657549

Family Applications (1)

Country Status (4)

Cited By (10)

Families Citing this family (1)

Citations (3)

Family Cites Families (1)

• 2000
  • 2000-03-22 KR KR10-2000-0014572A patent/KR100370432B1/ko not_active IP Right Cessation
  • 2000-08-21 AU AU2000270350A patent/AU2000270350A1/en not_active Abandoned
  • 2000-08-21 GB GB0222026A patent/GB2378291A/en not_active Withdrawn
  • 2000-08-21 WO PCT/IB2000/001350 patent/WO2001071579A1/en active Search and Examination

Patent Citations (3)

Also Published As

Similar Documents

Legal Events