KR20090034846A - System of auction - Google Patents

Abstract

An auctioning system selecting bid price as contract price capable of bidding the number of auction products is provided to control the sequence of bidding the product and reduce the load of the system. A member database(11) describes the information of members. An auction article database(12) stores the information of two or more auction products. A bid database(13) stores a bid specification about the auction product. A bidding module(15) stores the bid specification about the auction product in the bid database. A bidding commission collecting module(16) collects a bidding commission from a terminal(30). If a successful bidding module(17) is complete, the auction product is set up the bidding price.

Description

Auction System {SYSTEM OF AUCTION}

The present invention relates to an auction system, and more particularly, in the case of a private auction (paid bidding auction) in which a bidding fee is paid at the time of bidding, it is inevitably selected from among a plurality of bids. It relates to an auction system that selects a bid with the same bid as the winning price.

Republic of Korea Patent Publication No. 10-2003-61702 (Application No. 10-2003-12397, Citation Verification 1) and Republic of Korea Patent Publication No. 10-2003-74491 (Application No. 10-2003-25987, Citation Verification 2) The method of winning auction in bid auction is described. In the case of citation verification 1, the bid price closest to the upper limit of the bidding bidding bid is the only bidding bid, and the citation verification 2 is the lowest bid among the bidding bidding bidding bidder.

However, since the only cited verifications can be determined as the only bidder, the bidding is imminent because the bidding is made at the close of the bidding time. Therefore, when there are a plurality of auction items, the members make a bid for each auction item. There was an inconvenience to do, and because the winning bid / bidding was decided according to which auction item was selected, the factors of luck were strong.

An object of the present invention is to provide an auction system for determining a bid price having a bid equal to the number of auction articles auctioned in a pay bid auction in order to overcome the problems of the prior art as described above.

Auction system according to the present invention,

An auction system in which auction proceeds by connecting a server and a plurality of terminals to a network through a network,

The server includes a member DB in which member information is written; An auction article DB for storing information of at least two auction articles; A bidding DB for storing bidding contents for the auction item; A bidding module for storing bidding details from the terminal for the auction item in the bidding DB; A bid fee collection module for collecting a bid fee from the terminal attending the bid; When the bidding is completed, a bidding module for setting the bid amount that the bid number of the number of auction items in the bid of the bidding DB; includes.

The bidding fee is preferably an electronic coupon that is pre-paid and stored in the member DB.

When the bidding module has a large number of bids with as many bids as the number of auction items, the bidding price is lower than the predetermined threshold amount among the bidding bids as the bidding price, or the bidding price that is closest to the bidding price is high. desirable.

In addition, the reference amount may be appropriately determined by the operator, but is preferably 1 or 0 won.

The auction items may be identical to each other, or at least one of the auction items may be different from other items. When at least one of the auction items is different from other auction items, it is preferable to make a successful bid by matching the predetermined order known at the time of auction with the bidding order to the successful bid amount.

Here, the term "article" refers to an article having a shape or an article having no shape. Ordinary goods refer to fluids such as desks, chairs, computers, etc. In this specification, intellectual property such as real estate such as buildings or lands, patent rights, utility model rights, design rights, trademark rights, copyrights, or providing lunch with a famous person, etc. This includes both fluids and bodies without promises. The term "delivery" usually refers to the transport of a fluid from one place to another, but this specification also encompasses any contract, such as changing the owner of a property, transferring an intellectual property, or fulfilling a promise. It is equally used herein below.

As described above, according to the present invention, it is possible to appropriately control the order in which a large amount of the auction items are assigned to the bidder of the bidding, so that the system is less crowded, and since there are a number of auction items in one auction, the members are assigned to each auction item. There is no inconvenience in bidding one by one, and since the bidding / bidding is not determined depending on which auction item is selected, the bidding time and the bidding amount are determined only, so there is an advantage that the analysis can be carried out to be auctioned more accurately.

Hereinafter, with reference to the drawings will be described in detail. However, these drawings are for illustrative purposes only and the present invention is not limited thereto.

1 is a system configuration diagram of one embodiment in the present invention.

Referring to FIG. 1, the system according to the present invention includes a server 10 and a terminal 30 connected to the server 10 through an internet network 30 (open network).

The server 10 is a member DB (11), auction article DB (12), bidding DB (13), successful bid DB (14), bidding module (15), bid fee collection module (16), successful bid module (17) And a central processing unit (not shown) for mounting the bidding collection module 18 and the plurality of modules, and an internet access device (not shown) for connecting the server 10 to the Internet network 20. Consists of

The member DB 11 records personal information, bidding information, successful bidding information, bidding fee information, and the like of a member. In particular, the bidding fee is recorded in the member DB (11) in the form of electronic coupons (bid coupons) by the pre-payment, it can be configured that the electronic coupon is automatically called when a member bids on the auction.

The auction article DB 12 has information on items that are being auctioned or scheduled to be auctioned.

The bidding DB 13 records the bidding contents of the members, and the successful bidding DB 14 records the successful bidding result.

The bidding module 15 sees the auction information displayed on the terminal 30, and when the user bids on the auction, the bidding information is recorded in the bidding DB 13.

When the bid deadline elapses, the successful bidder module 17 determines the successful bidder and / or the successful bidder based on the bidding result of the bidding DB 13. Of course, the determination of the successful bidder and / or the successful bid amount by the successful bidder module 17 may be determined manually by printing the bidding details. When the successful bidder and / or the successful bidder are determined by the successful bidder module 17, the successful bidder and / or the content and amount of the successful bidder are recorded in the successful bidder DB 14 and / or the member DB11.

The successful bidder and / or successful bidder announces this, notifies the corresponding member, and the successful bidder collection module 18 operates to collect the successful bidder from the member.

Once the winning bidder is decided and the winning bid is received, the goods are delivered.

According to the present invention, there is a plurality of auction items in any one auction, and the successful bidding module 17 sets a bid price with the same number of bids as the number of the auction items as a successful bid price.

If necessary, the successful bidder module 17 may set a bidder having the same number of bids as half of the number of the auction items as the successful bidder.

Here, although the server 10, the Internet network 20, or the terminal 30 is shown based on the web, the server 10 may be a server that can service the mobile phone, The internet network 20 refers to a network that may be replaced by a combination of the internet network and a telephone communication network, or only a telephone communication network, and the terminal 30 may be replaced by a mobile phone, a PDA, a smartphone, or the like.

2 is a flowchart of one embodiment in the present invention.

Referring to Figure 2, the auction content including the auction item is displayed on the member terminal of the display step 100, the bidder and the bidding fee payment step 200, the bidder to participate in the auction and pay the bidding fee, the successful bidder And / or a successful bidder selection step 300 for determining a successful bid price, a successful bid price collection step 400 for receiving a successful bid price from the successful bidder, and a delivery step 500 for delivering a successful bid product to the successful bidder.

A plurality of auction items are present in any one auction in the display step 100, and the successful bidder selection step 300 sets a bid price having the same number of bids as the number of the auction items.

If necessary, the successful bidder selection step 300 may determine a bid price having the same number of bids as half of the number of the auction items.

The bidding fee or the bidding price may be collected using a micropayment means that has been recently developed on the Internet. The cyber money is paid when a user clicks on an advertisement (for example, a banner advertisement) of a website according to the present invention. You can also pay with money. In addition, it is possible to make a small payment easily by being exempted from or reduced the remittance fee by agreement with a specific bank. If the mobile phone is used as a payment method, there is a method of billing the mobile phone subscriber to the mobile phone fee.

At the time of bidding, the maximum bid amount so far, the number of bidders, and the total amount of bid fees so far may be disclosed.

In addition, the present invention can limit the number of bids. In the present invention, since the bidding fee may be a problem due to an excessive burden of the bidding fee, the number of bids per auction item may be limited to, for example, five bids per item, or 10 or more bids per day.

The present invention can also be applied to reverse auctions. In other words, if you apply for an auction to buy an item, the supplier bids for a certain amount of time and the bidding fee is collected, and some of the bidding fee is collected. Will be much lower than the normal reverse auction, the auction applicant can purchase the necessary goods at a low cost, and the supplier can receive a portion of the bidding fee for the winning bid and receive at least a higher bid than the winning bid. . In particular, reverse auctions may be usefully used in B2B transactions (business-to-business transactions), and the bidding fees may be replaced with goods.

In the present invention, there are various methods of selecting successful bidders.

In the present invention, a single auction has a plurality of auction items. In the present invention, the successful bidder sets the bid with the same number of bids as the number of auction items as the successful bidder. This will be described through an embodiment.

Example 1

The auction item for A-Auction is five identical laptop computers, and the bid price closest to the reference price of KRW 1 is determined.

Members bid as follows:

KRW 1: 56 bids

KRW 2: 83 bids

3 won: 15 bids

4 won: 36 bids

5 won: 6 bids

6 won: 14 bids

7 won: 12 bids

8 won: 10 bids

9 won: 4 bids

10 won: No bid

11 won: 9 bids

12 won: 5 bids ------------> Successful bid

13 won: 5 bids

14 won: 1 bid

15 won: 6 bids

16 won: 18 bids

17 won: 11 bids

18 won: 5 bids

19 won: 4 bids

20 won: 2 bids

21 won: 10 bids

In this case, the bids with the same number of bids as the number of auction items (5) are 12 won, 13 won, and 18 won, but the 12 won closest to the standard price of 1 won is determined as the winning bid price, and the bid is 12 won. We win five bids.

In this case, if the base price was 19 won, 18 won would be the winning price. The reference price may be set as needed, but is preferably set to 1 or 0 won.

Since the present invention is an auction, it is preferable that a bid cannot be made with a zero or negative bid, but in some cases, a bid may be made with zero or a negative number (for example, -4 won).

Example 2

The auction items for B auction are 5, including one Mercedes-Benz car ($ 50) and one Sorrento passenger car ($ 20), a laptop computer ($ 20) and two mobile phones ($ 50). The price closest to the price of 1 won is set as the winning price. In addition, the bidder bids the successful bidder in the bidding order.

Members bid as follows:

KRW 1: 56 bids

KRW 2: 83 bids

3 won: 15 bids

4 won: 36 bids

5 won: 6 bids

6 won: 14 bids

7 won: 12 bids

8 won: 10 bids

9 won: 4 bids

10 won: No bid

11 won: 9 bids

12 won: 5 bids ------------> Successful bid

13 won: 5 bids

14 won: 1 bid

15 won: 6 bids

16 won: 18 bids

17 won: 11 bids

18 won: 5 bids

19 won: 4 bids

20 won: 2 bids

21 won: 10 bids

In this case as well, in the same manner as in Example 1, the winning price was determined to be 12 won which is the number of auction items (5) and closest to the reference price of 1 won. Benz, Sorrento, a laptop, a mobile phone, and a mobile phone were assigned according to the order of five bids for 12 won. In other words, Benz was assigned to the first bid for 12 won, Sorrento for the second bid, laptop for the third bid, and mobile phones for the fourth and fifth bids.

In this case, if necessary, items with low market value may be allocated, and the order of auction items may be determined in advance.

For example, in order to determine the order of auction items in advance, cell phones, Benz, Sorrento, notebooks, cell phones can be assigned in order, and cell phones, Sorrento, Mercedes, notebook, cell phones can be in order.

If necessary, bids with the same number of bids as half of the number of auction items may be set as winning bids.

Example 3

The auction item for the A auction is six identical laptop computers, with three bids being the highest price closest to the base price of 11 won, and three bids being the lowest price closest to the base price of 11 won.

Members bid as follows:

KRW 1: 56 bids

KRW 2: 83 bids

3 won: 15 bids

4 won: 36 bids

5 won: 6 bids

6 won: 14 bids

7 won: 3 bids

8 won: 10 bids

9 won: 3 bids ------------> Successful bid

10 won: No bid

11 won: 9 bids

12 won: 5 bids

13 won: 5 bids

14 won: 1 bid

15 won: 6 bids

16 won: 18 bids

17 won: 11 bids

18 won: 5 bids

19 won: 3 bids ------------> Successful bid

20 won: 2 bids

21 won: 10 bids

In this case, among the 7, 9, and 19 won bids for the number of auction items (6), the winning bid price is determined to be 19 won close up to the base price of 11 won and 9 won close down. , Bid six bids for the 19 and 9 won.

Various embodiments can be made by simply combining a part of Embodiments 1 to 3, which are included in the scope of the present invention.

1 is a system configuration of one embodiment in the present invention.

Figure 2 is a flowchart of one embodiment in the present invention.

*** Explanation of symbols for the main parts of the drawing ***

10. Server 11. Member DB

12. Auction Items DB 13. Bidding DB

14. Bidding DB 15. Bidding Module

16. Bidding fee collection module 17. Bidding module

18. Successful bid collection module 20. Internet network

30. Terminal

100. Auction item display step 200. Bidding and bid fee payment step

300. Successful bidding stage 400. Successful bidding payment stage

500. Delivery Steps

Claims (2)

In the auction system in which the auction proceeds with a plurality of terminals connected to the server through the network, The server, A member DB including member information; An auction article DB for storing information of at least two auction articles; A bidding DB for storing bidding contents for the auction item; A bidding module for storing bidding details from the terminal for the auction item in the bidding DB; A bid fee collection module for collecting a bid fee from the terminal attending the bid; When the bidding is finished, a bidding module for making a bid amount that the bid number of the auction article number of bids in the bidding DB; Includes, At least one of the at least two auction items is different from the other auction items, The successful bid module, If there are a large number of bids with as many bids as the number of auction items, the closest bid that is lower than 0 or 1 won is the winning bid or the closest bid that is higher than 0 or 1 won is the winning bid Auction system, characterized in that. The method of claim 1, The bidding fee, the auction system, characterized in that the electronic coupon stored in advance in the member DB.

Images