KR101151269B1 - Auction system - Google Patents

Abstract

The present invention relates to an auction system, and more specifically, to make a bid by deducting a paid bid auction or cyber money or mileage, etc., which pays a bidding fee at the time of bidding, or in an auction or the like that allows a certain number of bids in a certain period. The present invention relates to an auction system that determines an intermediate value between the lowest price and the highest price in a bid at the time of a successful bid after a bid is ended, and selects a bid that has been bid midway among the bids that have been bid at the median.

According to the present invention, by determining the median value between the lowest price and the highest price in the bidding, and determining the bidder bidding in the middle of the bidding bid in the middle price as a successful bidder, so that any one can bid at all price ranges By providing the bidder with two variables that must be bid in the middle of the mid-price and the mid-price, a variety of results can be derived, thereby doubling the beauty of the auction and reducing bidding on the system. It works.

Auction, median, middle, auction, middle

Description

Auction Method {AUCTION METHOD}

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. Median calculation module 17. Successful 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

The present invention relates to an auction system, and more specifically, to make a bid by deducting a paid bid auction or cyber money or mileage, etc., which pays a bidding fee at the time of bidding, or in an auction or the like that allows a certain number of bids in a certain period. The present invention relates to an auction system that determines an intermediate value between the lowest price and the highest price in a bid at the time of a successful bid after a bid is ended, and selects a bid that has been bid midway among the bids that have been bid at the median.

In the Republic of Korea Patent Application Publication No. 10-2003-61702 (Application No. 10-2003-12397, Cited Invention 1) and the Republic of Korea Patent Publication 10-2003-74491 (Application No. 10-2003-25987, Cited Invention 2) How to bid in Japan is described. Cited Invention 1 is the only bid that bids closest to the highest bid limit among bids, and Cited Invention 2 is the lowest bid among the bids bidding solely by one bidder.

However, the above cited inventions can be determined as the only bidder bidding bidding only because the bidding is close to the bidding time is close to the system, and if any one bids at all price ranges will inevitably win the bid There was a problem.

The present invention is to solve the problems of the prior art as described above, the auction system to determine the middle value between the lowest price and the highest price in the bidding at the time of bidding, and to determine the bidding bid in the middle of the bidding in the middle bid as a successful bidder The purpose is to provide.

The auction system according to the present invention is a auction system in which auction proceeds with a server and a plurality of terminals connected to the server through a network,

The server includes an auction article DB in which information on at least two auction articles is stored; 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 median value calculating module for obtaining a median value among bids of the bidding DB when the bidding is finished; One or more bids bidding close to the center in time of the one or more bids bidding at the median value are awarded.

In the above bidding module, the bidding number bid for the median value wins the bid if the even number is (number of bids / 2) or {(bid number + 2) / 2}, and if the bid number is odd {(number of bids +1 It is desirable to win the) / 2} th bid.

In the above bidding module, the bidding number bid for the median value bids the bid number (number of bids / 2) and the {(bid number + 2) / 2} th bid, and the bid number {(number of bids + It is preferable to win the 1) / 2} th bid.

The intermediate value calculation module, when a bid minimum price is known in advance, the lowest bid price closest to the bid minimum price and the highest bid price with a bid at all bidable price ranges between the lowest bid price (between the bid lowest price and the highest bid price) All integer price points at must have at least one bid), if the sum is even (Minimum bid + best bid) / 2, and if odd, (minimum bid + best bid -1) It is preferable to set / 2 and / or (lowest bid + highest bid +1) / 2 as an intermediate value.

The intermediate value calculation module, when the bid highest price is known in advance, the highest bid closest to the bid highest price and the lowest bid (the between the highest bid and the lowest bid) with bids at all bidable price ranges between the highest bid The sum of all integer price points at must have at least one bid), if even, the highest bid is the lowest bid, and if odd, the highest bid is the lowest bid. It is preferable to set +1) / 2 and / or (highest bidding price + lowest bidding-1) / 2 as an intermediate value.

Herein, 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 and 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 includes any contract being made, such as changing the owner of a property, transferring an intellectual property, or fulfilling a promise. It is equally used herein below.

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 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), intermediate value calculation 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 subtracts the bidding fee information, cyber money or mileage in case of auction information, bid information, successful bidding information, paid bid auction, and cyber money or mileage information, and a predetermined time in order to bid. In an auction where bidding is possible for a predetermined number of times (for example, 10 times) during (for example, 1 day), the number of bids for a predetermined time (1 day) is recorded. The bidding fee is recorded in the member DB 11 in the form of an electronic coupon (bidding coupon) by prepayment, and may be configured to automatically extinguish the electronic coupon when the member bids on the auction item.

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 bidding, each bid is given a bid number. The bid number may be a serial number or randomly assigned.

When the bidding is closed, the bidding is no longer prevented, and the median value calculation module 16 determines the median value based on the bidding result of the bidding DB 13. When the median value is determined, the median value is recorded in the successful bid DB 14 with the successful bid price.

The median value finds the price midway between the highest bid or the lowest bid in succession without a price range without bids based on a predetermined bid low or bid high.

For example, the minimum bid price is 1 won, 1 won, 2 won, 3 won, 4 won, 5 won, 6 won, 7 won, 8 won, 9 won, 11 won, 12 won. , $ 13, $ 14, $ 15, $ 16, $ 17, $ 18, $ 19, $ 20, $ 21, $ 22, $ 50, and $ 1 are the lowest bids, and $ 9 is the highest bid. Becomes This is because all prices were bid between 1 and 9 won. 22 won becomes the highest bidder when there is at least one bid in 10 won. The median is the median price between the lowest bid and the highest bid. The median above is the median price of 1 won and 9 won (1 won + 9 won) / 2 = 5 won. If there is no bid at 11 won and there is a bid at 10 won, the median value = (1 won + 10 won-1) / 2 = 5 won or the median = (1 won + 10 won + 1 won) / 2 You can set it as = 6, or you can set both 5 and 6 as the median. If there is a bid at the lowest bid, the lowest bid is the lowest bid. If there is no bid at the lowest bid, the bid with the bid closest to the lowest bid is the lowest bid.

For example, when the highest bid price is predetermined, the highest bid price is 1,000 won, 1,000 won, 999 won, 998 won, 997 won, 996 won, 995 won, 994 won, 993 won, 992 won, 991 won, 990 won. If the bid is 987, 986, 985, 984, 983, 982, 981, 900 or 800, the 1,000 won will be the highest bid and 990 will be the lowest. This is because all prices were bid between 1,000 won and 990 won. The median value is the median price between the highest bid and the lowest bid. In this case, the median is (1,000 won + 990) / 2 = 995, which is the median price between 1,000 won and 990 won. If there is a bid of 989 won, the median value = (1,000 won + 989 won-1 won) / 2 = 994 won or the median value = (1,000 won + 989 won + 1 won) / 2 = 995 won For example, you may choose between $ 994 and $ 995. If there is a bid at the highest bid, the highest bid is the highest bid. If there is no bid at the highest bid, the bid with the bid closest to the highest bid is the highest bid.

Here, the lowest bid price is the lowest price that can be bid, and the highest bid price is the highest price that can be bid and is predetermined price by the operator of the auction system. The minimum bid is the lowest bid price, and the highest bid is the highest bid price, but in this auction system, at least one bid is available at the bidable price range between the minimum bid and the highest bid price and the highest bid and the lowest bid price. Should be.

The successful bidder module 17 determines a central bidder as a successful bidder among bids bidding on the median value calculated by the median value calculation module 16 in the bidding DB 13. Here, the successful bidder means a member corresponding to the central bid number. For example, when the median value is determined by the median calculation module 16 as 5 won, if the total number of bids for 5 won is 21, the bid is calculated as 21 + 1/2 and the 11th bid ( Central bid) is successful bid. If the median value is determined by the median calculation module 16 to 5 won and the total number of bids bid for 5 won is 22, the 22/2 = 11th bid or (22 + 2) / 2 = 12th bid We can make a successful bid or we can win both the eleventh and the twelfth bids. When a large number of bids are to be successful, the bidding may be performed by appropriately setting a standard before and after the middle bidding. In the bidding order, the first bid in time is the first bid and the last bid is the nth bid. The bid number is bidding later in time is preferably given a larger bid number, but in some cases the bid number may be randomly assigned, it is preferable to select the bid number based on the bidding time, the bidding order .

If any one or more bidding numbers are determined as successful bidders by the successful bidder module 17, the successful bidder numbers, successful bidders, and amounts are recorded in the successful bidder DB 14 and / or the member DB11.

The successful bidder, successful bid number, 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.

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 bidding step 200 for the member to participate in the auction, the bid price and the successful bid number (successor) to determine The successful bidder selection step 300, the successful bid price collection step for collecting the winning price from the successful bidder 400, and a delivery step 500 for delivering the successful bid product to the successful bidder.

The successful bidder selection step 300 sets a successful bid number as a median value among a plurality of bids and a bid number bidding in the middle of the bids bid for the median value.

If necessary, the bidder selection step 300 includes a plurality of successful bidders and a plurality of successful bidders based on a median (middle of the lowest bid and the highest bid) and a central bid (bidding at the middle bid). You can also set a winning bid number.

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, it is possible to disclose the highest bid or the lowest bid, the number of bids for each bid, the bidable bid, the number of bidders, and the total bid fee so far.

In addition, the present invention can limit the number of bids. In the present invention, the bidding fee is collected, so it may be a problem due to an excessive burden of the bidding fee. For example, the number of bids per auction item may be limited to five times per item, or may be limited to bidding no more than 10 times a day. In particular, when bidding is possible without a bidding fee, it is preferable to apply a bid frequency.

As described above, according to the present invention, by determining the median value between the lowest price and the highest price in the bidding, and deciding the bidder bidding in the middle of the bidding bids at the median value, the bidder can be successful even if any one bids at all price ranges. By providing the bidder with two variables that must be bid in the middle of the mid-price and the mid-price, a variety of results can be obtained, which doubles the beauty of the auction and the bidding is relatively reduced at the closing time. The crowd is reduced.

Claims (10)

In the auction method, a server and a plurality of terminals are connected to the server via a network, the auction proceeds, A display step of displaying, on the server, the auction contents including the auction item on a member's terminal; A bidding step of bidding for the auction item at a member's terminal and transmitting bidding information to the server; The server obtains a median value among the bids, and if the bid number bidding on the median value is an even number of 2 or more, the server bids the (bids / 2) th bid or the {(bids + 2) / 2} th bid, and the If the number of bids bid in the median is an odd number of three or more bidding step of winning the {(bid number + 1) / 2} th bidding; The median value is If the bid lowest price is known in advance, the lowest bid closest to the lowest bid and the highest bid with bids at all bidable price points between the lowest bid (all integer price points between the lowest bid and the highest bid are If the sum of at least one bid is even, the value of (lowest bid + highest bid) / 2 is even, and if odd, (lowest bid + highest bid -1) / 2 or (lowest bid) + Bid + 1) / 2 is the median, If the bid highest price is known in advance, the highest bid closest to the bid highest price and the lowest bid with bids at all bidable price ranges between the highest bid (all integer price points located between the highest bid and the lowest bid are If the sum of at least one bid is even, (best bid + least bid) / 2 is an intermediate value, and if odd, (best bid + least bid +1) / 2 or (best bid) Auction method characterized in that the minimum bid -1) / 2 as an intermediate value. delete delete delete delete delete delete delete delete delete

Images