JP2002109286A - Bucket auction system, computer readable recording medium recording the same and bucket auction device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To enable a seller to transact a large quantity of articles and to sell a large quantity of articles with time limit, to enable a buyer to purchase an article inexpensively rather than an inverse auction, and to show an index effective for the seller to determine a bidding price to the seller. SOLUTION: This system is provided with a registered article DB 2 for storing and managing the article information of articles for each article ID, purchase application DB 3 for storing and managing articles desired to purchase, a desired amount and a desired price for each buyer ID and for each article ID, purchase-desired quantity totaling means 23 for calculating a total demanded number by totaling the desired quantity corresponding to the desired price for each article ID, bid DB 5 for storing and managing the article of a bid target, the quantity of bids and bidding prices for each article ID, successful bid determining means 24 for determining the seller, successfully bidden quantity and successful bidding price of articles to be successfully bidden for each of the same article ID on the basis of a plurality of bid information, and successful bid DB 6 for storing and managing the successfully bidden quantity and successful bidding price of successfully bidden articles for each seller ID, buyer ID and article ID.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a bucket auction system, a computer-readable recording medium storing the system, and a bucket auction apparatus.

[0002]

2. Description of the Related Art Conventionally, there have been merchandise trading methods such as "auction" and "reverse auction". An auction is a transaction method in which a large number of buyers are gathered, bid for purchase of goods such as movable property and real estate, and a sales contract is concluded with a person who offers the highest price. In auctions, if a product has value, the price of the product rises gradually, so that the seller can sell the product at a higher price, but the buyer can get the product at the highest price. There are many auction systems for providing auction services on computer networks. The reverse auction is a transaction method in which a buyer requests an intermediary to have a plurality of traders make a quote, and purchases a product from a trader who has offered a lower quote. According to a reverse auction, buyers can obtain goods at a lower price than an auction. As a reverse auction system for providing a reverse auction service on a computer network, the invention of US Pat. No. 5,794,207 owned by Priceline.com of the United States is well known.

[0003]

However, the conventional reverse auction system has the following problems (i) to (iii). (i) In the conventional reverse auction system, the target of the bidding transaction is one product, that is, a single product. For this reason, since a seller can only trade with a buyer in a single auction, the seller is unlikely to sell only the product. Therefore, even if the product is purchased in large quantities, there is a danger that most of the products may be in stock, so that it is not possible to proceed with mass purchase of the product without worry, and it is not possible to keep the purchase price low. Therefore, the seller cannot drastically lower the bid price of the product. (ii) In the case of commodities such as foodstuffs, most of the commodities whose expiration date has passed are often disposed of. Also, the value of a product before the announcement of a new product drops significantly after the expiration date. For this reason, products with time limits, such as food products and products before the announcement of new products, have a markedly lower value after the time limit, and sellers are eager to sell inventory by the time limit. In the conventional reverse auction system, since the target of the bidding transaction is a single product, it is not possible to sell a large amount of products with a term. (iii) Sellers are always looking for the right price for the item. If the bid price is set high, it will not be possible to make a successful bid, and if it is set low, the profit will be reduced. The conventional reverse auction system did not have a function for indicating a valid index to a seller in order for the seller to determine a bid price. In particular, when dealing with a large number of identical products in a single bid transaction, without such a function, sellers cannot bid with confidence.

[0004] In view of such circumstances, the present invention enables a seller to conduct a large-scale transaction of goods, sells a large amount of time-limited goods, and allows a buyer to purchase goods at a lower price than in a reverse auction. Can provide sellers with effective indicators for determining bid prices and disclose bid and winning information for each product to both sellers and buyers, which can be used in future bidding and purchasing strategies An object of the present invention is to provide an auction system, a computer-readable recording medium storing the auction system, and a bucket auction apparatus.

[0005]

According to a first aspect of the present invention, there is provided a bucket auction system operable with a communication terminal capable of communicating with a buyer communication terminal and a seller communication terminal via a communication network. A registered product database that stores and manages product information for each product ID in response to a product information registration request transmitted from the seller communication terminal, and a purchase request information registration request transmitted from the buyer communication terminal; A purchase request database for storing and managing a desired product, a desired quantity, and a desired price for each buyer ID, each product ID, and each desired purchase ID, and a request for registration of bid information transmitted from the seller communication terminal. In response to the,
A bid database that stores and manages a bid target product, a bid quantity, and a bid price for each product ID and each bid ID, and based on a plurality of pieces of bid information stored in the bid database, a bid is made for each same product ID. A successful bid determination means for determining a seller, a successful bid quantity, and a successful bid price of a product to be sold; a successful bid database storing and managing the successful bid quantity and the successful bid price of the product sold by the successful bid means for each bid ID and each successful bid ID; It is characterized by comprising a successful bid information notifying means for notifying the buyer communication terminal and the seller communication terminal of the successful bid information. According to a second aspect of the present invention, there is provided the bucket auction system according to the first aspect, wherein a desired quantity for the desired price stored in the desired purchase database is totalized for each product ID to calculate a total number of demands. And a demand summary graph indicating the cumulative total demand for the desired price for each product ID, and the demand summary graph is disclosed to a seller communication terminal via a communication network. According to a third aspect of the present invention, in the invention according to the first or second aspect, the successful bid determination means makes a bid for the product when the bid quantity of the product to be bid is less than the total demand of the product. Determine the seller, the winning quantity and the winning bid, and assign the remaining quantity obtained by subtracting the bidding quantity from the total demand to other sellers, and determine the seller, the winning quantity, and the winning bid for the remaining quantity of the product. It is characterized by. According to a fourth aspect of the present invention, there is provided the bucket auction system according to the first aspect of the present invention, wherein bid / successful bidding information for disclosing bidding / successful result information of a merchandise to a buyer communication terminal and a seller communication terminal for each merchandise ID after the bidding of the merchandise. It is characterized by comprising a disclosure means. According to a fifth aspect of the present invention, there is provided a computer-readable recording medium storing the bucket auction system according to the first, second, third, or fourth aspect. According to a sixth aspect of the present invention, there is provided a bucket auction apparatus comprising the computer-readable recording medium according to the fifth aspect.

According to the first aspect of the present invention, the following (1) to (1)
The operation and effect (2) are achieved. (1) The desired purchase database stores not only the desired product and the desired price from the buyer but also the desired quantity for each product ID. Also, the bidding database contains
For each product ID, not only the product to be bid and the bid price but also the bid quantity are stored. For this reason, it is possible to inquire not only the desired price and the bid price, but also the desired quantity and the bid quantity of the bid target product from the purchase desire database and the bid database. That is, since the target of the bidding transaction can be not a single product but a desired purchase set in which a plurality of the same products are collected, an auction can be performed on the desired purchase set.
For this reason, it is possible for a seller participating via a communication network to receive a large number of orders for the same product in a single bid transaction. Therefore, the seller can purchase in large quantities with confidence, and can lower the purchase price per product. Therefore, the price offered to the buyer can be reduced as compared with a single item transaction such as a reverse auction in which the bid transaction is a single item, and the buyer can purchase the item at a lower price than the reverse auction. (2) Even a limited time product can receive a large quantity of products of the same standard in a single bid transaction, so that inventory items such as a limited time product can be efficiently sold. In addition, products with a term can be sold in large quantities, contributing to effective use of resources. According to the second aspect of the present invention, not only the desired product but also the desired quantity of the product is stored and managed in the desired purchase database for each buyer ID and each product ID. Thus, the desired purchase quantity can be totaled for each product ID to calculate the total demand. Since the seller can see the total demand for the desired price in the demand summary graph, the seller can supply the total demand for the product to be bid by referring to the total demand for the bid price desired by the seller. It is possible to determine the bidding price, determine the bidding price, and place a bid. According to the third aspect of the present invention, the seller can freely set the bid price without worrying about whether or not the total number of demands for the product to be bid can be supplied by himself / herself. If the seller wants to dispose of the stock as soon as possible, setting a lower bid price can efficiently sell the stock.
Further, even if the number of supplies that can be supplied by the seller is less than the total demand for the bid price desired by the seller, the seller can bid at the desired bid price. In other words, the seller can bid by specifying a part (arbitrary quantity) of the total demand for the desired bid price. Sharing can be supplied. That is, the demand of the buyer group for a specific product can be supplied from the seller group. Claim 4
According to the invention, the bidding / successful bid information disclosure means enables the buyer and the seller to view the bidding / successful bidding result information of the merchandise for each merchandise ID. Thereby, when registering and bidding on a desired product for purchase in the future, it is possible to strategically trade from each standpoint. According to the invention of claim 5, the bucket auction system can be operated by a computer. According to the invention of claim 6, the bucket auction system can be operated.

[0007]

Next, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a network diagram of the bucket auction apparatus 1 of the present embodiment. In the figure,
The symbol N indicates a communication network such as the Internet. Through this communication network N, many buyer-side communication terminals 2 and many seller-side communication terminals 3 are connected to the bucket auction apparatus 1 so as to be able to communicate with each other. Each of the communication terminals of the buyer-side terminal 2 and the seller-side terminal 3 may be a computer or a mobile phone.

A computer-readable recording medium such as a hard disk, a DVD disk, and a CD-ROM of the bucket auction apparatus 1 includes a bucket auction system 1
0 is recorded and installed operably on the bucket auction apparatus 1. A computer-readable recording medium on which the bucket auction system 10 is recorded is also an embodiment of the present invention, similarly to the bucket auction apparatus 1. The operating system for operating the bucket auction system 10 is LINUX or UNIX.
(Registered trademark), windowsNT / 2000/98, etc. The programming languages that describe the bucket auction system 10 are HTML, XML, Perl, C, and HDM.
There is no particular limitation on L, MML, JAVA (registered trademark) and the like.

Now, a bucket auction system 10 that is particularly important in the present invention will be described. FIG. 2 is a system configuration diagram of the bucket auction system 10. As shown in FIG. 1, the bucket auction system 10 includes a seller DB1, a registered product DB2, and a purchase request as databases.
It has DB3, buyer DB4, bid DB5 and DB6,
It also has a program and a web page 40 described later.

[0010] The seller DB1, the registered goods DB2, the purchase request
Since DB3, buyer DB4, bid DB5 and successful bid DB6 are all databases, it goes without saying that each database is provided with data access means such as data addition, deletion, reference and correction.

However, important data access means among these data access means are denoted by reference numerals for explanation. That is, seller DB1, registered product DB2, purchase desire DB
3. Each of the data adding means of the buyer DB4 and the tender DB5 is set as a program, and the seller information registering means 11,
This is indicated by a product information registration unit 12, a purchase desire information registration unit 13, a buyer information storage unit 14, and a bid information registration unit 15.

Now, the details of the databases DB1 to DB6 will be described. The seller DB1 is a database that stores and manages seller information for each seller ID. As the seller information, a login ID, a password, a seller name, an address, and the like may be stored.

The registered product DB2 is a database for storing and managing registered product information for each product ID. As the registered product information, a product classification number, a product number, and a product name may be stored.

The buyer DB4 is a database for storing and managing buyer information for each buyer ID. As the buyer information, a buyer name, an address, a credit card number, and the like may be stored.

[0015] The purchase request DB3 includes a buyer ID for each product ID.
This is a database that stores and manages purchase desire information for each purchase desire ID. As the purchase desire information, a desired number, a desired price, and the like may be stored. A relationship is established between the product ID of the purchase desire DB3 and the product ID of the registered product DB2. In addition, a relationship is established between the buyer ID of the buyer DB3 and the buyer ID of the buyer DB4. For this reason, it is possible to inquire about the product information of the registered product DB2 and the buyer information of the buyer DB4 from the purchase wish ID of the purchase wish DB3.

The bid DB 5 is a database that stores and manages bid information for each product ID and each bid ID. As the bid information, the bid quantity and the bid price may be stored. Product ID of bid DB5 and product ID of the registered product DB2
There is a relation between and. For this reason,
Since the product ID of the registered product DB2 can be queried from the bid ID of the bid DB5, the product information of the registered product DB2 and the seller information of the seller DB1 can be queried. Therefore, when the bid ID of the bid DB 5 is specified, the product information, bid information, desired product information, seller information, and buyer information can be specified for the registered product.

The successful bid DB 6 is a database for storing and managing successful bid information for each bid ID and each successful bid ID. As the successful bid information, the successful bid quantity and the successful bid price may be stored. The bid ID of this successful bid DB6 and the bid ID of the aforementioned bid DB5
There is a relation between and. For this reason,
The bid information of bid DB5 can be queried from the successful bid ID of successful bid DB6. Therefore, when the successful bid ID in the successful bid DB 6 is specified, the product information, bid information, desired product information, seller information, and buyer information can be specified for the registered product.

Next, the program will be described. The bucket auction system 10 includes, as programs, a desired purchase deadline notification means 21, a desired bid cutoff means 22, a desired purchase quantity totaling means 23, and a successful bid determination means 24.
At a preset time, the purchase request cut-off notifying means 21 notifies the buyer terminal 2 of the desired purchase request cut-off, prohibits update access to the purchase request DB 3, and notifies the seller terminal 3. This is a program that notifies the start of bidding.

The bid cutoff means 22 is a program for notifying the seller terminal 3 of the bid cutoff at a preset time, and prohibiting update access to the bid DB 5.

The desired purchase quantity totaling means 23 includes a desired purchase DB
This is a program that calculates the total number of demands for the desired purchase price by summing up the desired purchase quantity for the desired purchase price of the product for each product ID for all the desired purchase information.

The successful bid determination means 24 is a program for determining a seller, a successful bid quantity, and a successful bid price of a successful bid product for each same product ID for all pieces of bid information in the bid DB 5.

The bucket auction system 10 includes web pages W1 to W9 shown in FIGS. These web pages W1 to W9 are transmitted to the buyer terminal 2 via a communication network N such as the Internet.
And it is open to the seller terminal 3.

For this reason, if the buyer-side terminal 2 and the seller-side terminal 3 only have a web browser, the buyer-side terminal 2 and the seller-side terminal 3 can be used without any special software.
Can participate in bucket auctions. Therefore, both the buyer and the seller can easily construct an access environment for connecting to the bucket auction system 10.

Next, the operation and effect of the bucket auction apparatus 1 of the present embodiment will be described. FIG. 3 is an event trace diagram of the bucket auction apparatus 1 of the present embodiment. As shown in the figure, when a seller information registration request is transmitted from the seller side terminal 3 to the bucket auction apparatus 1, the bucket auction system 10 causes the seller registration unit 11
To the seller DB1, the seller's seller name and login I
Stores seller information such as D and password. seller
Since only the registered seller terminal 3 is stored in the DB1, the login other than the registered seller among the login requests to the bucket auction apparatus 1 can be excluded by ordinary authentication means, and the registered auction terminal 1 can be excluded. Only the seller's login can be authenticated.

FIG. 4 shows a product registration web page W1.
As shown in FIGS. 3 and 4, the user accesses the bucket auction apparatus 1 from the seller terminal 3, and when the login is authenticated, the merchandise registration web page W1 is displayed on the seller terminal 3.
Is displayed. Therefore, by referring to the product information of the registered product DB2, the seller enters the product information input field of the product registration web page W1 into the product information input field of the product registration web page W1 while taking care not to register the same product repeatedly. Enter product information. Reference to the product information in the registered product DB2 is performed for each product classification by clicking the product classification field on the product registration web page W1. Then, the user clicks the OK button to transmit a product information registration request to the bucket auction apparatus 1.

In the bucket auction apparatus 1, product information is stored in the registered product DB2 by the product information registration means 12 in response to a product information registration request from the seller side terminal 3. All the merchandise information transmitted from the many seller terminals 3 to the bucket auction apparatus 1 is stored in the registered merchandise DB2 by the merchandise information registration means 12.

Next, when the buyer-side terminal 2 accesses the bucket auction apparatus 1 and transmits a purchase-desired-goods registration request, the buyer-side terminal 2 displays a purchase-desired registration web page W2 of FIG. Therefore, the buyer refers to the registered product DB2 and selects the product number of the product desired to be purchased.
Enter desired purchase information such as product name, desired purchase quantity, and desired purchase price. In FIG. 5, seven purchase desired products are registered. The registered product DB2 is referred to on the purchase request registration web page W2 on the product No. Clicking on the product number by clicking on the field The registered product information can be referred to every time. When input is completed,
The user clicks the K button to transmit a purchase request registration request to the bucket auction apparatus 1.

In the bucket auction apparatus 1, the purchase request information is stored in the purchase request DB3 by the purchase request registration means 13 in response to the purchase request registration request from the buyer terminal 2. All the purchase request information transmitted from the many buyer terminals 2 to the bucket auction apparatus 1 is stored in the purchase request DB 3 by the purchase request registration means 13.

Thereafter, at a preset time,
The purchase request cutoff notification means 21 notifies the buyer terminal 2 of the purchase request cutoff, prohibits update access to the purchase request DB3, and notifies the seller terminal 3 of the start of bidding.

Then, a bid start notification web page W3 of FIG. 6 is displayed on the seller terminal 3. Therefore, a desired number or classification name is input in the input field for the product classification number or classification name. Then, click the OK button. Then, the seller-side terminal 3 displays the bidable product display web page W4. On the bidable product display web page W4, bidable products are displayed together with their product information. Therefore, a product to be bid is specified and clicked, and a bid product search request is transmitted to the bucket auction apparatus 1.

In the bucket auction apparatus 1, in response to a bid product search request from the seller terminal 3, the desired purchase quantity totaling means 23 uses the desired product classification number in the desired purchase DB 3 for the product data of each product ID. The desired quantity for the desired price of the product is totaled.

Next, the merchandise demand totaling display web page W5 of FIG. 7 is displayed on the seller terminal 3. On the product-specific demand summary display web page W5, a demand summary graph indicating the total demand for the desired price for each product is displayed. For this reason, it is possible to present the seller with information on how much the bid should be made and how much the total demand will be. Therefore, the seller terminal 3 can determine the bid price with confidence.

Since the demand summary graph is a graph showing the relationship between the desired purchase price and the number of orders to be ordered, the seller looks at the demand summary graph for each product published on the web page W5, so that the product can be classified by product. The total number of demands for the desired purchase price can be ascertained, and reliable bidding transactions can be performed. For example, if you bid for 2500 yen for a product and make a bid, the demand summary graph shows that the planned order quantity is 150 pieces.
You only need to prepare about 0 products. Also, when the stock quantity of a certain product is 100 pieces, the demand summarizing graph shows that the desired purchase price is 2600 yen, so that the bid price can be determined with reference to this.

There are two types of bidding methods, a normal bidding and a lot sharing bidding. The bidding method based on the normal bidding will be described. When bidding a product, when a bid price is entered, the total number of accumulated demands corresponding to the same desired price as the bid price is displayed. This cumulative demand total is the bid price and the corresponding bid quantity. If the bid price and the bid quantity are acceptable, the user clicks the OK button and transmits a bid request to the bucket auction apparatus 1.

A bidding method based on the latter lot sharing bidding will be described. As a result of the seller looking at the demand summary graph,
If the total number of demands for a certain product is extremely large, a lot sharing bid can be selected and a bid can be made with a quantity smaller than the total number of demands for the desired purchase price. To enter a lot-sharing bidding, first enter a bidding price in the same manner as in a normal bidding, and the accumulated total demand corresponding to the same desired price as the bidding price is displayed. Then
Enter the quantity to be bid, that is, the bid quantity. This allows multiple sellers to bid for a product at the same price,
A plurality of sellers will share and deliver the planned number of products.

In the bucket auction apparatus 1, the bid information is stored in the bid DB 5 by the bid registration means 15 in response to a bid request from the seller terminal 3. All bid information transmitted from a large number of seller-side terminals 3 to the bucket auction apparatus 1 is stored in a bid DB by the bid registration unit 15.
It is stored in 5.

Thereafter, at a preset time,
The bid cutoff means 22 notifies the seller terminal 3 of the bid cutoff and prohibits update access to the bid DB5.

In the bucket auction apparatus 1, all the data of the bidding DB 5 is
The bid ID with the lowest bid price is retrieved and stored in the successful bid DB 6 as successful bid information. Then, the successful bidder result display web page W6 of FIG. 8 is displayed on the seller terminal 3. In this successful bid result disclosure web page W6, for each product ID,
The product No., product name, successful bid quantity and successful bid price are displayed. Further, the buyer-side terminal 2 displays a purchase desired product delivery decision web page W7 in FIG. The purchase desired product delivery decision web page W7 includes a product No. for each product ID. , Product name, desired price, successful bid quantity and successful bid price are displayed.

Finally, the bidding / successful bid information disclosure web page W8 of FIG. 10 is displayed on both the buyer side terminal 2 and the seller side terminal 3. The bidding / successful bid information disclosure web page W8 includes, for each product, a bid price, a successful bid quantity, a determined number of deliveries, a graph of a bid price-the number of bidders, a desired purchase price (bid) -a demand number graph, etc. Is displayed. The bidding / successful bid information disclosure web page W8 corresponds to the bidding / successful bid information disclosure means described in claim 4.

[0040] After a successful bid for the goods to the buyer and the seller,
By disclosing the bid information and the successful bid information of the product, it is possible to refer to the registration and bidding of the product desired to be purchased in the future, thereby enabling a more mature transaction.

As described above, according to the bucket auction system 10 of the present embodiment, the following effects can be obtained.
First, the purchase desire database DB3 stores not only the goods desired by the buyer and the desired price but also the desired quantity for each product ID. The bid database DB5 stores, for each product ID, not only the product to be bid and the bid price but also the bid quantity. For this reason, it is possible to inquire not only the desired price and the bid price but also the desired quantity and the bid quantity of the bid target product from the purchase request database DB3 and the bid database DB5. That is, since the target of the bidding transaction can be not a single product but a desired purchase set in which a plurality of the same products are collected, an auction can be performed on the desired purchase set. For this reason, it is possible for a seller participating through the communication network N to receive a large number of orders for the same product in a single bid transaction. Therefore, the seller can purchase in large quantities with confidence, and can lower the purchase price per product. Therefore, the price offered to the buyer can be reduced as compared with a single item transaction such as a reverse auction in which the bid transaction is a single item, and the buyer can purchase the item at a lower price than the reverse auction.

Further, even for a product with a time limit, it is possible to receive a large number of products of the same standard in a single bid transaction, so that inventory items such as a product with a time limit can be efficiently sold. In addition, products with a term can be sold in large quantities, contributing to effective use of resources.

Second, in the purchase desire database DB3, not only the purchase desired goods for each buyer ID and each product ID, but also
Since the desired purchase quantity of the product is stored and managed, the desired purchase quantity can be totaled for each product ID by the desired purchase quantity totaling means to calculate the total demand. Then, since the seller can see the total number of demands for the desired price in the demand aggregation graph, the seller can supply the total number of demands for the product to be bid by referring to the total number of demands for the bid price desired by the seller. It is possible to determine the bidding price, determine the bidding price, and place a bid.

Third, the seller can freely set the bid price without worrying about whether or not he or she can supply the total demand for the product to be bid. If the seller wants to dispose of the stock as soon as possible, setting a lower bid price can efficiently sell the stock.
Further, even if the number of supplies that can be supplied by the seller is less than the total demand for the seller's desired bid price, the seller can bid at the seller's desired bid price. In other words, a seller can bid by specifying a part (arbitrary quantity) of the total demand for a desired bid price. Sharing can be supplied. That is, the demand of the buyer group for a specific product can be supplied from the seller group.

Fourth, the buyer and the seller have the product ID
Each time you can see the bidding and bidding result information of the product, you can use this bidding and bidding result information effectively to strategically deal with future registrations and bidding for products you want to purchase. Becomes possible.

Therefore, the bucket auction apparatus 1 and the bucket auction system 10 of the present embodiment
According to, sellers can trade large quantities of goods, buyers can buy goods cheaper than in reverse auctions, can trade large quantities of time-limited goods, and sellers can provide useful indicators for determining bid prices. This has the effect of being able to be shown.

As shown in FIG. 11, a purchase rejection notice may be given after a delivery seller is determined for each product. In this case, the purchase desired product bidding result web page W in FIG.
9 may be displayed on the buyer-side terminal 2.

[0048]

According to the first aspect of the present invention, the following (1)
And (2). (1) It is possible for a seller who participates via a communication network to receive a large number of orders for the same product in a single bid transaction. Therefore, the seller can purchase in large quantities with confidence, and can lower the purchase price per product. Therefore, the price offered to the buyer can be reduced as compared with a conventional single item transaction such as a reverse auction where the target of the bidding transaction is one product. (2) Even if a product has a time limit, if a bucket auction is used, it is possible to receive a large number of products of the same standard in a single bid transaction, so that it is possible to efficiently sell inventory items such as a product with a time limit. . In addition, if a bucket auction is used, products with a term can be sold in large quantities, which contributes to effective use of resources. According to the invention of claim 2, since the seller can see the demand summary graph, the seller himself supplies the total demand of the product to be bid by referring to the total demand for the bid price desired by the seller. It is possible to determine whether it can be done, determine a bid price, and place a bid. According to the third aspect of the present invention, the seller can freely set the bid price without worrying about whether or not he or she can supply the total demand of the product to be bid.
If the seller wants to dispose of the stock as soon as possible, setting a lower bid price can efficiently sell the stock. Further, even if the number of supplies that can be supplied by the seller is less than the total demand for the seller's desired bid price, the seller can bid at the seller's desired bid price. In other words, a seller can bid by specifying a part (arbitrary quantity) of the total demand for a desired bid price. Sharing can be supplied. That is, the demand of the buyer group for a specific product can be supplied from the seller group. According to the invention of claim 4, the bid / successful bid information disclosure means allows the buyer and the seller to view the bid / successful bid result information of the product for each product ID, so that the bid / successful bid result information can be effectively used. By using the service, it becomes possible to perform a strategic transaction from each standpoint when registering and bidding for a desired product. According to the invention of claim 5, the bucket auction system can be operated by a computer. According to the invention of claim 6, the bucket auction system can be operated.

[Brief description of the drawings]

FIG. 1 is a network diagram of a bucket auction apparatus 1 of the present embodiment.

FIG. 2 is a system configuration diagram of a bucket auction system 10.

FIG. 3 is an event trace diagram of the bucket auction apparatus 1 of the embodiment.

FIG. 4 is a product registration web page W1.

FIG. 5 is a purchase request registration web page W2.

FIG. 6 shows a bid start notification web page W3 and a bidable product display web page W4.

FIG. 7 is a product-specific demand aggregation display web page W5.

FIG. 8 shows a successful bid result display web page W6.

FIG. 9 is a purchase desired product delivery decision web page W7.

FIG. 10 is a bidding / successful bid information disclosure web page W8.

FIG. 11 is an event trace diagram of another embodiment.

FIG. 12 is a purchase desired product bidding result web page W9.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Bucket auction apparatus 2 Buyer's terminal 3 Seller's terminal 10 Bucket auction system DB1 Seller DB DB2 Registered goods DB DB3 Purchase request DB DB4 Buyer DB DB5 Bid DB DB6 Successful bid DB

Claims (6)

[Claims] 1. A system operable with a communication terminal capable of communicating with a buyer communication terminal and a seller communication terminal via a communication network, wherein registration of product information transmitted from the seller communication terminal is performed. A registered product database that stores and manages product information of the product for each product ID in response to a request, and a buyer ID, a product ID, and a purchase in response to a registration request for purchase desire information transmitted from the buyer communication terminal. Desired ID
A purchase request database that stores and manages a desired product, a desired quantity, and a desired price for each item, and a product ID in response to a registration request for bid information transmitted from the seller communication terminal.
A bid database that stores and manages a bid target product, a bid quantity and a bid price for each bid ID, and a plurality of bid products stored in the bid database based on a plurality of pieces of bid information. A successful bid determination means for determining a seller, a successful bid quantity and a successful bid price; a successful bid database for storing and managing the successful bid quantity and the successful bid price of the goods sold by the successful bid means for each bid ID and each successful bid ID; A bucket auction system comprising a successful bid information notifying means for notifying successful bid information to a communication terminal and a seller communication terminal. 2. A desired purchase quantity totaling means for totalizing demand quantities for the desired price stored in the purchase desired database for each product ID and calculating a total demand, and a product ID.
2. A bucket according to claim 1, further comprising a demand summary graph indicating the cumulative total demand for the desired price, wherein the demand summary graph is disclosed to a seller communication terminal via a communication network. Auction system. 3. The method according to claim 1, wherein said successful bid determination means determines a seller, a successful bid quantity, and a successful bid price of the product when the bid quantity of the product to be bid is less than the total demand of the product. 3. The bucket auction system according to claim 1, wherein the remaining quantity obtained by subtracting the bid quantity from the total quantity is distributed to other sellers, and the seller, the successful bid quantity, and the successful bid price for the remaining quantity of the goods are determined. . 4. A bid / successful bid information disclosing means for disclosing bid / successful bid result information of a product for each product ID to a buyer communication terminal and a seller communication terminal after a successful bid for the product. 1. The bucket auction system according to 1. 5. A computer-readable recording medium in which the bucket auction system according to claim 1, 2, 3, or 4 is stored. 6. A bucket auction apparatus comprising the computer-readable recording medium according to claim 5.