JP2001357250A - Auction system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a system for rational auction through which a bidder and a seller agree with each other on a network. SOLUTION: Computers of the bidder, the seller, and a mediator are connected to the network. The mediation computer is equipped with a sale-side DB10 having information on the objects of sale and a bid-side DB20 having information on bidder's IDs and objects for bidding. The mediation computer is equipped with a sale object matching means 41 which substantially generates a DB30 for each sale object from the bid-side DB20 and sale-side DB10 when the sale object of the sale-side DB10 and a sale object of the bid-side DB10 are in the same genre, a means 42 which limits persons who can bid by matching sale objects on the basis of an arbitrary field of the sale-object classified DB30, and a means 43 which notifies the persons who can bid of the sale objects and a message showing that bidding is allowed.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] The present invention relates to an auction system. More specifically, the present invention relates to an auction system that is accessible from a bid applicant computer connected to a network and includes an implementer computer for conducting an auction, and that performs an auction between a bid applicant and an implementer.

[0002]

2. Description of the Related Art Conventionally, in an auction system on the Internet, various devices have been devised in order to improve a successful bid rate of an auction. However, in the conventional auction system, the price did not rise or the price was too low at the price down site, and in many cases the price did not reach the lowest price desired by the sales applicant. As a result, the product for sale may be unsold, and it is not satisfactory for the person who wants to sell. In addition, even if a successful bid is made, there is also an inconvenience that the transaction desired condition between the sales applicant and the bidder is not sold to a better bidder.

[0003] On the other hand, a bidder often feels that an auction proceeds too much in real time. In particular, when there is a product to be awarded, it is necessary to arrange a bidding system at all times, and it is difficult to make a successful bid for the desired product as a practical problem.

[0004] Because of the inconsistency between the intentions of the sales applicant and the bid applicant, it has been difficult to establish an auction under conditions that satisfy both parties.

[0005]

SUMMARY OF THE INVENTION In view of such a conventional situation, the present invention provides a rational auction between a bid applicant and an implementor or sales applicant on a network that meets both intentions. An object of the present invention is to provide an auction system that can be performed.

[0006]

SUMMARY OF THE INVENTION In order to achieve the above object, a feature of the auction system according to the present invention is to provide a bidder computer which can be accessed from a bid applicant computer connected to a network and conducts an auction. A system for conducting an auction between a bid applicant and an implementer, wherein the implementer computer includes a seller DB that includes information on a sale target that the implementer wants to sell, and an ID of the bid applicant. , And a bidding side DB including contact data and information on a bid requesting object, etc.
Furthermore, when the sales target of the selling DB and the sales target of the bidding DB match or the genre matches, at least some fields are extracted from the bidding DB and the selling DB for each matching sales target. Sales target matching means for substantially creating a sales target DB, and a bidder who limits bidders for each matching sales target based on one or more arbitrary fields of the sales target DB Limiting means, and a bidder notification means for notifying a bid applicant limited as a bidder by the bidder limiting means of the sale target and the possibility of bidding, wherein the bidder is a bidder. Participating in auctions for sale.

Further, the bidder limiter limits the bidders to a plurality of groups, and the auction is performed by a certain set of bidders. If the auction is not established, the remaining remaining bidders are set. The auction may be sequentially performed by a set of bidders.

At this time, the notification by the bidder notification means to the other remaining set of bidders is
Preferably, the auction is performed after the auction by the set of bidders has not been completed.

[0009] If the bidding side DB and the sales target DB have bid history information, the bidder limiter can select and limit bidders using this history.

[0010] The bidding-side DB has bidding-side basic transaction conditions, and the selling-side DB has bidding-side basic transaction conditions. The degree of collation with the basic transaction conditions is evaluated step by step, and the DB for each sales target is used as the degree of transaction collation.
May be added to one or more fields.

[0011] Usually, the practitioner comprises a sales applicant and an intermediary. In this case, the implementer computer is provided with a sales applicant computer and an intermediary computer, and the bid applicant computer and the sales applicant computer can be connected to the intermediary computer via a network.

In configuring the bidder limiter, the sales target DB for each matching sales target is used.
The seller may sort or search interactively via the seller computer on the basis of one or more arbitrary fields described above to limit bidders.

[0013] The bidder limiter performs sorting or searching in accordance with one or more fields of the sales target DB for each of the matching sales targets in accordance with a predetermined priority order. By limiting to the upper-ranked records, it is also possible to limit bidders.

[0014]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, referring to the attached drawings,
The present invention will be described in more detail. Here, a general configuration of the auction system 1 of the present invention will be described first, and then a specific transaction procedure will be described by taking used car sales as an example.

FIG. 1 shows a group of computers connected by a network 2 constituting an auction system 1 according to the present invention. Substantial components of the auction system of the present invention are included in the intermediary computer 3 connected to the network 2, and various data processing is substantially performed in the intermediary computer 3. For the intermediary computer 3, a plurality of sales applicant computers 4a to 4c operated by the sales applicant and a plurality of bid applicant computers 5a to 5e operated by the bid applicant.
Can be connected via the network 2.

In the present embodiment, the network 2 connects a plurality of computers by a communication protocol TCP / IP via a router, a TA, a modem, or the like, and is formed as an open network. However, it may be configured as a closed network. The mediation computer 3 is a WWW (World Wide Web) server, and is displayed as one computer for convenience in this embodiment. However, it is also possible to jump to another computer with a pointer or a link described in the HTML language, and the intermediate computer 3 may be composed of a plurality of computers. Sales applicant computers 4a-4c and bid applicant computers 5a
From 5e to 5e, the information of the mediation computer 3 can be operated by the web browser software.

FIG. 2 is a block diagram showing the system configuration of the mediation computer 3. The intermediary computer 3 has a sales DB 10, a bidding DB 20, and a sales target DB 30 configured by a relational database or the like.
It is included. Further, the bid history DB 41, the bidder limiter 42, the notification unit 43, the bid controller 44, and the transaction condition matching unit 45 are computer programs that are described in various software and realize the functions described below.

The sales side DB 10 is a sales applicant DB 11,
It has three databases consisting of a sales target DB 12 and a general information DB 13. The sales applicant DB 11 is a database having independent information of a sales applicant who is a company or an individual. For example, the sales applicant DB 11 stores a plurality of items relating to a sales applicant ID, a password, a company name, an email address, basic transaction conditions, and the like. Has as a field. The sales target DB 12 is a database including information of the sales target. When the sales target is an article such as a car, the sales target ID is
Additional information such as a vehicle name, a vehicle type genre, image data, a possible bid price, scratches and options are included as fields. Of course, the transaction target may be services such as travel, eating and drinking, and transportation. The general information DB 13 is a database having general information of a sales target. For example, information of a homepage displayed by a manufacturer or the like to be sold can be used. The sales target DB 12 has a relationship with the sales applicant DB 11, and one record of the sales applicant DB 11 corresponds to a plurality of records of the sales target DB 12.

On the other hand, the bidding side DB 20 is a bidding applicant DB.
21, a bid applicant DB22 and a bid history DB23. Bid applicant DB2
Reference numeral 1 denotes a database having independent information of a bid applicant who is a company or an individual, for example, a bid applicant ID,
It has a plurality of fields related to passwords, company names, e-mail addresses, basic transaction conditions, and the like.
The sales target DB 12 is a database including desired conditions of goods or services to be bid,
In addition to D, when the bid object is an article such as a car, information such as a car name and a car genre is included as a field. General information D
B13 is a database for recording the past bidding situation, and includes a bidding date, a vehicle name, a vehicle type genre, a bidding price, a successful bid flag indicating success or failure of a successful bid, and the like. The bid applicant DB22 and the bid history DB23 have a relation to the bid applicant DB21, and one record of the bid applicant DB21 corresponds to a plurality of records of the bid applicant DB22 and the bid history DB23.

The sales target DB 30 is a sales target DB 12
A plurality of records are created in association with the one record described above and associated with the sales target ID. DB30 by this sales object
The sales target ID, the vehicle name, the vehicle type genre, the transaction condition coincidence that frequency-evaluates the basic transaction conditions, and the bid I
Fields such as D, bid price, and past bid price are included. In the specification, it is assumed that a relation is established when an ID is commonly included in two databases.

The bid history DB 41 stores the sales target DB 12,
This is to evaluate the degree of coincidence of the transaction target in the bid applicant DB 22. For example, the frequency is 1 when the vehicle names match, and the frequency is 2 when the vehicle genre matches. here,
Bid I for which the value of the sales agreement field is 1 or 2
A record is created for each D.

Further, the transaction condition matching means 45 generates a bid applicant DB11 and a bid applicant DB 21 by a relation using a bid applicant ID and a sale applicant ID for each record created in the sale target DB 30 in the bid history DB 41. In, the basic transaction conditions are collated. The basic transaction conditions are a combination of various conditions such as $ day, payment date, cash or check, etc., and are graded in increments of one. The transaction condition matching means 45 sets 0 when the basic transaction condition of the bid applicant DB 22 is better than the basic transaction condition of the sale applicant DB 11, and bids more than the basic transaction condition of the sale applicant DB 11. In the case where the basic transaction conditions in the user DB 22 are lower, the difference is entered in the transaction condition matching degree field as the evaluation frequency.

When a certain number or more of records having the degree of coincidence of sales target of 1 or 2 are stored in the sales target DB 30, the notification means 43 uses information of the sales applicant DB 11 to send e-mail, fax, telephone, or the like. (Hereinafter referred to as e-mail, etc.), the sales applicant will be notified of this.

In response to this notification, the means for limiting bidders 42
Means that, for each sales target ID corresponding to each sales target, a sales applicant sorts or searches through the sales applicant computers 4a to 4c based on one or more arbitrary fields of the sales target DB 30. It is an input / output interface for performing in a format. For example, sorting is performed on fields such as the matching degree of sales target, the matching degree of transaction conditions, the past bid price, etc., and the bidders are limited to a certain number. Note that a condition search can be performed before and after sorting to limit the number of records. Further, these series of operations may be automatically executed by a program.

After the restricting operation of the bidder limiter 42, the notifying unit 43 sends the bidder DB 21 to the bidder.
E-mail, etc., using the information of In this e-mail, a bid target name such as a vehicle name, a bidable period, a display URL of a bid target, and the like are entered.

The bidding control unit 44 is a sales side DB 10 and a sales target DB 30 via the bid applicant DB 21 or directly.
Restrict browsing authority for. Then, the bidder who has received the previous bid notification mail or the like receives the bidder computers 5a to 5e from the seller DB10 and the sales target DB30.
Browse information and make a bid. Bidding price is D
It is stored in B30 and sorted. If the conditions that the sales applicant agrees are reached, an e-mail or the like indicating the successful bid is delivered to the bidder, and the auction is completed. If the auction is not established, the restriction is again performed except for those who have already participated in the auction or those who have already been selected by the bidder limiter 42, and the above procedure is repeated.

Next, the present invention will be further described by taking a used car auction as an example. First stage The company whose main business is to buy used cars and wholesale them to dealers is called a "wholesale store" and corresponds to the "sale applicant" described above. The wholesale store performs exhibitor registration. When you access the exhibitor registration page, enter the items and send it, you will receive your exhibitor ID and password via email. Registration items include company name, representative name, address, telephone number, fax number, email address,
The transaction type, the genre of the vehicle handled (eg, 4DR high-class / outside car), desired password, etc.

Second Step The used car dealer corresponding to the "bid applicant" registers the bidder. When you access the bidder registration page, enter the items and submit, the bidder ID and password will be sent by e-mail. Registration items include company name, representative name, address, telephone number, fax number, e-mail address, transaction type, handling vehicle genre (eg, 2DR / 4DR general / 4DR high grade), desired password, desired bid condition registration, etc. is there. Also, the used car dealer registers the conditions for purchasing the car. In particular,
Ranking of desired genre (example 1st 4DR high rank 2nd 4DR
General 3rd place 2DR), maximum bid price (eg 2 million yen /
1) and the average number required per month (eg 10).

Third stage The wholesale store exhibits a car. When you call the exhibit registration page, you will be asked for your ID and password, so enter it and enter the registration screen. Enter the following primary information on the input screen. Conditions such as vehicle genre (ex. 4DR high class), vehicle name (Tota, Se ○ Shio), detailed information (95, White, AT, Fully equipped, Aluminum, Inspection, No damage, etc.) When "send" is performed after input, a bidder information screen is displayed.

Fourth Stage In the ranking by the bidder limiter 42, the following conditions are applied.

[0031]

[Table 1] Condition 1: The vehicle type genre matches in the bidder's past bidding history. Condition 2: The registrant who has no bidding experience matches the first desired genre. Condition 3: No bidding experience. Registrants match the 2nd desired genre Condition 4: Registrants who have no bidding experience match the 3rd desired genre (ignored after the 3rd desired)

Thereafter, the following information is displayed on the bidder display screen. This screen serves as a reference for making a decision on the opening price, and makes it easy to sell in a desired price range.

[0033]

[Table 2] Bidder ID, cumulative participation count, average successful bid price, final bid date, sales conditions, bidable amount, required number per month, genre rank 1, genre rank 2, genre rank 3 0101,12,1212000,2000 05/12, Cash on delivery, 2 million, 10, 4DR
Luxury, 4DR general, 2DR <Condition 1 applicable 4321,41,2569000,2000 / 04/09, Cash on delivery, 4,000,000,30,4DR
Luxury, RV, foreign cars, 0234, 0, 0, 0, cash on delivery, 2 million, 10, 4DR luxury, 4DR general, 2DR
<Condition 2 Adaptation • 1111,0,0,0, Cash on delivery, 5 million, 30, Foreign cars, 4DR luxury, 4DR general <Condition 3 Adaptation

Fifth Step Next, on the bidder information screen, each item is sorted by a sort button as necessary. For example, the higher the number of bids, the higher the probability of bidding. Further, if the average successful bid price is set in descending order, the bid rate may decrease, but a high successful bid price can be expected. For example, it is possible to reflect the seller's wishes in the auction. This time, it is assumed that sorting is performed by the cumulative number of times of participation. After being sorted, the opening price and the bid start date and time are input and transmitted on the same screen. For example,
It is like 1.5 million yen, 12:00 on May 20.

Sixth Step In the processing on the server side, the participation steps are divided by a fixed number of persons (for example, 100 persons). Since the target person of the first auction has been decided, the bid start date and information of the car to be exhibited are sent to the target person by e-mail. For example, "○○ △ cars, used cars of the desired genre and price range will be exhibited. Se ○ Shio 95 year opening price 1.5 million yen, auction available period from 12 o'clock on May 20 to May 22 Until 12:00 on the day, the number of people scheduled to participate in the auction is 100. "
Since the number of target auctions is calculated in advance by the number of target persons / 100 persons, for example, when the number of target persons is 300, the processing is performed until the third auction. Therefore, one possible auction period is automatically calculated. For example, one period is two days, with a total period of six days.

Step 7 The bidder browses the information and makes a bid. Since the number of participants is limited or there is a price limit, bidders are more likely to make a successful bid, and satisfaction is increased. The bidder browses the exhibit screen with the bidder ID and password, and if he likes it, enters the bid price and sends it. The real maximum price, number of bidders and remaining time are displayed in real auction format. If there is a bidder and the period ends, the bidder with the highest price gets the right to negotiate. Information is sent by email to both the bidder and the exhibitor. For example, "Notice of successful bid, bidder ID: 00
02121, ○○ △ car, auction No1234567, ○ ○ Shio 95 year type 1.8 million yen bid. It is like. Exhibitors will contact the bidder by e-mail if they have a sales intention, and confirm the conditions.

Eighth Step If there are no bidders until the end of the period, the procedure shifts to the second auction. The same operation as in the sixth step is repeated.

Finally, the possibility of still another embodiment of the present invention will be listed. In the above-described embodiment, the fields to be dealt with are the name of the deal, the name of the deal item represented by the vehicle type genre, the product genre, and the like. However, the hierarchy may be set deeper. For example, in the furniture trade, large genres are classified into Italian imported furniture, Nordic furniture, domestic products, etc., medium genres are bedding, sofas, kitchens, etc., and small genres are classified as a mizuya, range table, dining table, etc. Also,
By combining different genres of large, medium, and small genres on the sale applicant side and the bid applicant side, the possibility of collation of both may be increased.

Further, in addition to the above-described embodiment, it is desirable that a sales applicant can browse past bid history data. At this time, the unit price, the number of lots, and the number of bids for which the bidder has made a bid are converted into points by a constant coefficient that is set and managed for each bidder. By this browsing, the bid results of the same genre can be known, and the initial price and the participants can be determined more accurately.

Further, in addition to the above-described embodiment, it is desirable that points such as unit prices, lot numbers, and the number of times of successful bids in the past are pointed by a certain coefficient so that bid applicants can view these data. By displaying the list of sales applicants matched by entering the conditions of the bid applicant at the same time of browsing, the bid applicant can send anonymous e-mail to this sales applicant by describing the bid application target etc. It becomes easier for bid applicants to obtain desired products and the like.

In the above embodiment, the mediation computer 3
And the sales applicant computers 4a to 4c are constituted by different computers. However, it may be configured by the mediating computer 3, the sales applicant computers 4a to 4c, and one computer or the implementer computer 6, which is a plurality of computers managed by the same implementer.

[0042]

As described above, according to the features of the auction system according to the present invention, the bidders are limited for each sales target that matches one or more arbitrary fields of the sales target DB based on the reference. Therefore, it is possible to limit to bidders according to the intention of the sales applicant. In addition, since the bid applicant is notified of the auction schedule of the desired target, he / she can start the auction with a margin, and the chances of making a successful bid have increased. as a result,
ADVANTAGE OF THE INVENTION According to this invention, it became possible to provide the auction system which can meet the intention of both a bid applicant and an implementer or a sales applicant on a network and can perform a reasonable auction. .

It should be noted that the reference numerals described in the claims are merely for convenience of comparison with the drawings, and the present invention is not limited to the configuration of the attached drawings by the description. .

[Brief description of the drawings]

FIG. 1 is a diagram showing a network of an auction system.

FIG. 2 is a block diagram showing a system configuration in an intermediary computer.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Auction system 2 Network 3 Intermediary computer 4a-4c Sales applicant computer 5a-5e Bid applicant computer 6 Executor computer 10 Sales side DB 11 Sales applicant DB 12 Sales target DB 13 General information DB 20 Bidding side DB 21 Bid wish Bidder DB 22 bid request DB 23 bid history DB 30 sale target DB 41 sale target collation means 42 bidder limited means 43 notification means 44 bid control unit 45 transaction condition collation means

Claims (8)

[Claims] 1. A bidder computer (6), accessible from a bidder computer (5a-5e) connected to a network (2) and for executing an auction, comprising a bidder and a bidder. An auction system for conducting an auction between the sellers, an implementer computer (6) includes a sales side DB (10) containing information of a sale target that the implementer wants to sell, an ID of a bid applicant, and contact information. And a bidding side DB (20) including data and information on a bid requesting object.
When the sales target of (10) and the sales target of the bidding side DB (20) match or the genre matches, the bidding side DB (20) and the sales side DB (1) are set for each matching sales target.
0) Sales target collation means (41) for substantially creating a sales target DB (30) by extracting at least a part of the fields from each of them, and one of the sales target DBs (30)
Or, a bidder limiter (42) for limiting bidders for each matching sales target based on two or more arbitrary fields, and bidders are limited by the bidder limiter (42). An auction system comprising a bidder notification unit (43) for notifying a bid applicant of the sale target and the fact that a bid is possible, and allowing the bidder to participate in the auction to be sold as a bidder. . 2. The bidder restricting means (42) divides the bidders into a plurality of groups and limits the bidders. A certain set of bidders conducts the auction. 2. The auction system according to claim 1, wherein the auction is sequentially performed by the remaining sets of bidders. 3. The notification by the bidder notification means (43) to the other remaining set of bidders is as follows:
3. The auction system according to claim 2, wherein the auction is performed after an auction by the set of bidders is not established. 4. The bidding side DB (20) and the sales target DB (30) have bidding history information.
The auction system according to any of the above. 5. The bidding-side DB (20) has basic bidding-side transaction conditions, the selling-side DB (10) has basic bidding-side transaction conditions, and the transaction condition matching means (45) has 5. The method according to claim 1, wherein the degree of matching between the bidding-side basic transaction conditions and the selling-side basic transaction conditions is evaluated stepwise and added to one or more fields of the sales target DB (30) as a transaction collation frequency. The auction system described in. 6. An implementer comprises a sales applicant and an intermediary, the implementer computer (6) includes a sales applicant computer (4a-4c) and an intermediary computer (3), and a bid applicant computer (5a). The auction system according to any one of claims 1 to 5, wherein ~ 5e) and the sales applicant computer (4a ~ 4c) are connectable to the mediation computer (3) via the network (2). 7. The bidder restricting means (42) sorts or sorts the sales applicants on the basis of one or more arbitrary fields of the sales target DB (30) for each matching sales target. 7. The auction system according to claim 6, wherein a search is performed in an interactive manner via said sales applicant computers (4a to 4c) to limit bidders. 8. The bidder limiter (42) sorts or searches a predetermined priority for each of the matching sales targets based on one or more fields of the sales target DB (30). The auction system according to any one of claims 1 to 7, wherein the auction system is performed according to the ranking, and the bidders are limited by limiting to upper records within a predetermined number.