JP2006172515A - Method for adjusting profit of auction and auction device - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To reduce legal risk at the time of exhibiting the gift of a prize. <P>SOLUTION: The limit sum of a profit to be provided to a winner as a gift is preliminarily set in an auction device by a provider who offers a prize on legal constraint or the other constraints, and when the successful bid price of the auction exceeds the limit sum, the difference between the bid price and the limit sum is paid to the provider. In the auction device, the value of the minimum successful bid price is restricted to the value of the limit sum or less, and a system for securing P≤S<SB>n+1</SB>(P is the successful bid price and S<SB>n+1</SB>is the minimum successful bid price of the next exhibit of the minimum successful bid price) as a system for deciding the successful bid price. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

The present invention relates to an auction profit adjustment method and an auction apparatus that increase the effect of a sweepstakes campaign by an operator handling prizes for prizes in an auction.

Sweepstakes campaigns conducted by manufacturers and retailers for consumers have been used by many businesses as an important tool for increasing the name recognition and promoting sales.

There are various types of gifts offered, such as cash, cash vouchers such as books and gift certificates, invitations to travel, sports and concerts, goods, etc. Generally, cash equivalents such as cash and cash vouchers are used. As prizes for prizes tend to be collected from many consumers, while prizes for prizes with original goods bearing the name of the target product are favored by business operators because they are more effective in improving the name recognition.

In the conventional prize method described above, a mismatch is likely to occur between the prize provided by the business operator and the prize desired by the consumer. As a result, there is a problem that the business operator misses many potential buyers and cannot fully exert the campaign effect.

On the other hand, Internet auctions have been spreading recently. Auctions are becoming widely recognized as being more common, with opportunities to see information about auctions in various media. In order to eliminate the mismatch between the prizes described above, there is a method of using these existing Internet auction systems. This is a method of listing and cashing prizes that are won using an Internet auction system, and is a method for eliminating mismatches between prizes from the consumer side by giving such cashing means to consumers. (Example: Patent Document 1)
JP 2004-272699 A Restrictions on matters related to the provision of prizes through sweepstakes (March 1, 1978, Fair Trade Commission Notification No. 3) Restrictions on matters related to the provision of premiums to general consumers (March 1, 1978, Fair Trade Commission Notification No. 5) About operation about designation of unfair transaction method when we offer offer of economic profit by lottery method in advertisement (July 2, 1971 secretary general notice No. 5) About calculation standard of value of prizes (November 30, 1978 secretary general notice 9th) Unfair prizes and illegal labeling prevention law (Act No. 134, May 15, 1957) Act on Prohibition of Private Monopoly and Fair Trade (Act No. 54 of April 14, 1947)

Businesses must comply with various relevant laws and regulations when implementing sweepstakes (eg, Non-Patent Documents 1 to 6). However, in an existing auction system that is used by a method such as Japanese Patent Application Laid-Open No. 2004-272699, a method in which an operator is incurred when the value of a prize (Non-Patent Document 4) rises beyond the limit of regulation. No countermeasures have been taken with respect to legal risks, and businesses concerned about legal risks were unable to implement auction-linked sweepstakes campaigns.

The present invention has been made to solve the above-described problems, and an object of the present invention is to provide a business operator with a means for controlling the value of prizes in an auction dealing with prizes. It is an object of the present invention to provide an auction profit adjustment method and an auction apparatus that reduce the legal risk of a user and increase the effect of a prize campaign by using an auction-linked prize campaign.

The invention according to claim 1 is an auction apparatus that manages one unit or a plurality of units of an auction in which prizes provided by a business operator are exhibited, and management data (for the unit) First storage means for storing at least the ID of the auction business operator and the limit of the winning bid price of the auction; and exhibition data (ID and lowest winning bid price (however, the lowest winning bid value is the above-mentioned value). An exhibition data table capable of storing a plurality of data including at least a limit value of management data in one storage means) and a quantity (however, the quantity value is an integer value of 1 or more). Bids capable of storing a plurality of second storage means for storing and bid data (data including at least an ID, a maximum bid price, and a quantity (where the value of the quantity is an integer value of 1 or more)). A third storage means for storing the data table, a fourth storage means for storing the winning bid price of the auction, and a received amount (amount of money corresponding to the right to receive by the seller of the auction of the winning bid price). A fifth storage means for storing, a sixth storage means for storing the acquisition amount (amount of money for the acquisition right of the operator of the auction among the successful bid prices), and the following three means: (1) Rearrangement of the exhibition data in the exhibition data table of the second storage means in ascending order of the value of the lowest successful bid price, and rearrangement of the bid data in the bid data table of the third storage means in descending order of the value of the highest bid price maximum means, on the basis of the highest bid price and quantity of the bid data with the lowest bid price and quantity of the exhibitor data rearranged by (2) the sorting unit, satisfy S _n ≦ B _n n (where q1, q2,..., qr are the quantity values of the sorted exhibition data in order from the top, and the lowest winning bid value of the sorted exhibition data is in order from the top and _{S 1, S 2} side-by-side by the value of the _{quantity, ..., S q1, S q1} + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, S q1 + q2 + 2, ..., S q1 + q2 + ... + qr and, the sorted of bid data quantity t1, in order from the beginning the value of t2, ..., and tu, the value of the highest bid price bid data to which the side-by-side are re listed from top by the value of the quantity of and the bid data sequentially B _1, B _{2, ..., B t1, B t1 + 1,} B t1 + 2, ..., B t1 + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , q1 + q2 + + Qr = i, t1 + t2 +... + Tu = j, the range of n when n exists is 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n when n does not exist is n = 0) N detection means to detect, (3) at least the following four conditions based on n detected by the n detection means: (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3-3) P ≧ B _{n + 1} , (3-4) P is an arbitrary value (however, when n = 0, (3-1) is excluded, and when S _{n + 1} does not exist, (3 -2) is excluded, and if B _{n + 1} does not exist, any P satisfying all of (3-3) is determined as the winning price of the auction, and the determined winning price is stored in the fourth memory. Bid price determination means for inputting to the means, and at least pricing means, The management data is pre-input to the storage means, the exhibition data table is pre-input to the second storage means, and zero or more exhibition data is pre-input to the exhibition data table of the second storage means, The auction apparatus in which the bid data table is input in advance to the third storage means, and the bid data of 0 or more is input in advance to the bid data table of the third storage means. A winning bid price input step of inputting a winning bid price to the fourth storage means, a value of the winning bid price of the fourth storing means is compared with a limit value of the management data of the first storing means, and the winning bid When the price value is less than or equal to the limit value, the winning bid value is input to the fifth storage means, and when the winning bid value exceeds the limit value, In the storage means A received amount input step of inputting a value, and an acquired amount input of inputting a value obtained by subtracting the value of the received amount of the fifth storage means from the value of the winning bid price of the fourth storage means to the sixth storage means And a profit adjustment process consisting of steps.

The invention according to claim 2 is an auction apparatus that manages one unit or a plurality of units of an auction in which a prize provided by a business operator is an exhibit, and management data (for the unit) Data including at least the ID of the auction business operator, the limit amount of the winning bid price of the auction, and the lower limit price of the lowest winning bid price of the auction (however, the value of the lower limit price is less than the limit value) ) And storage data (ID and minimum bid price (however, the value of the minimum bid price is equal to or less than the limit value of the management data of the first storage means) and the first storage means Exhibition data table capable of storing a plurality of data (including at least the value of the lower limit price of management data) and quantity (however, the quantity value is an integer value of 1 or more). A second storage means for storing and a bid data table capable of storing a plurality of bid data (data including at least an ID, a maximum bid price, and a quantity (however, the quantity value is an integer value of 1 or more)) Third storage means for storing, fourth storage means for storing the winning bid price of the auction, and a fifth storing the received amount (amount of money corresponding to the right to receive the seller of the auction among the winning bid prices). Storage means, sixth storage means for storing the acquisition amount (the amount of money for the acquisition right of the auction operator among the successful bid prices), and the following three means: (1) the second Rearrangement in which the exhibition data in the storage means table of the storage means is sorted in ascending order of the value of the lowest bid price, and the bid data in the bid data table of the third storage means is sorted in order of the highest bid price value. Means, (2) on the basis of the highest bid price and quantity of the lowest accepted bid price and quantity and bid data of exhibition data sorted by the sorting means, a maximum of n (but to meet the S _n ≦ B _n, the The sorted exhibition data quantity values are set to q1, q2,..., Qr in order from the top, and the lowest successful bid price values of the sorted exhibition data are arranged in order from the top and for each quantity value of the exhibition data. _{S 1, S 2, ...,} S q1, S q1 + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, S q1 + q2 + 2, ..., and _{S q1 + q2 + ... + qr} , from the beginning the value of the quantity of the sorted bid data order t1, t2, ..., and tu, B ₁ value of the highest bid price bid data to which the side-by-side are re listed from top by the value of the quantity of and the bid data sequentially, _{2, ..., B t1, B} t1 + 1, B t1 + 2, ..., B t1 + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , and q1 + q2 + ... + qr = i, and t1 + t2 + ... + tu = j, n is present N detection means for detecting the range of n in the case of 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n in the absence of n being n = 0, and (3) detected by the n detection means Based on n, at least the following four conditions; (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3-3) P ≧ B _{n + 1} , (3-4 ) P is an arbitrary value (provided that (3-1) is excluded when n = 0, (3-2) is excluded when S _{n + 1} does not exist, and (3) when B _{n + 1} does not exist. -3) is excluded. A bid price determination means that at least includes a bid price determination means for inputting the determined successful bid price into the fourth storage means, and creating the exhibition data or sending the exhibition data to the auction apparatus. Received from the network-connected exhibition data creation device, the value of the lowest successful bid price of the created or received exhibition data, the limit value of the management data of the first storage means, and the management data of the first storage means And when the value of the lowest successful bid price is not more than the limit value and exceeds the value of the lower limit price, the exhibition data is stored in the exhibition data table of the second storage means. Create or enter the listing means to be entered in and the data you want to receive (at least including ID, maximum bid price and quantity (however, the quantity value is an integer value of 1 or more)) At least receiving request means for receiving the received data from the auction apparatus connected to the auction apparatus via the network, the management data being previously input to the first storage means, and the second storage The exhibition data table is preliminarily input to the means, zero or more of the exhibition data is preliminarily input to the exhibition data table of the second storage means, the bid data table is preliminarily input to the third storage means, An auction device in which zero or more of the bid data is previously input to the bid data table of the third storage means to obtain the desired receipt data using the desired receipt means; and arbitrary R pieces of the exhibition data (However, R is an arbitrary integer satisfying 1 ≦ R ≦ Q, and Q is the quantity of the desired data received in the acquisition step. And the following four steps for each of the created R pieces of exhibition data: (1) Set the ID value of the desired receipt data acquired by the acquisition step to the ID of the exhibition data A step, (2) a step of setting a lower limit price value of the management data of the first storage means to the lowest successful bid price of the exhibition data, and (3) the exhibition data is r-th (of the R pieces of exhibition data) However, when r is the exhibition data of 1 ≦ r ≦ R, the quantity of the exhibition data is Q _r (where Q _r is the R quantity of Q ₁ , Q _2). , ..., _{Q R,} and r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R is, each takes a value of 1 or more, _{and, Q 1 + Q 2 + ...} + Q R = Q , Q is the desired receipt received in the acquisition step (4) a step of inputting the exhibition data into the exhibition data table of the second storage means, and an arbitrary U number of bid data ( However, U is an arbitrary integer satisfying 1 ≦ U ≦ Q, and Q is the value of the quantity of desired received data acquired in the acquisition step), and for each of the generated U bid data The following four steps; (1) a step of setting the ID value of the desired receipt data acquired by the acquisition step in the ID of the bid data; and (2) the first bid price for the highest bid price of the bid data. A step of setting a sum value of the limit value of the management data in the storage means and the highest bid price value of the desired received data acquired in the acquisition step; (3) the bid data includes the U bid data Uth ( And, u is, 1 ≦ u ≦ U, in the case of bid data of any integer) satisfying, _{Q u} (although the quantity of the bid data, _{Q u} is the U quantities _Q 1, _{Q 2} ,..., Q _U , and the U quantity Q ₁ , Q ₂ ,..., Q _U has a value of 1 or more, and Q ₁ + Q ₂ + ... + Q _U = Q And (4) the bid data is input to the bid data table of the third storage means. A bidding step, a desired bid receiving process, a winning bid price inputting step of inputting a winning bid price into the fourth storage means using the pricing means, and a winning bid price of the fourth storage means And the limit value of the management data in the first storage means If the value of the winning bid is less than or equal to the limit, the value of the winning bid is input to the fifth storage means, and the value of the winning bid exceeds the limit A receiving amount input step of inputting the value of the limit amount into the fifth storage means, and the receipt of the fifth storage means from the winning bid value of the fourth storage means into the sixth storage means. A profit adjustment process comprising: an acquisition amount input step for inputting a value obtained by subtracting the value of the amount of money;

The invention according to claim 3 is an auction apparatus that manages one unit or a plurality of units of an auction in which a prize provided by a business operator is an exhibit, and management data (for the unit) First storage means for storing at least the ID of the auction business operator and the limit of the winning bid price of the auction; and exhibition data (ID and lowest winning bid price (however, the lowest winning bid value is the above-mentioned value). An exhibition data table capable of storing a plurality of data including at least a limit value of management data in one storage means) and a quantity (however, the quantity value is an integer value of 1 or more). Bids capable of storing a plurality of second storage means for storing and bid data (data including at least an ID, a maximum bid price, and a quantity (where the value of the quantity is an integer value of 1 or more)). A third storage means for storing the data table, a fourth storage means for storing the winning bid price of the auction, and a received amount (amount of money corresponding to the right to receive by the seller of the auction of the winning bid price). A fifth storage means for storing, a sixth storage means for storing the acquisition amount (amount of money for the acquisition right of the operator of the auction among the successful bid prices), and the following three means: (1) Rearrangement of the exhibition data in the exhibition data table of the second storage means in ascending order of the value of the lowest successful bid price, and rearrangement of the bid data in the bid data table of the third storage means in descending order of the value of the highest bid price maximum means, on the basis of the highest bid price and quantity of the bid data with the lowest bid price and quantity of the exhibitor data rearranged by (2) the sorting unit, satisfy S _n ≦ B _n n (where q1, q2,..., qr are the quantity values of the sorted exhibition data in order from the top, and the lowest winning bid value of the sorted exhibition data is in order from the top and _{S 1, S 2} side-by-side by the value of the _{quantity, ..., S q1, S q1} + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, S q1 + q2 + 2, ..., S q1 + q2 + ... + qr and, the sorted of bid data quantity t1, in order from the beginning the value of t2, ..., and tu, the value of the highest bid price bid data to which the side-by-side are re listed from top by the value of the quantity of and the bid data sequentially B _1, B _{2, ..., B t1, B t1 + 1,} B t1 + 2, ..., B t1 + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , q1 + q2 + + Qr = i, t1 + t2 +... + Tu = j, the range of n when n exists is 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n when n does not exist is n = 0) N detection means to detect, (3) at least the following four conditions based on n detected by the n detection means: (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3-3) P ≧ B _{n + 1} , (3-4) P is an arbitrary value (however, when n = 0, (3-1) is excluded, and when S _{n + 1} does not exist, (3 -2) is excluded, and if B _{n + 1} does not exist, any P satisfying all of (3-3) is determined as the winning price of the auction, and the determined winning price is stored in the fourth memory. Bid price determination means for inputting to the means, and at least pricing means, and the value A winning bid price input step of inputting a winning bid price into the fourth storage means using a keying means; a value of the winning bid price of the fourth storage means; and a limit value of the management data of the first storage means; If the value of the winning bid is less than or equal to the limit, the value of the winning bid is input to the fifth storage means, and the value of the winning bid exceeds the limit A receiving amount input step of inputting the value of the limit amount into the fifth storage means, and the receipt of the fifth storage means from the winning bid value of the fourth storage means into the sixth storage means. Profit adjustment processing is performed, which includes an acquisition amount input step of inputting a value obtained by subtracting the amount of money.

The invention according to claim 4 is an auction apparatus that manages one unit or a plurality of units of an auction in which prizes provided by a business operator are exhibited, and management data (for the unit) Data including at least the ID of the auction business operator, the limit amount of the winning bid price of the auction, and the lower limit price of the lowest winning bid price of the auction (however, the value of the lower limit price is less than the limit value) ) And storage data (ID and minimum bid price (however, the value of the minimum bid price is equal to or less than the limit value of the management data of the first storage means) and the first storage means Exhibition data table capable of storing a plurality of data (including at least the value of the lower limit price of management data) and quantity (however, the quantity value is an integer value of 1 or more). A second storage means for storing and a bid data table capable of storing a plurality of bid data (data including at least an ID, a maximum bid price, and a quantity (however, the quantity value is an integer value of 1 or more)) Third storage means for storing, fourth storage means for storing the winning bid price of the auction, and a fifth storing the received amount (amount of money corresponding to the right to receive the seller of the auction among the winning bid prices). Storage means, sixth storage means for storing the acquisition amount (the amount of money for the acquisition right of the auction operator among the successful bid prices), and the following three means: (1) the second Rearrangement in which the exhibition data in the storage means table of the storage means is sorted in ascending order of the value of the lowest bid price, and the bid data in the bid data table of the third storage means is sorted in order of the highest bid price value. Means, (2) on the basis of the highest bid price and quantity of the lowest accepted bid price and quantity and bid data of exhibition data sorted by the sorting means, a maximum of n (but to meet the S _n ≦ B _n, the The sorted exhibition data quantity values are set to q1, q2,..., Qr in order from the top, and the lowest successful bid price values of the sorted exhibition data are arranged in order from the top and for each quantity value of the exhibition data. _{S 1, S 2, ...,} S q1, S q1 + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, S q1 + q2 + 2, ..., and _{S q1 + q2 + ... + qr} , from the beginning the value of the quantity of the sorted bid data order t1, t2, ..., and tu, B ₁ value of the highest bid price bid data to which the side-by-side are re listed from top by the value of the quantity of and the bid data sequentially, _{2, ..., B t1, B} t1 + 1, B t1 + 2, ..., B t1 + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , and q1 + q2 + ... + qr = i, and t1 + t2 + ... + tu = j, n is present N detection means for detecting the range of n in the case of 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n in the absence of n being n = 0, and (3) detected by the n detection means Based on n, at least the following four conditions; (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3-3) P ≧ B _{n + 1} , (3-4 ) P is an arbitrary value (provided that (3-1) is excluded when n = 0, (3-2) is excluded when S _{n + 1} does not exist, and (3) when B _{n + 1} does not exist. -3) is excluded. A bid price determination means that at least includes a bid price determination means for inputting the determined successful bid price into the fourth storage means, and creating the exhibition data or sending the exhibition data to the auction apparatus. Received from the network-connected exhibition data creation device, the value of the lowest successful bid price of the created or received exhibition data, the limit value of the management data of the first storage means, and the management data of the first storage means And when the value of the lowest successful bid price is not more than the limit value and exceeds the value of the lower limit price, the exhibition data is stored in the exhibition data table of the second storage means. Create or enter the listing means to be entered in and the data you want to receive (at least including ID, maximum bid price and quantity (however, the quantity value is an integer value of 1 or more)) A receiving request means for receiving the desired receiving data from a receiving request data creating apparatus connected to the auction device via a network, and obtaining the desired receiving data using the receiving request means; and the exhibition data R (where R is an arbitrary integer satisfying 1 ≦ R ≦ Q, and Q is the value of the quantity of the desired received data obtained in the obtaining step), and the created R pieces For each of the exhibition data, the following four steps; (1) setting the ID value of the desired receipt data acquired in the acquisition step to the ID of the exhibition data; (2) the lowest bid for the exhibition data A step of setting the value of the lower limit price of the management data of the first storage means to the price, (3) the exhibition data is r-th of the R exhibition data (where r is 1 ≦ r R, in the case of exhibition data any integer) satisfying, _{Q r} (provided that the quantity of the exhibition data, _{Q r} is the R Quantity _{Q 1, Q 2, ...,} Q R, of the r a second quantity, R number of quantities _{Q 1, Q 2, ...,} Q R are each take one or more values, _and an arbitrary integer satisfying _{Q 1 + Q 2 + ... +} Q R = Q, the, Q And (4) a step of inputting the exhibition data into the exhibition data table of the second storage means, Create arbitrary U pieces of the bid data (where U is an arbitrary integer satisfying 1 ≦ U ≦ Q, and Q is the value of the quantity of desired received data acquired in the acquisition step) The following four steps for each of U bid data (1) a step of setting the ID value of the desired received data acquired by the acquisition step in the ID of the bid data, and (2) a limit of the management data of the first storage means to the highest bid price of the bid data. A step of setting a sum value of a sum value and a value of the highest bid price of the received desired data acquired in the acquisition step; (3) the bid data is the u-th (where u Is a bid data of 1 ≦ u ≦ U, and Q _u (where Q _u is the U quantity Q ₁ , Q ₂ ,..., Q _{U is} the u-th quantity, and U quantities Q ₁ , Q ₂ ,..., Q _U each take a value of 1 or more and satisfy Q ₁ + Q ₂ +... + Q _U = Q. Arbitrary integer, Q is the received rare A bid step for performing a step of setting (a value of the quantity of data) and (4) a step of inputting the bid data into the bid data table of the third storage means, A winning bid price input step of inputting a winning bid price into the fourth storage means using an attaching means; a value of the winning bid price of the fourth storage means; and a limit value of the management data of the first storage means; If the value of the winning bid is less than or equal to the limit, the value of the winning bid is input to the fifth storage means, and the value of the winning bid exceeds the limit A receiving amount input step of inputting the value of the limit amount into the fifth storage means, and the receipt of the fifth storage means from the winning bid value of the fourth storage means into the sixth storage means. From the acquisition amount input step to input the value minus the amount of money, and The profit adjustment process is executed.

As described above, according to the present invention, it becomes possible for an operator to control the value of a prize in an auction that deals with prizes, and the accuracy thereof is considerably higher. This has the effect of reducing the risk, and has the effect of increasing the sweepstakes campaign effect by using an auction-linked sweepstakes campaign.

Hereinafter, the best mode for carrying out the present invention will be described with reference to the drawings.

First, the overall configuration of the present invention will be briefly described with reference to FIG. FIG. 1 is a diagram showing the classification of the present invention.

In the present invention, in order to enable a business operator to control the value of prizes in an auction that deals with prizes, two control means are roughly provided. One is a means for adding listings, and the other is a means for dividing profits.

As for the means to add an auction, it is necessary to know how much the auction must be added in order to control the value of prizes. Means for utilizing the information and information regarding the bid and means for utilizing the bid information to be added are provided. The present invention classified by these means is hereinafter referred to as a first profit adjustment method, a second profit adjustment method, and a third profit adjustment method. The first and second inventions are specific examples of the first profit adjustment method, the third to twelfth inventions are specific examples of the second profit adjustment method, and the thirteenth to sixteenth inventions. Is a specific example of the third profit adjustment method.

On the other hand, the present invention classified by means for dividing profit is hereinafter referred to as a fourth profit adjustment method. The seventeenth and eighteenth aspects of the present invention are specific examples of the fourth profit adjustment method. (The inventions described in claims 1 and 2 and inventions described in claims 3 and 4 can be referred to in the descriptions of the seventeenth and eighteenth aspects of the present invention described later).

Hereinafter, the first to fourth profit adjustment methods and the individual inventions will be described in more detail.

FIG. 2 is a block diagram showing an example of the configuration of the auction apparatus used in the first present invention.

The auction apparatus 1000 is an information processing apparatus such as a personal computer, a workstation, a network-connectable server apparatus, and a dedicated apparatus, and manages one or a plurality of units of auctions using prizes provided by businesses. Auction equipment. The auction apparatus 1000 includes a first storage unit 1100, a second storage unit 1200, a third storage unit 1300, a fourth storage unit 1400, and a pricing unit 1700 for each auction. The first storage means 1100 is means for storing management data 1110 including at least the ID 1111 of the business operator of the auction and the limit price 1112 of the successful bid price of the auction, and the second storage means 1200 is an exhibition data table. 1210, the third storage unit 1300 is a unit for storing the bid data table 1310, and the fourth storage unit 1400 is a unit for storing the successful bid price 1410 of the auction. Means 1700 is means having at least rearrangement means 1710, n detection means 1720, and successful bid price determination means 1730.

Next, a configuration example of the exhibition data table 1210 will be described with reference to FIG. FIG. 3 is a diagram showing a configuration example of the exhibition data table used in the first present invention.

FIG. 3 shows a state in which N pieces of exhibition data 1211 to 121N have already been input to the exhibition data table 1210. The exhibition data table 1210 is a file capable of storing a plurality of exhibition data, and each of the exhibition data 1211 to 121N includes, as data elements, an ID 1210a, a lowest successful bid price 1210b and a quantity 1210c (however, the value of the quantity 1210c is 1 or more). Data including at least an integer value).

Next, a configuration example of the bid data table 1310 will be described with reference to FIG. FIG. 4 is a diagram showing a configuration example of a bid data table used in the first present invention.

FIG. 4 shows a state in which M pieces of bid data 1311 to 131M have already been input to the bid data table 1310. The bid data table 1310 is a file that can store a plurality of bid data. Each of the bid data 1311 to 131M includes an ID 1310a, a maximum bid price 1310b, and a quantity 1310c as data elements (however, the value of the quantity 1310c is 1 or more). Data including at least an integer value).

The ID is data that can identify each participant of the auction, and the lowest winning bid price is that the winning bid of the exhibition data cannot be made when the winning bid price is determined to be less than the lowest winning bid price. The highest bid price is data that means that it is impossible to make a successful bid on the bid data when the winning bid price is determined to be a price exceeding the highest bid price. For example, when the winning bid price is 100 yen, the exhibition data with the lowest winning bid price of 101 yen will not be awarded, and the bid data with the highest bid price of 99 yen will not be awarded.

The sorting unit 1710 shown in FIG. 2 sorts the exhibition data 1211 to 121N in the exhibition data table 1210 of the second storage unit 1200 in ascending order of the lowest successful bid price 1210b, and the bid data of the third storage unit 1300. This is means for rearranging the bid data 1311 to 131M in the table 1310 in descending order of the highest bid price 1310b.

The n detecting means 1720 shown in FIG. 2 is based on the lowest bid price 1210b and quantity 1210c of the exhibition data 1211 to 121N sorted by the sorting means 1710 and the highest bid price 1310b and quantity 1310c of the bid data 1311 to 131M. The maximum _n satisfying S _n ≦ B _n (however, the value of the quantity 1210c of the sorted exhibition data 1211 to 121N is set to q1, q2,..., Qr in order from the top, and the sorted exhibition data _{S 1, S 2} side by side, the lowest winning bid value of 1210b of 1211~121N from the beginning by the value of the quantity 1210c of and the exhibition data in the _{order, ..., S q1, S q1} + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, _{S q1 + q2 + 2, ...} , and _{S q1 + q2 + ... + qr} , is the sort The value of the quantity 1310c of the bid data 1311 to 131M is t1, t2,..., Tu in order from the top, and the highest bid price 1310b of the sorted bid data 1311 to 131M is sequentially from the top and the quantity of the bid data. _{B 1,} B ₂ are arranged by a value of _{1310c, ..., B t1, B} t1 + 1, B t1 + 2, ..., B t1 + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , and q1 + q2 + ... + qr = i, t1 + t2 + ... + Tu = j, the range of n when n exists is 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n when n does not exist is n = 0).

The successful bid price determination unit 1730 shown in FIG. 2 is based on n detected by the n detection unit 1720, and at least the following four conditions: (1) S _n ≦ P ≦ B _n , (2) P ≦ S _{n + 1} , (3) P ≧ B _{n + 1} , (4) P is an arbitrary value (provided that (1) is excluded when n = 0, (2) is excluded when S _{n + 1} does not exist, and B _{n + 1} If P does not exist, any P satisfying (3) is determined as the winning bid price of the auction, and the determined winning bid price is input to the fourth storage means 1400.

The winning bid price may be determined to any value as long as the above condition is satisfied. For instance, a method of either cheap value of the winning bid _{B n} or _{S n + 1,} that is, _{if B n} and the _{S n + 1} are both present is determined either cheaper value of _{B n} or _{S n + 1,} the _{B n} If there is S _{n + 1} is not present to determine the B _n, method of, determining the S _{n + 1} if there is no present S _{n + 1} B n is possible because the above conditions are satisfied.

When all of S _n , B _n , S _{n + 1} , and B _{n + 1} do not exist, it is possible to determine the successful bid price to an arbitrary value. For example, in such a case, it is possible to determine the winning bid price as 0. Alternatively, it is also possible to further include a start price in the elements of the management data 1110 shown in FIG. 1 and input a value in advance to the start price of the management data 1110 to determine the winning bid price as the start price value of the management data 1110. It is. Note that the successful bid price in the present invention includes not only the price at the time of the successful bid decision but also a provisional price during the auction period and a rough price when no successful bid exists (when n is 0).

Next, the profit adjustment method in the present invention will be described. First, FIG. 5 is a conceptual diagram for explaining a conventional price adjustment method.

In FIG. 5-a, three market values with different values by one unit are arranged in order of A, B, and C in ascending order of value. If a business operator determines that a prize with a market value A can be provided, a prize with a market value B can be provided, or a prize with a market value C cannot be provided, for legal or other regulations, The market value B is defined as the limit amount.

As a conventional price adjustment method in an auction, there is a method of setting a value that can be called a bid price limit. The winning bid price limit is a price at which a successful bid is immediately determined using the winning bid price as the winning bid price without waiting for the end date of the auction when the bidder bids at the highest bid price equal to or higher than the winning bid price limit. This is a method that originally provides sellers or early bidders with a reduction in transaction time, which typically takes 1-2 weeks. However, a problem arises when such a price adjustment method is used in a gift transaction. FIG. 5B is a conceptual diagram showing a state immediately after a successful bid in an auction in which a winning bid limit is set.

In FIG. 5B, three exhibitions A to C on the left and seven bids A to G on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used. At this time, the winning bid price of the winning bids A to C is the winning bid price limit. On the other hand, if we estimate the market value when these exhibits are usually purchased, it can be considered that the price is A or B, or a higher value if the transaction size at this auction is small. The economic benefits (value of prizes) provided to exhibitors and successful bidders when these exhibits are prizes will be described with reference to FIG.

The portion indicated by hatching on the left side of the figure is the economic benefit provided to the seller, and the portion indicated by hatching on the right is the economic benefit provided to the successful bidder. Also, although not shown, if there is a person who has received the exhibit without exhibiting at this time, the economic benefit provided to that person is the sum of the economic benefits provided to the seller and the successful bidder .

Even if the limit is set as the value of the winning bid limit, the economic profit to be provided exceeds the limit. In other words, this price adjustment method cannot achieve the purpose of controlling the economic benefits to be provided and performing sweepstakes without touching regulations.

By using the profit adjustment method in the present invention, it is possible to control the economic profit to be provided. FIG. 6 is a conceptual diagram illustrating a first profit adjustment method in the present invention.

In FIG. 6A, one exhibition A on the left and four bids A to D on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used. In this case, a price determination method is adopted in which the successful bid price is set to a lower value of either B _n or S _{n + 1} . In addition, assuming that the transaction period of this auction has enough time to complete the request and that the transaction scale is as large as possible within the transaction period, the contract price determined by this auction and the market price Assume that the error is smaller.

First, a limit amount is set by converting the maximum profit amount provided to the winner of the sweepstakes through the auction into a price per exhibit. The first profit adjustment method adds one exhibitor in the name of a business operator who sets a limit amount to the lowest successful bid price in the state of FIG. The subsequent state is shown in FIG. In FIG. 6B, the first profit adjustment method determines that the winning bid price exceeds the limit amount, and further adds one exhibitor in the name of the operator who sets the limit amount to the lowest winning bid price. The subsequent state is shown in FIG. In FIG. 6-c, the first profit adjustment method determines that the winning bid price is the same as the limit amount, and does not add an exhibition under the name of the business operator.

The first profit adjustment method does not suppress only the apparent successful bid price as in the conventional method, but also has an effect of controlling the market value at the same time. Also, with this profit adjustment method, it is possible to extend the transaction time until the request is completed, and it is possible to provide a product that satisfies the request. This is the same as the assumption set earlier. Eventually, the error between the winning bid price and the market price in the auction using this profit adjustment method is reduced as the auction progresses. That is, from the beginning of the auction, the successful bid price at this auction can be regarded as the market value, and the successful bid price can be compared with the limit.

In FIG. 6, a limit is set for the lowest successful bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limit price may be set for the lowest successful bid price. In FIG. 6, the number of exhibitions added from the comparison between the successful bid price and the limit amount to the next comparison is 1, but the number of exhibitions added is an arbitrary number of 1 or more. It does not matter.

The first aspect of the present invention that realizes the concept of the first profit adjustment method described above is an auction apparatus 1000, in which management data 1110 is preliminarily input to the first storage unit 1100 and the second storage unit 1200 is exhibited. The data table 1210 is inputted in advance, zero or more exhibition data is inputted in advance in the exhibition data table 1210 of the second storage means 1200, the bid data table 1310 is inputted in advance in the third storage means 1300, and the third storage. The auction apparatus 1000 in which zero or more bid data is input in advance in the bid data table 1310 of the means 1300,

The exhibition data is created, the value of ID 1111 of the management data 1110 of the first storage means 1100 is set in the ID 1210a of the exhibition data, and S (where S is S ≦ L, L is set to a value of the limit 1112 of the management data 1110 of the first storage means 1100, and Q is set in the quantity 1210c of the exhibition data (where Q is Q ≧ 1, The exhibition data is input to the exhibition data table 1210 of the second storage means 1200, and the bidding price is input to the fourth storage means 1400 using the pricing means 1700. The step of comparing the value of the successful bid price 1410 of the fourth storage means 1400 with the value of the limit amount 1112 of the management data 1110 of the first storage means 1100, The value of the winning bid 1410 of stage 1400 performs the benefit adjustment process is repeated until the amount not exceeding the value of the limit 1112 of the management data 1110 of the first storage unit 1100, an invention called.

FIG. 7 is a process diagram showing an example of the profit adjustment process in the first present invention.

First, the exhibition data is created (step S1), the value of ID 1111 of the management data 1110 of the first storage means 1100 is set to the ID 1210a of the exhibition data (step S2), and the lowest successful bid price 1210b of the exhibition data is set. The value of the limit 1112 of the management data 1110 of the first storage means 1100 is set (step S3), the quantity 1210c of the exhibition data is set to 1 (step S4), and the exhibition data is stored in the second storage means 1200. It inputs into the exhibition data table 1210 (step S5). Next, the successful bid price is input to the fourth storage means 1400 using the pricing means 1700 (step S6), the value of the successful bid price 1410 of the fourth storage means 1400 and the management data 1110 of the first storage means 1100. When the value of the successful bid price 1410 exceeds the value of the limit amount 1112 (step S7 / Y), the process returns to step S1, and when it does not exceed (step S7 / N), the process ends.

Although not shown in the figure, before starting the processing of FIG. 7, the value of the successful bid price 1410 of the fourth storage unit 1400 is compared with the value of the limit 1112 of the management data 1110 of the first storage unit 1100 to make a successful bid. The process of FIG. 7 may be started when the value of the price 1410 exceeds the value of the limit amount 1112, and may not be started when it does not exceed the value. Further, if it is clear that the winning bid price has not been input to the fourth storage means 1400, the winning bid price is input to the fourth storing means 1400 using the pricing means 1700 before the processing of FIG. When the value of the successful bid price 1410 in the fourth storage means 1400 is compared with the value of the limit 1112 of the management data 1110 in the first storage means 1100, and the value of the successful bid price 1410 exceeds the value of the limit 1112 Alternatively, the processing of FIG. 7 may be started, and if not exceeded, the processing may not be started.

The n detecting means 1720 may detect using any method as long as n can be detected. For example, a method as shown in FIG. 8 can be used. FIG. 8 is a processing diagram showing an example of the n detecting means used in the first present invention.

First, a detection variable n and working variables r, qr, S _n , u, tu, B _n are prepared, and the values of the variables n, r, qr, u, tu are initialized to 0 ( Step S1). Next, the _Sn acquisition process is started (step S2). S _n acquisition processing, first, acquires the r + 1-th exhibition data from the beginning of the listings data 1211~121N rearranged by rearranging means 1710 (step S21), and the exhibition data obtained by the step S21 is a NULL value The case (step S22 / Y) ends. If it is not a NULL value (step S22 / N), a value obtained by adding 1 to the value of the variable r is input to the variable r, the value of the quantity 1210c of the exhibition data is input to the variable qr, and the lowest successful bid price 1210b of the exhibition data is entered. enter a value for the variable _{S n} (step S23). When the _Sn acquisition process is completed, the _Bn acquisition process is started (step S3). In the B _n acquisition process, first, u + 1-th bid data from the top of the bid data 1311 to 131M rearranged by the rearranging means 1710 is acquired (step S31), and the bid data acquired in step S31 is a NULL value. The case (step S32 / Y) ends. If the value is not NULL (step S32 / N), a value obtained by adding 1 to the value of the variable u is input to the variable u, the value of the quantity 1310c of the bid data is input to the variable tu, and the highest bid price 1310b of the bid data is set. A value is input to the variable B _n (step S33). Upon completion of the B _n acquisition process, the value of the variable S _n is to check is less than the value of the variable B _n, if not less than the value of the variable B _n (step S4 / N) is finished. _If the value is less than or _{equal to} the value of the variable _Bn (step S4 / Y), a value obtained by adding 1 to the value of the variable n is input to the variable n, and a value obtained by subtracting 1 from the value of the variable qr is input to the variable qr. A value obtained by subtracting 1 from the value of the variable tu is input to the variable tu (step S5). When step S5 is completed, it is confirmed whether the value of the variable qr exceeds 0. If it exceeds (step S6 / Y), it is checked whether the value of the variable tu exceeds 0. If it exceeds (step S7 / Y), step S5 is performed. Return to. If it does not exceed 0 in step S6 (step S6 / N), the above-described _Sn acquisition process is executed (step S8), and it is confirmed whether the value of the variable tu exceeds 0. If it exceeds (step S9 / Y), Return to step S4. In step S7 and step S9, when 0 is not exceeded (step S7 / N or step S9 / N), the above _Bn acquisition process is executed (step S10), and the process returns to step S4.

The value input to the variable n at the end of the above process is the value of n.

Of the above-mentioned S _n , B _n , S _{n + 1} , B _{n + 1} , regarding the method for acquiring data necessary for determining the winning bid price, if such data can be acquired (if there is no data) Any method (if it can be recognized that it does not exist) may be used. For example, a method as shown in FIG. 9 can be used. FIG. 9 is a processing diagram illustrating an example of acquiring _Sn and _{Sn + 1} .

First, the variable S _n for acquisition, the variable S _{n + 1,} and the variables r and i for work are prepared, the values of the variables S _n and S _{n + 1} are initialized with NULL values, and the values of the variables r and i are respectively set. It is initialized to 0 (step S1). Next, it is confirmed whether the value of n detected by the n detecting means 1720 is 1 or more. If it is 1 or more (step S2 / Y), the exhibition data 1211 to 121N rearranged by the rearranging means 1710 is displayed. The r + 1th exhibition data from the beginning is acquired (step S3), a value obtained by adding 1 to the value of the variable r is input to the variable r, and a value obtained by adding the value of the exhibition data quantity 1210c to the value of the variable i i is input (step S4). Upon completion of the step S4, the value of the variable i is sure that is greater than or equal to the value of n, where n is greater than or equal to the value (step S5 / Y) is the value of the lowest bid price 1210b of exhibition data in the variable S _n If it is input (step S6) and is not greater than the value of n (step S5 / N), the process returns to step S3. When step S6 is completed, it is confirmed whether the value of the variable i exceeds the value of n. When the value of n is exceeded (step S7 / Y), the value of the lowest successful bid price 1210b of the exhibition data is input to the variable S _{n + 1} ( Step S8) ends. When the value of n is not 1 or more at step S2 (step S2 / N) and when the value of variable i does not exceed the value of n at step S7 (step S7 / N), the values are rearranged by the rearranging means 1710. The (r + 1) th exhibition data from the top of the exhibition data 1211 to 121N is acquired (step S9). After the execution of step S9, it is confirmed whether the exhibition data acquired in step 9 is a NULL value. If it is not a NULL value (step S10 / N), the lowest successful bid price 1210b of the exhibition data acquired in step 9 is set to the variable _{Sn + 1.} Is entered (step S11), and the process ends. If it is a NULL value (step S10 / Y), the process ends.

The values input to the variable _Sn and the variable _{Sn + 1} at the end of the above process are the values of _Sn and _{Sn + 1} , respectively (a null value means not existing).

The same applies to the method of acquiring B _n and B _{n + 1} , and for example, a method as shown in FIG. 10 can be used. FIG. 10 is a processing diagram illustrating an example of obtaining B _n and B _{n + 1} .

First, a variable B _n for acquisition, a variable B _{n + 1,} and variables u and j for work are prepared, the values of the variables B _n and B _{n + 1} are initialized with NULL values, and the values of the variables u and j are respectively set. It is initialized to 0 (step S1). Next, it is confirmed whether the value of n detected by the n detecting means 1720 is 1 or more. If it is 1 or more (step S2 / Y), the bid data 1311 to 131M sorted by the sorting means 1710 are displayed. The u + 1th bid data from the beginning is acquired (step S3), a value obtained by adding 1 to the value of the variable u is input to the variable u, and the value obtained by adding the value of the quantity of bid data 1310c to the value of the variable j j is input (step S4). When step S4 is completed, it is confirmed whether the value of the variable j is equal to or greater than the value of n. If it is equal to or greater than the value of n (step S5 / Y), the value of the highest bid price 1310b of the bid data is set to the variable B _n . If it is input (step S6) and is not greater than the value of n (step S5 / N), the process returns to step S3. When step S6 is completed, it is confirmed whether the value of variable j exceeds the value of n. If it exceeds n (step S7 / Y), the value of maximum bid price 1310b of the bid data is input to variable B _{n + 1} ( Step S8) ends. When the value of n is not 1 or more in step S2 (step S2 / N) and when the value of variable j does not exceed the value of n in step S7 (step S7 / N), the values are rearranged by the rearranging means 1710. The u + 1th bid data from the top of the bid data 1311 to 131M is acquired (step S9). After execution of step S9, it is confirmed whether or not the bid data acquired in step 9 is a NULL value. If the bid data is not a NULL value (step S10 / N), the highest bid price 1310b of the bid data acquired in step 9 is set in the variable B _{n + 1.} Is entered (step S11), and the process ends. If it is a NULL value (step S10 / Y), the process ends.

The values input to the variable B _n and the variable B _{n + 1} at the end of the above process are the values of B _n and B _{n + 1} , respectively (a null value means not existing).

In the first aspect of the invention described above, newly created exhibition data is input to the exhibition data table 1210. The exhibition data table 1210 has an ID 1210a equal to the value of the operator ID 1111 and a minimum value less than or equal to the value of the limit amount 1112. When one or more exhibition data having the winning bid price 1210b is input in advance, it is possible to add an exhibition by increasing the quantity 1210c of the exhibition data.

The second aspect of the present invention is the auction apparatus 1000 used in the first aspect of the present invention, and further includes the value of ID 1111 of the management data 1110 of the first storage unit 1100 in the exhibition data table 1210 of the second storage unit 1200. An auction apparatus 1000 in which one or more exhibition data having an equal ID 1210a and a minimum successful bid price 1210b equal to or less than the limit 1112 of the management data 1110 of the first storage unit 1100 is preliminarily input,

The lowest successful bid that is equal to or less than the value of ID 1210a equal to the value of ID 1111 of the management data 1110 of the first storage means 1100 from the exhibition data table 1210 of the second storage means 1200 and the limit 1112 of the management data 1110 of the first storage means 1100 Select at least one exhibition data having the price 1210b, and add Q to the value of the quantity 1210c of the selected exhibition data, where Q is an arbitrary integer satisfying Q ≧ 1. The selected exhibition data quantity 1210c is input, the bidding price is input to the fourth storage means 1400 using the pricing means 1700, the value of the successful bid price 1410 in the fourth storage means 1400 and the first storage means 1100. The step of comparing the value of the limit amount 1112 of the management data 1110 with the successful bid price 141 of the fourth storage means 1400 Value executes the benefit adjustment process is repeated until the amount not exceeding the value of the limit 1112 of the management data 1110 of the first storage unit 1100, an invention called.

FIG. 11 is a processing diagram showing an example of profit adjustment processing according to the second aspect of the present invention.

First, the exhibition data whose ID 1210a is equal to the value of ID 1111 of the management data 1110 of the first storage means 1100 and whose lowest successful bid price 1210b is equal to or less than the value of the limit 1112 of the management data 1110 of the first storage means 1100 is listed. The exhibition data table 1210 of the storage means 1200 of No. 2 is searched (step S1). Among the exhibition data obtained by the search, one exhibition data having the largest lowest successful bid price 1210b is selected (step S2). A value obtained by adding 1 to the value of the selected exhibition data quantity 1210c is input to the selected exhibition data quantity 1210c (step S3). Next, the successful bid price is input to the fourth storage means 1400 using the pricing means 1700 (step S4), the value of the successful bid price 1410 of the fourth storage means 1400 and the management data 1110 of the first storage means 1100. Is compared with the value of the limit amount 1112, and if the value of the successful bid price 1410 exceeds the value of the limit amount 1112 (step S 5 / Y), the process returns to step S 1, and if not exceeded (step S 5 / N), the process ends.

Although not shown, before the start of the process of FIG. 11, the value of the successful bid price 1410 of the fourth storage unit 1400 is compared with the value of the limit 1112 of the management data 1110 of the first storage unit 1100 to make a successful bid. The processing of FIG. 11 may be started when the value of the price 1410 exceeds the value of the limit amount 1112, and may not be started when the value does not exceed the limit amount 1112. Further, if it is clear that the winning bid price is not input to the fourth storage means 1400, the winning bid price is input to the fourth storing means 1400 using the pricing means 1700 before the start of the processing of FIG. When the value of the successful bid price 1410 in the fourth storage means 1400 is compared with the value of the limit 1112 of the management data 1110 in the first storage means 1100, and the value of the successful bid price 1410 exceeds the value of the limit 1112 Alternatively, the processing of FIG. 11 may be started, and if not exceeded, the processing may not be started.

Next, the second profit adjustment method will be described. In the first profit adjustment method described above, listings are added while confirming that the winning bid price is less than or equal to the limit by comparing the winning bid price with the limit. However, in the second profit adjustment method, the necessary number of listings can be collected in a lump without comparing and confirming by the method of calculating in advance the number of listings necessary for the winning bid price to be below the limit. Can be added. As illustrated in FIG. 12, the second profit adjustment method uses a method of detecting integers X, Y, and Q and adding an exhibition using the integer Q. FIG. 12 is a conceptual diagram illustrating a second profit adjustment method in the present invention.

In FIG. 12A, one exhibition A on the left and four bids A to D on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used. In this case, a price determination method is adopted in which the successful bid price is set to a lower value of either B _n or S _{n + 1} .

First, in the state of FIG. 12A, the second profit adjustment method detects the number of listings having the lowest winning bid price below the limit amount as X, while the number of bids having the highest bid price exceeding the upper limit price. Is detected as Y. This is shown in FIG. As shown in FIG. 12B, the second profit adjustment method detects 1 as X and 2 as Y. Next, as shown in FIG. 12C, the second profit adjustment method uses X and Y to detect 2 which is the value of Y−X + 1 as Q, and sets a limit amount to the lowest winning bid price. Add Q (two) listings under the name of the operator. In the second profit adjustment method, the winning bid price is suppressed below the limit by such a method.

In FIG. 12, a limit is set for the lowest winning bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limiting price may be set for the lowest winning bid price. In FIG. 12, the minimum required listing for the successful bid price to be below the limit amount is added, but it may be configured to add more listings. For example, the method of detecting the number of listings having the lowest winning bid price that is less than the limit amount as X guarantees that the value of X is equal to or less than the value of X detected by the method of FIG. The number of listings to be added will not be smaller than the minimum necessary number (because Y is constant when Q = Y−X + 1, Q will not decrease if X does not increase). In addition, the method of detecting the number of bids having the highest bid price equal to or greater than the limit amount as Y is added because the value of Y is guaranteed to be equal to or greater than the value of Y detected by the method of FIG. The number of listings will not be less than the minimum necessary number (because if Q is constant at Q = Y−X + 1, Q will not decrease if Y does not decrease). As in these examples, if more than the minimum necessary number of listings are added, such a method may be used. Other examples will be described later.

The third aspect of the present invention that realizes the concept of the second profit adjustment method described above is that the auction apparatus 1000 used in the first aspect of the present invention includes:

The next five X detection steps;

(1) Acquire the value of the limit amount 1112 of the management data 1110 of the first storage means 1100, search the exhibition data table 1210 of the second storage means 1200 and search for the lowest successful bid below the value of the acquired limit amount 1112 An X detection step of acquiring all the exhibition data having the price 1210b, calculating the sum of the values of the quantity 1210c of all the acquired exhibition data, and detecting the calculated sum as an integer X;

(2) The value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired, the search data table 1210 of the second storage means 1200 is searched, and the minimum value that does not satisfy the value of the acquired limit value 1112 An X detection step of acquiring all the exhibition data having the winning bid price 1210b, calculating a sum of values of the quantity 1210c of all the acquired exhibition data, and detecting the calculated sum as an integer X;

(3) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the exhibition data of the second storage unit 1200 The table 1210 is searched to obtain all the exhibition data having the lowest successful bid price 1210b equal to or less than the determined price, the sum of the values of the quantity 1210c of all the obtained exhibition data is calculated, and the value of the calculated sum is obtained. An X detection step for detecting as an integer X;

(4) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the exhibition data of the second storage unit 1200 The table 1210 is searched to obtain all the exhibition data having the lowest successful bid price 1210b that is less than the determined price, and the sum of the values of the quantity 1210c of all the obtained exhibition data is calculated, and the value of the calculated sum X detection step for detecting as an integer X,

(5) X detection step for detecting an arbitrary integer equal to or less than 0 as an integer X;

Any one of the X detection steps;

The next five Y detection steps;

(1) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, the bid data table 1310 of the third storage unit 1300 is searched, and the highest bid exceeding the value of the acquired limit amount 1112 A Y detection step of acquiring all bid data having a price 1310b, calculating a sum of values of the quantity 1310c of all the acquired bid data, and detecting the calculated sum value as an integer Y;

(2) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, the bid data table 1310 of the third storage unit 1300 is searched, and the highest bid greater than or equal to the value of the acquired limit amount 1112 A Y detection step of acquiring all bid data having a price 1310b, calculating a sum of values of the quantity 1310c of all the acquired bid data, and detecting the calculated sum value as an integer Y;

(3) The value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the bid data of the third storage means 1300 The table 1310 is searched to obtain all the bid data having the highest bid price 1310b exceeding the determined price, the sum of the values of the quantity 1310c of all the obtained bid data is calculated, and the value of the calculated sum is obtained. A Y detection step for detecting as an integer Y;

(4) The value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the bid data of the third storage means 1300 The table 1310 is searched to obtain all bid data having the highest bid price 1310b that is equal to or greater than the determined price, and the sum of the values of the quantities 1310c of all the obtained bid data is calculated. A Y detection step for detecting as an integer Y;

(5) Search the bid data table 1310 of the third storage means 1300 to acquire all bid data, calculate the sum of the values of the quantity 1310c of all the acquired bid data, and the value of the calculated sum Y detection step for detecting as an integer Y,

Any one of the Y detection steps;

Q detection step of calculating a value of Y−X + 1 using the detected integer X and integer Y, and detecting the calculated value as an integer Q;

If the value of the detected integer Q is equal to or greater than 1, R pieces of exhibition data (where R is an arbitrary integer satisfying R ≧ 1) are created, and the created R pieces of exhibition data are created. For each data, the following four steps:

(1) a step of setting the value of ID 1111 of the management data 1110 of the first storage means 1100 as the ID 1210a of the exhibition data;

(2) The lowest successful bid price 1210b of the exhibition data is S (where S is an arbitrary price satisfying S ≦ L, and L is the value of the limit 1112 of the management data 1110 of the first storage means 1100). )

(3) When the exhibition data is r-th of the R exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R), the quantity of the exhibition data 1210c to _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q 2, ...,} Q R , and r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R , respectively Taking a value of 1 or more and setting any integer satisfying Q ₁ + Q ₂ +... + Q _R ≧ Q)

(4) inputting the exhibition data into the exhibition data table 1210 of the second storage means 1200;

A listing step to perform,

It is an invention to execute profit adjustment processing consisting of

FIG. 13 is a processing diagram showing an example of profit adjustment processing according to the third aspect of the present invention.

First, a variable X, a variable Y, and a variable Q for detection are prepared (step S1). Next, the X detection step (step S2) and the Y detection step (step S3) are executed, values are input to the variable X and the variable Y, the value of the variable X is subtracted from the value of the variable Y, and 1 is added. A value is input to the variable Q (step S4). If the value of the variable Q is not 1 or more (step S5 / N), it ends. If it is 1 or more (step S5 / Y), exhibition data is created (step S6), and the ID 1210a of the exhibition data contains the first value. The value of ID 1111 of the management data 1110 of the storage means 1100 is set (step S7), and the value of the limit 1112 of the management data 1110 of the first storage means 1100 is set to the lowest successful bid price 1210b of the exhibition data (step S8). ), The value of the variable Q is set in the quantity 1210c of the exhibition data (step S9), the exhibition data is input to the exhibition data table 1210 of the second storage means 1200 (step S10), and the process is terminated.

For the X detection step (step S2), any one of the five X detection steps (S210, S220, S230, S240, S250) shown in FIGS. 14 and 15 is used.

When using the X detection step (1) of S210, the value of the limit 1112 of the management data 1110 of the first storage means 1100 is acquired (step S211), and the exhibition data table 1210 of the second storage means 1200 is searched. Then, all the exhibition data whose minimum successful bid price 1210b is less than or equal to the limit amount 1112 is acquired (step S212), and the sum of the quantities 1210c of all the exhibition data obtained by searching is input to the variable X (step S213). ).

When using the X detection step (2) of S220, the value of the limit 1112 of the management data 1110 of the first storage means 1100 is acquired (step S221), and the exhibition data table 1210 of the second storage means 1200 is searched. Then, all the exhibition data whose minimum successful bid price 1210b is less than the limit 1112 is acquired (step S222), and the sum of the quantities 1210c of all the exhibition data obtained by searching is input to the variable X (step S223). ).

When using the X detection step (3) of S230, the value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired (step S231), and an arbitrary value less than the limit amount 1112 is determined ( In step S232), the exhibition data table 1210 in the second storage means 1200 is searched to obtain all exhibition data whose lowest successful bid price 1210b is equal to or less than the determined price (step S233). The sum of the quantity 1210c of the exhibition data is input to the variable X (step S234).

When using the X detection step (4) of S240, the value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired (step S241), and an arbitrary value less than the limit amount 1112 is determined ( In step S242), the exhibition data table 1210 in the second storage means 1200 is searched to obtain all the exhibition data for which the lowest successful bid price 1210b is less than the determined price (step S243), and all the items obtained by the search are acquired. The sum of the quantity 1210c of the exhibition data is input to the variable X (step S244).

When using the X detection step (5) of S250, an arbitrary integer equal to or less than 0 is input to the variable X (step S251).

Although not shown, it is clear that the exhibition data having the lowest successful bid price 1210b exceeding the limit amount 1112 of the management data 1110 of the first storage means 1100 does not exist in the exhibition data table 1210 of the second storage means 1200. If it is, the exhibition data table 1210 of the second storage means 1200 is searched to obtain all the exhibition data, and the sum of the quantities 1210c of all the exhibition data obtained by the search is input to the variable X. An X detection step may be used. For the Y detection step (step S3), any one of the five Y detection steps (S310, S320, S330, S340, S350) shown in FIGS. 16 and 17 is used.

When using the Y detection step (1) of S310, the value of the limit 1112 of the management data 1110 of the first storage unit 1100 is acquired (step S311), and the bid data table 1310 of the third storage unit 1300 is searched. Then, all the bid data whose maximum bid price 1310b exceeds the limit 1112 are acquired (step S312), and the sum of the quantities 1310c of all the bid data obtained by searching is input to the variable Y (step S313). .

When using the Y detection step (2) of S320, the value of the limit 1112 of the management data 1110 of the first storage unit 1100 is acquired (step S321), and the bid data table 1310 of the third storage unit 1300 is searched. Then, all the bid data whose maximum bid price 1310b is equal to or greater than the value of the limit amount 1112 are acquired (step S322), and the sum of the quantities 1310c of all the bid data obtained by searching is input to the variable Y (step S323). ).

When using the Y detection step (3) of S330, the value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired (step S331), and an arbitrary value less than the limit amount 1112 is determined ( In step S332), the bid data table 1310 of the third storage means 1300 is searched to acquire all bid data for which the highest bid price 1310b exceeds the determined price (step S333), and all bids obtained by the search are obtained. The sum of the data quantity 1310c is input to the variable Y (step S334).

When using the Y detection step (4) of S340, the value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired (step S341), and an arbitrary value less than the limit amount 1112 is determined ( In step S342), the bid data table 1310 of the third storage unit 1300 is searched to obtain all bid data whose maximum bid price 1310b is equal to or more than the determined price (step S343), and all the bid data obtained by the search are acquired. The sum of the quantity 1310c of bid data is input to the variable Y (step S344).

When using the Y detection step (5) of S350, the bid data table 1310 of the third storage means 1300 is searched to obtain all bid data (step S351), and all the bid data obtained by the search are searched. The sum of the quantity 1310c is input to the variable Y (step S352).

In the third aspect of the present invention described above, it is unknown whether or not the exhibition data having the lowest successful bid price 1210b equal to the value of the limit amount 1112 is input in advance in the exhibition data table 1210. If it is clear that one or more exhibition data having the lowest successful bid price 1210b equal to the value of the amount 1112 has been input in advance, the method shown in FIG. 18 can be used. FIG. 18 is a conceptual diagram illustrating a first alternative example of the second profit adjustment method in the present invention.

In FIG. 18A, two listings A and B on the left and four bids A to D on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used. In this case, a price determination method is adopted in which the successful bid price is set to a lower value of either B _n or S _{n + 1} .

First, the first other example of the second profit adjustment method is to examine the number of listings having the lowest winning bid price less than the limit value in the state of FIG. On the other hand, the number of bids having the highest bid price exceeding the limit value is checked, and the number is detected as Y. This is shown in FIG. As illustrated in FIG. 18B, the first other example of the second profit adjustment method detects 1 as the value of X and 2 as the value of Y. Next, as shown in FIG. 18C, the first other example of the second profit adjustment method uses X and Y to detect 1 as the value of Y−X as Q, and the lowest winning bid price. Add Q items (1 item) under the name of the business operator who set the maximum amount. In the first other example of the second profit adjustment method, the winning bid price is suppressed to a limit amount or less by such a method.

In FIG. 18, a limit is set for the lowest successful bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limit may be set for the lowest successful bid price. Further, in FIG. 18, the minimum necessary exhibition for the successful bid price to be equal to or less than the limit price is added, but it may be configured to add more exhibitions. For example, a method of determining an arbitrary price that is less than the limit value, checking the number of listings having the lowest winning bid price less than or equal to the price, and detecting the number as X is shown in FIG. Since it is guaranteed that the value will be less than or equal to the value of X detected by the method, the number of additional listings will not be less than the minimum necessary number (if Y is constant in Q = Y−X, X If Q does not increase, Q will not decrease). Further, in the method of checking the number of bids having the highest bid price equal to or greater than the limit value and detecting the number as Y, the value of Y is equal to or greater than the value of Y detected by the method of FIG. Therefore, the number of listings to be added will not be smaller than the necessary minimum number (if X is constant when Q = Y−X, Q will decrease if Y does not decrease) Because there is no). As in these examples, if more than the minimum necessary number of listings are added, such a method may be used. Other examples will be described later.

The fourth aspect of the present invention that realizes the first other example of the second profit adjustment method described above is the auction apparatus 1000 used in the first aspect of the present invention, and further, the exhibition data table of the second storage means 1200. An auction apparatus 1000 in which one or more exhibition data having a minimum successful bid price 1210b equal to the value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is input in 1210 in advance,

The next four X detection steps;

(1) The value of the limit 1112 of the management data 1110 of the first storage unit 1100 is acquired, the exhibition data table 1210 of the second storage unit 1200 is searched, and the minimum that does not satisfy the value of the acquired limit 1112 An X detection step of acquiring all the exhibition data having the winning bid price 1210b, calculating a sum of values of the quantity 1210c of all the acquired exhibition data, and detecting the calculated sum as an integer X;

(2) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the exhibition data of the second storage unit 1200 The table 1210 is searched to obtain all the exhibition data having the lowest successful bid price 1210b equal to or less than the determined price, the sum of the values of the quantity 1210c of all the obtained exhibition data is calculated, and the value of the calculated sum is obtained. An X detection step for detecting as an integer X;

(3) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the exhibition data of the second storage unit 1200 The table 1210 is searched to obtain all the exhibition data having the lowest successful bid price 1210b that is less than the determined price, and the sum of the values of the quantity 1210c of all the obtained exhibition data is calculated, and the value of the calculated sum X detection step for detecting as an integer X,

(4) X detection step for detecting any integer less than or equal to 0 as an integer X;

Any one of the X detection steps;

Any one of the five Y detection steps in the third aspect of the present invention;

A Q detection step of calculating a value of Y−X using the detected integer X and integer Y, and detecting the calculated value as an integer Q;

Exhibition step in the third aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of profit adjustment processing can be referred to in FIG. 19, examples of four X detection steps can be referred to in FIGS. 20 and 21, and examples of five Y detection steps can be referred to in FIGS. FIG. 19 is the same as the step S4 in FIG. 13 in which Q = Y−X + 1 is changed to Q = Y−X. 20 is the same as the X detection step (2) of S220 of FIG. 14, and the X detection step (2) of S220 of FIG. 20 is the X detection step of S230 of FIG. 21 is the same as the X detection step (3) of S230 in FIG. 21, and the X detection step (4) of S240 in FIG. This is the same as the X detection step (5) of S250.

In the third aspect of the present invention described above, it is unknown whether or not the bid data having the highest bid price 1310b equal to the value of the limit amount 1112 is input in advance in the bid data table 1310. If it is clear that one or more bid data having the highest bid price 1310b equal to the value of the amount 1112 is input in advance, the method shown in FIG. 22 can be used. FIG. 22 is a conceptual diagram illustrating a second alternative example of the second profit adjustment method in the present invention.

In FIG. 22A, one exhibition A on the left and four bids A to D on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used. In this case, a price determination method is adopted in which the successful bid price is set to a lower value of either B _n or S _{n + 1} .

First, in a second example of the second profit adjustment method, in the state of FIG. 22A, the number of listings having the lowest winning bid price below the limit amount is examined, and the number is detected as X. The number of bids having the highest bid price equal to or greater than the limit value is examined, and the number is detected as Y. This is shown in FIG. 22-b. As shown in FIG. 22B, the second example of the second profit adjustment method detects 1 as the value of X and 3 as the value of Y. Next, as shown in FIG. 22-c, the second alternative example of the second profit adjustment method uses X and Y to detect 2 as the value of Y−X as Q, and the lowest winning bid price. Add Q (two) listings under the name of the business operator who set the limit amount. In a second alternative example of the second profit adjustment method, the winning bid price is suppressed to a limit amount or less by such a method.

In FIG. 22, a limit is set for the lowest successful bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limit may be set for the lowest successful bid price. In FIG. 22, the minimum required listing for the successful bid price to be below the limit is added, but it may be configured to add more listings. For example, in the method of checking the number of listings having the lowest winning bid price less than the limit value and detecting the number as X, the value of X is equal to or less than the value of X detected by the method of FIG. Therefore, the number of listings to be added will not be smaller than the minimum necessary number (If Y is constant when Q = Y−X, Q will decrease if X does not increase) Because there is no). Further, a method of determining an arbitrary value less than the limit value, examining the number of bids having the highest bid price exceeding the value, and detecting the number as Y is as follows. Since it is guaranteed that the value will be equal to or greater than the value of Y detected by the method, the number of additional listings will not be smaller than the minimum necessary number (if X is constant at Q = Y−X, Y If Q does not decrease, Q will not decrease). As in these examples, if more than the minimum necessary number of listings are added, such a method may be used. Other examples will be described later.

The fifth aspect of the present invention that realizes the second alternative example of the second profit adjustment method described above is the auction apparatus 1000 used in the second aspect of the present invention, and further the bid data table of the third storage means 1300. An auction apparatus 1000 in which one or more bid data having a maximum bid price 1310b equal to the value of the limit 1112 of the management data 1110 of the first storage means 1100 is input in 1310 in advance,

Any one of the five X detection steps in the third aspect of the present invention;

The next four Y detection steps;

(1) The value of the limit amount 1112 of the management data 1110 of the first storage unit 1100 is acquired, the bid data table 1310 of the third storage unit 1300 is searched, and the highest bid that is equal to or greater than the value of the acquired limit amount 1112 A Y detection step of acquiring all bid data having a price 1310b, calculating a sum of values of the quantity 1310c of all the acquired bid data, and detecting the calculated sum value as an integer Y;

(2) The value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the bid data of the third storage means 1300 The table 1310 is searched to obtain all the bid data having the highest bid price 1310b exceeding the determined price, the sum of the values of the quantity 1310c of all the obtained bid data is calculated, and the value of the calculated sum is obtained. A Y detection step for detecting as an integer Y;

(3) The value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is acquired, an arbitrary value less than the value of the acquired limit amount 1112 is determined, and the bid data of the third storage means 1300 The table 1310 is searched to obtain all bid data having the highest bid price 1310b that is equal to or greater than the determined price, and the sum of the values of the quantities 1310c of all the obtained bid data is calculated. A Y detection step for detecting as an integer Y;

(4) The bid data table 1310 of the third storage means 1300 is searched to obtain all bid data, the sum of the values of the quantity 1310c of all the obtained bid data is calculated, and the calculated sum value Y detection step for detecting as an integer Y,

Any one of the Y detection steps;

A Q detection step in the fourth aspect of the present invention;

Exhibition step in the third aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of profit adjustment processing can be referred to in FIG. 19, examples of five X detection steps can be referred to in FIGS. 14 and 15, and examples of four Y detection steps can be referred to in FIGS. FIG. 19 is the same as the step S4 in FIG. 13 in which Q = Y−X + 1 is changed to Q = Y−X. 23 is the same as the Y detection step (2) of S320 of FIG. 16, and the Y detection step (2) of S320 of FIG. 23 is the Y detection step of S330 of FIG. 24, the Y detection step (3) of S330 in FIG. 24 is the same as the Y detection step (4) of S340 of FIG. 17, and the Y detection step (4) of S340 of FIG. This is the same as the Y detection step (5) of S350. Although not shown, it is clear that the exhibition data having the lowest successful bid price 1210b exceeding the limit amount 1112 of the management data 1110 of the first storage means 1100 does not exist in the exhibition data table 1210 of the second storage means 1200. If it is, the exhibition data table 1210 of the second storage means 1200 is searched to obtain all the exhibition data, and the sum of the quantities 1210c of all the exhibition data obtained by the search is input to the variable X. An X detection step may be used.

In the third aspect of the present invention described above, it was unknown whether or not bid data was previously input to the bid data table 1310, but it is clear that one or more bid data is previously input to the bid data table 1310. a certain cases, when the pricing system in particular with any higher value of S _n and B _{n + 1} of the contract price is taken, it is possible to use the method shown in FIG. 25. FIG. 25 is a conceptual diagram illustrating a third alternative example of the second profit adjustment method in the present invention.

In FIG. 25A, one exhibition A on the left and four bids A to D on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used.

First, in a third example of the second profit adjustment method, in the state of FIG. 25A, the number of listings having the lowest winning bid price below the limit amount is examined, and the number is detected as X. The number of bids having the highest bid price exceeding the limit value is examined, and the number is detected as Y. This is shown in FIG. 25-b. As shown in FIG. 25B, the third other example of the second profit adjustment method detects 1 as the value of X and 2 as the value of Y. Next, as shown in FIG. 25-c, the third alternative example of the second profit adjustment method uses X and Y to detect 1 as the value of Y−X as Q, and the lowest winning bid price. Add Q items (1 item) under the name of the business operator who set the maximum amount. A third alternative example of the second profit adjustment method suppresses the winning bid price to a limit amount or less by such a method.

In FIG. 25, a limit is set for the lowest successful bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limit may be set for the lowest successful bid price. Further, in FIG. 25, the minimum necessary exhibition for the successful bid price to be less than or equal to the limit amount is added, but it may be configured such that more exhibitions are added. For example, in the method of checking the number of listings having the lowest winning bid price that is less than the limit value and detecting the number as X, the value of X is equal to or less than the value of X detected by the method of FIG. Therefore, the number of listings to be added will not be smaller than the minimum necessary number (If Y is constant when Q = Y−X, Q will decrease if X does not increase) Because there is no). Further, in the method of checking the number of bids having the highest bid price equal to or greater than the limit value and detecting the number as Y, the value of Y is equal to or greater than the value of Y detected by the method of FIG. Therefore, the number of listings to be added will not be smaller than the necessary minimum number (if X is constant when Q = Y−X, Q will decrease if Y does not decrease) Because there is no). As in these examples, if more than the minimum necessary number of listings are added, such a method may be used. Other examples will be described later.

The sixth aspect of the present invention that realizes the third alternative example of the second profit adjustment method described above includes the successful bid price determination means 1730 of the auction apparatus 1000 used in the first aspect of the present invention,

Based on n detected by the n detecting means 1720, a higher value of S _n and B _{n + 1} is determined as the winning bid price of the auction (provided that n> 0 and B _{n + 1} does not exist) The successful bid price is set to _Sn , and if n = 0 and B _{n + 1} exists, the successful bid price is set to B _{n + 1} ), and the determined successful bid price is input to the fourth storage unit 1400 1730,

The management data 1110 is previously input to the first storage unit 1100, the exhibition data table 1210 is input to the second storage unit 1200 in advance, and the exhibition data stored in the second storage unit 1200 is The table 1210 is preliminarily inputted with zero or more exhibition data, the third storage means 1300 is preliminarily inputted with the bid data table 1310, and the third storage means 1300 is preliminarily inputted with one or more bid data. The auction device 1000

Any one of the five X detection steps in the third aspect of the present invention;

Any one of the five Y detection steps in the third aspect of the present invention;

A Q detection step in the fourth aspect of the present invention;

Exhibition step in the third aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of profit adjustment processing can be referred to in FIG. 19, examples of five X detection steps can be referred to in FIGS. 14 and 15, and examples of five Y detection steps can be referred to in FIGS. Although not shown, it is clear that there is no exhibition data having the lowest successful bid price 1210b exceeding the limit 1112 of the management data 1110 of the first storage means 1100 in the exhibition data table 1210 of the second storage means 1200. If it is, the exhibition data table 1210 of the second storage means 1200 is searched to acquire all the exhibition data, and the sum of the quantities 1210c of all the exhibition data obtained by the search is input to the variable X. An X detection step may be used.

In the sixth aspect of the present invention described above, it is unknown whether or not the exhibition data having the lowest successful bid price 1210b equal to the value of the limit amount 1112 is input in advance in the exhibition data table 1210. When it is clear that one or more exhibition data having the lowest successful bid price 1210b equal to the value of the amount 1112 is input in advance, the method shown in FIG. 26 can be used. FIG. 26 is a conceptual diagram illustrating a fourth alternative example of the second profit adjustment method in the present invention.

In FIG. 26A, one exhibition A on the left and four bids A to D on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used.

First, a fourth alternative example of the second profit adjustment method is to examine the number of listings having the lowest winning bid price less than the limit amount in the state of FIG. On the other hand, the number of bids having the highest bid price exceeding the limit value is checked, and the number is detected as Y. This is shown in FIG. 26-b. As shown in FIG. 26B, the fourth example of the second profit adjustment method detects 0 as the value of X and 2 as the value of Y. Next, as shown in FIG. 26-c, a fourth example of the second profit adjustment method uses X and Y to detect 1 which is the value of Y−X−1 as Q, Add Q (1) listings under the name of the business operator that has set a limit on the winning bid price. According to a fourth example of the second profit adjustment method, the winning bid price is suppressed to a limit amount or less by such a method.

In FIG. 26, a limit is set for the lowest winning bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limiting price may be set for the lowest winning bid price. Further, in FIG. 26, the minimum required listing for the successful bid price to be equal to or less than the limit price is added, but it may be configured to add more listings. For example, a method of determining an arbitrary price that is less than the limit value, checking the number of listings having the lowest winning bid price less than the price, and detecting that number as X is as follows. Since it is guaranteed that the value will be less than or equal to the value of X detected by the method, the number of additional listings will not be less than the minimum necessary number (when Y is constant in Q = Y−X−1) If Q does not increase, Q will not decrease). Further, in the method of checking the number of bids having the highest bid price equal to or greater than the limit amount and detecting the number as Y, the value of Y is equal to or greater than the value of Y detected by the method of FIG. Therefore, the number of listings to be added will not be smaller than the minimum necessary number (if Q is constant in Q = Y−X−1, Q will decrease if Y does not decrease). Because there is no such thing). As in these examples, if more than the minimum necessary number of listings are added, such a method may be used. Other examples will be described later.

The seventh aspect of the present invention for realizing the fourth example of the second profit adjustment method described above is the auction apparatus 1000 used in the sixth aspect of the present invention, and further, the exhibition data table of the second storage means 1200. An auction apparatus 1000 in which one or more exhibition data having a minimum successful bid price 1210b equal to the value of the limit amount 1112 of the management data 1110 of the first storage means 1100 is input in 1210 in advance,

Any one of the four X detection steps in the fourth aspect of the present invention;

Any one of the five Y detection steps in the third aspect of the present invention;

Q detection step of calculating a value of Y-X-1 using the detected integer X and integer Y, and detecting the calculated value as an integer Q;

Exhibition step in the third aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 27, an example of the four X detection steps can be referred to in FIGS. 20 and 21, and an example of the five Y detection steps can be referred to in FIGS. FIG. 27 is the same as Q = Y−X + 1 in step S4 of FIG. 13 changed to Q = Y−X−1.

In the third to seventh aspects of the present invention described above, the created exhibition data is input to the exhibition data table 1210. The exhibition data table 1210 has an ID 1210a equal to the value of the operator ID 1111 and a value less than the value of the limit amount 1112. When one or more pieces of exhibition data having the lowest successful bid price 1210b are input in advance, the successful bid price 1410 can be reduced to a limit of 1112 or less by increasing the quantity 1210c of the exhibition data.

The eighth aspect of the present invention is the auction apparatus 1000 used in the first aspect of the present invention, and further includes an ID 1111 value of the management data 1110 of the first storage unit 1100 in the exhibition data table 1210 of the second storage unit 1200. An auction apparatus 1000 in which one or more exhibition data having an equal ID 1210a and a minimum successful bid price 1210b equal to or less than the limit 1112 of the management data 1110 of the first storage unit 1100 is preliminarily input,

Any one of the five X detection steps in the third aspect of the present invention;

Any one of the five Y detection steps in the third aspect of the present invention;

A Q detection step in the third aspect of the present invention;

When the detected value of the integer Q is 1 or more, ID 1210a and first storage means equal to the value of ID 1111 of the management data 1110 of the first storage means 1100 from the exhibition data table 1210 of the second storage means 1200 Arbitrary R pieces of exhibition data having the lowest bid price 1210b equal to or less than the value of the limit amount 1112 of the management data 1110 of 1100 are selected (where R is an arbitrary integer satisfying R ≧ 1), and the selection is made. For each of the R exhibition data, the next step;

When the exhibition data is r-th exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R) among the R exhibition data, the value of the quantity 1210c of the exhibition data _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q} 2 to, ..., and _{Q R,} r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R is, each 1 A value obtained by adding the above value and an arbitrary integer satisfying Q ₁ + Q ₂ +... + Q _R ≧ Q) to the quantity 1210c of the exhibition data;

A listing step to perform,

It is an invention to execute profit adjustment processing consisting of

FIG. 28 is a process diagram showing an example of the profit adjustment process in the eighth aspect of the present invention.

First, a variable X, a variable Y, and a variable Q for detection are prepared (step S1). Next, the X detection step (step S2) and the Y detection step (step S3) are executed, values are input to the variable X and the variable Y, the value of the variable X is subtracted from the value of the variable Y, and 1 is added. A value is input to the variable Q (step S4). If the value of the variable Q is not 1 or more (step S5 / N), the process ends. If it is 1 or more (step S5 / Y), the ID 1210a is equal to the value of the ID 1111 of the management data 1110 of the first storage unit 1100. In addition, the exhibition data table 1210 of the second storage means 1200 is searched for the exhibition data whose minimum successful bid price 1210b is not more than the value of the limit 1112 of the management data 1110 of the first storage means 1100 (step S6). One of the exhibition data having the highest lowest successful bid price 1210b value is selected from the exhibition data obtained in this manner (step S7), and the value obtained by adding the value of the variable Q to the value of the quantity 1210c of the selected exhibition data. It inputs into the quantity 1210c of the selected exhibition data (step S8) and ends.

An example of the five X detection steps can be referred to in FIGS. 14 and 15, and an example of the five Y detection steps can be referred to in FIGS. 16 and 17. Although not shown, it is clear that the exhibition data having the lowest successful bid price 1210b exceeding the limit amount 1112 of the management data 1110 of the first storage means 1100 does not exist in the exhibition data table 1210 of the second storage means 1200. If it is, the exhibition data table 1210 of the second storage means 1200 is searched to obtain all the exhibition data, and the sum of the quantities 1210c of all the exhibition data obtained by the search is input to the variable X. An X detection step may be used.

Next, the ninth aspect of the present invention will be described. The ninth aspect of the present invention is the auction apparatus 1000 used in the fourth aspect of the present invention, and further includes the value of ID 1111 of the management data 1110 of the first storage unit 1100 in the exhibition data table 1210 of the second storage unit 1200. An auction apparatus 1000 in which one or more exhibition data having an equal ID 1210a and a minimum successful bid price 1210b equal to or less than the limit 1112 of the management data 1110 of the first storage unit 1100 is preliminarily input,

Any one of the four X detection steps in the fourth aspect of the present invention;

Any one of the five Y detection steps in the third aspect of the present invention;

A Q detection step in the fourth aspect of the present invention;

An exhibition step in the eighth invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 29, an example of the four X detection steps can be referred to in FIGS. 20 and 21, and an example of the five Y detection steps can be referred to in FIGS. FIG. 29 is the same as Q = Y−X + 1 in step S4 of FIG. 28 changed to Q = Y−X.

Next, a tenth aspect of the present invention will be described. The tenth aspect of the present invention is the auction apparatus 1000 used in the fifth aspect of the present invention, and further includes the value of ID 1111 of the management data 1110 of the first storage unit 1100 in the exhibition data table 1210 of the second storage unit 1200. An auction apparatus 1000 in which one or more exhibition data having an equal ID 1210a and a minimum successful bid price 1210b equal to or less than the limit 1112 of the management data 1110 of the first storage unit 1100 is preliminarily input,

Any one of the five X detection steps in the third aspect of the present invention;

Any one of the four Y detection steps in the fifth aspect of the present invention;

A Q detection step in the fourth aspect of the present invention;

An exhibition step in the eighth invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 29, an example of the five X detection steps can be referred to in FIGS. 14 and 15, and an example of the four Y detection steps can be referred to in FIGS. Although not shown, it is clear that the exhibition data having the lowest successful bid price 1210b exceeding the limit amount 1112 of the management data 1110 of the first storage means 1100 does not exist in the exhibition data table 1210 of the second storage means 1200. If it is, the exhibition data table 1210 of the second storage means 1200 is searched to obtain all the exhibition data, and the sum of the quantities 1210c of all the exhibition data obtained by the search is input to the variable X. An X detection step may be used.

Next, the eleventh aspect of the present invention will be described. The eleventh aspect of the present invention is the auction apparatus 1000 used in the sixth aspect of the present invention, and further includes the value of ID 1111 of the management data 1110 of the first storage unit 1100 in the exhibition data table 1210 of the second storage unit 1200. An auction apparatus 1000 in which one or more exhibition data having an equal ID 1210a and a minimum successful bid price 1210b equal to or less than the limit 1112 of the management data 1110 of the first storage unit 1100 is preliminarily input,

Any one of the five X detection steps in the third aspect of the present invention;

Any one of the five Y detection steps in the third aspect of the present invention;

A Q detection step in the fourth aspect of the present invention;

An exhibition step in the eighth invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 29, an example of the five X detection steps can be referred to in FIGS. 14 and 15, and an example of the five Y detection steps can be referred to in FIGS. Although not shown, it is clear that the exhibition data having the lowest successful bid price 1210b exceeding the limit amount 1112 of the management data 1110 of the first storage means 1100 does not exist in the exhibition data table 1210 of the second storage means 1200. If it is, the exhibition data table 1210 of the second storage means 1200 is searched to obtain all the exhibition data, and the sum of the quantities 1210c of all the exhibition data obtained by the search is input to the variable X. An X detection step may be used.

Next, a twelfth aspect of the present invention will be described. The twelfth aspect of the present invention is the auction apparatus 1000 used in the seventh aspect of the present invention, and further includes the value of the ID 1111 of the management data 1110 of the first storage means 1100 in the exhibition data table 1210 of the second storage means 1200. An auction apparatus 1000 in which one or more exhibition data having an equal ID 1210a and a minimum successful bid price 1210b equal to or less than the limit 1112 of the management data 1110 of the first storage unit 1100 is preliminarily input,

Any one of the four X detection steps in the fourth aspect of the present invention;

Any one of the five Y detection steps in the third aspect of the present invention;

A Q detection step according to the seventh aspect of the present invention;

An exhibition step in the eighth invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 30, an example of the four X detection steps can be referred to in FIGS. 20 and 21, and an example of the five Y detection steps can be referred to in FIGS. FIG. 30 is the same as Q = Y−X + 1 in step S4 of FIG. 28 changed to Q = Y−X−1.

Next, the third profit adjustment method will be described. In the second profit adjustment method described above, the necessary number of listings are added at once by a method of calculating in advance the number of listings necessary for the successful bid price to be less than the limit amount. However, when the auction apparatus uses the pricing unit at an arbitrary time point and the winning bid price not exceeding the limit amount is input to the fourth storage unit, the method as shown in FIG. 31 is used. Therefore, it is possible to add a necessary number of listings without calculating in advance. FIG. 31 is a conceptual diagram illustrating a third profit adjustment method according to the present invention.

In FIG. 31-a, two exhibitions A and B on the left and one bid A on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used. In this case, a price determination method is adopted in which the successful bid price is set to a lower value of either B _n or S _{n + 1} .

First, FIG. 31-a shows that the winning bid price at a certain point is below the limit (the number of listings having the lowest winning bid below the limit is X, and the limit value If the number of bids having the highest bid price exceeding Y is Y, X (= 2)> Y (= 1) is satisfied. FIG. 31-b shows a state where two more bids are added to the state of FIG. 31-a. The third profit adjustment method detects that two bids have been added, and, as shown in FIG. 31-c, the same number of bids as the number of bids added by an operator in the name of the operator who has set a limit on the lowest bid price. Add two. In the third profit adjustment method, the winning bid price is suppressed to a limit amount or less by such a method.

In FIG. 31, a limit is set for the lowest successful bid price of the exhibition to be added, but an arbitrary price equal to or lower than the limit may be set for the lowest successful bid price. In FIG. 31, the same number of exhibitions as the added bids are added. However, more exhibitions may be added. For example, three or more items may be added in the example of FIG.

In order to realize the concept of the third profit adjustment method described above, the thirteenth aspect of the present invention uses an auction apparatus shown in FIG. FIG. 32 is a block diagram showing a structural example of an auction apparatus used in the thirteenth aspect of the present invention.

The only difference between the auction apparatus 2000 used in the thirteenth aspect of the present invention and the auction apparatus 1000 used in the first aspect of the present invention is that a bidding means 2800 is added to the auction apparatus 2000.

The bidding means 2800 is means for creating bid data, or means for receiving bid data from a bid data creating apparatus 6000 connected to the auction apparatus 2000 via the network 5000 as shown in FIG. The bid data creation device 6000 includes a creation unit 6100 that creates bid data, and a transmission unit 6200 that transmits the created bid data to the auction device 2000.

The exhibition data table 2210 can be referred to in FIG. 34, and the bid data table 2310 can be referred to in FIG. 34 is similar to FIG. 3, and FIG. 35 is similar to FIG.

The thirteenth aspect of the present invention is an auction apparatus 2000 in which the auction apparatus 1000 used in the first aspect of the present invention is further provided with the above-described bidding means 2800, where X> Y (where X is the second storage Of the exhibition data 2211 to 221N input to the exhibition data table 2210 of the means 2200, the value of the quantity 2210c of the exhibition data having the lowest successful bid price 2210b equal to or less than the limit 2112 of the management data 2110 of the first storage means 2100. The highest bid price 2310b that exceeds the value of the limit amount 2112 of the management data 2110 of the first storage means 2100 out of the bid data 2311 to 231M input to the bid data table 2310 of the third storage means 2300 is Y. The auction apparatus 200 satisfying (the sum of the values of the quantity 2310c of bid data having But,

An acquisition step of acquiring bid data using the bidding means 2800;

R pieces of exhibition data (where R is an arbitrary integer satisfying R ≧ 1) are created, and the following four steps are performed for each of the created R pieces of exhibition data;

(1) a step of setting the value of ID 2111 of the management data 2110 of the first storage means 2100 to the ID 2210a of the exhibition data;

(2) The lowest successful bid price 2210b of the exhibition data is S (where S is an arbitrary price satisfying S ≦ L, and L is the value of the limit amount 2112 of the management data 2110 of the first storage means 2100) )

(3) When the exhibition data is r-th of the R exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R), the quantity of the exhibition data 2210c to _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q 2, ...,} Q R , and r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R , respectively A value that is equal to or greater than 1 and is an arbitrary integer that satisfies Q ₁ + Q ₂ +... + Q _R ≧ Q, where Q is the quantity of bid data 2310c acquired in the acquisition step),

(4) inputting the exhibition data into the exhibition data table 2210 of the second storage means 2200;

A listing step to perform,

A bid step of inputting the bid data acquired in the acquisition step into the bid data table 2310 of the third storage means 2300;

It is an invention to execute profit adjustment processing consisting of

FIG. 36 is a process diagram showing an example of the profit adjustment process in the thirteenth aspect of the present invention.

First, bid data is acquired using the bidding means 2800 (step S1). Next, an exhibition step is executed (step S2), the acquired bid data is input to the bid data table 2310 of the third storage means 2300 (step S3), and the process ends.

Although not shown, before the start of step S2 of FIG. 36, the value of the maximum bid price 2310b of the bid data acquired in step S1 is compared with the value of the limit 2112 of the management data 2110 of the first storage means 2100. The step S2 may be started when the value of the maximum bid price 2310b exceeds the value of the limit amount 2112, and the step S2 may be skipped when the value of the limit amount 2112 is not exceeded. The exhibition step (step S2) is shown in FIG.

First, the exhibition data is created (step S21), the value of ID 2111 of the management data 2110 of the first storage means 2100 is set to the ID 2210a of the exhibition data (step S22), and the lowest successful bid price 2210b of the exhibition data is set. The limit value 2112 of the management data 2110 of the first storage means 2100 is set (step S23), the value of the acquired bid data quantity 2310c is set to the quantity 2210c of the exhibition data (step S24), and the exhibition Data is input to the exhibition data table 2210 of the second storage means 2200 (step S25), and the exhibition step is completed.

In the thirteenth aspect of the present invention, it is unknown whether or not bid data is input in advance in the bid data table 2310, but it is clear that one or more bid data is input in advance in the bid data table 2310. a certain cases, when the pricing system in particular with any higher value of S _n and B _{n + 1} of the contract price is taken, it is possible to use the method shown in FIG. 38. FIG. 38 is a conceptual diagram illustrating another example of the third profit adjustment method in the present invention.

In FIG. 38A, one exhibition A on the left and one bid A on the right are arranged according to the price axis. For the position on the price axis, the lowest bid price of the exhibition and the highest bid price of the bid are used.

First, FIG. 38-a shows that the winning bid price at a certain point is not more than the limit amount (the number of listings having the lowest winning bid price not more than the limit amount is X, and the value of the limit amount). If the number of bids having the highest bid price exceeding Y is Y, X (= 1) ≧ Y (= 1) is satisfied. FIG. 38B shows a state in which two more bids are added to the state of FIG. 38A. Another example of the third profit adjustment method is to detect that two bids have been added and, as shown in FIG. Add two of the same number. In another example of the third profit adjustment method, the winning bid price is suppressed to a limit amount or less by such a method.

In FIG. 38, a limit is set for the lowest successful bid price of the listing to be added, but an arbitrary price equal to or lower than the limit may be set for the lowest successful bid price. In FIG. 38, the same number of exhibitions as the added bids are added, but it may be configured such that more exhibitions are added. For example, three or more items may be added in the example of FIG.

In order to realize the concept of another example of the third profit adjustment method described above, the fourteenth aspect of the present invention is the bidding means 2800 used in the thirteenth aspect of the present invention. , Wherein X ≧ Y (where X is the first storage means 2100 of the exhibition data 2211 to 221N input to the exhibition data table 2210 of the second storage means 2200). The sum of the value of the quantity 2210c of the exhibition data having the lowest successful bid price 2210b that is equal to or less than the limit value 2112 of the management data 2110, and Y is the bid data 2311 to 1111 input to the bid data table 2310 of the third storage means 2300. Of the 231M, the entry having the highest bid price 2310b exceeding the limit 2112 of the management data 2110 of the first storage means 2100 Auction apparatus 2000 filled with the sum) of the value of the quantity 2310c of the data,

An obtaining step according to the thirteenth aspect of the present invention;

An exhibition step according to the thirteenth aspect of the present invention;

A bidding step in the thirteenth aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 36, and an example of the exhibition step (step S2) can be referred to in FIG.

In the thirteenth and fourteenth aspects of the present invention, the created exhibition data is input to the exhibition data table 2210. However, the exhibition data table 2210 has an ID 2210a equal to the value of the business operator ID 2111 and a value less than the value of the limit amount 2112. When one or more exhibition data having the lowest successful bid price 2210b is input in advance, an exhibition can be added by increasing the quantity 2210c of the exhibition data.

The fifteenth aspect of the present invention is an auction apparatus 2000 further comprising a bidding means 2800 used in the thirteenth aspect of the auction apparatus 1000 used in the eighth aspect of the present invention, wherein X> Y (where X Of the exhibition data 2211 to 221N input to the exhibition data table 2210 of the second storage means 2200, the exhibition data having the lowest successful bid price 2210b which is not more than the limit value 2112 of the management data 2110 of the first storage means 2100. The value of the limit 2112 of the management data 2110 of the first storage means 2100 out of the bid data 2311 to 231M input to the bid data table 2310 of the third storage means 2300 The sum of the bid data quantity 2310c with the highest bid price 2310b exceeding ® down apparatus 2000,

An obtaining step according to the thirteenth aspect of the present invention;

The lowest bid that is equal to or less than the value of ID 2210a equal to the value of ID2111 of the management data 2110 of the first storage means 2100 and the limit amount 2112 of the management data 2110 of the first storage means 2100 from the exhibition data table 2210 of the second storage means 2200 R pieces of exhibition data having a price 2210b are selected (where R is an arbitrary integer satisfying R ≧ 1), and the following steps are performed for each of the selected R pieces of exhibition data;

When the exhibition data is r-th exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R) among the R exhibition data, the value of the quantity 2210c of the exhibition data _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q} 2 to, ..., and _{Q R,} r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R is, each 1 The value obtained by adding the above value and an arbitrary integer satisfying Q ₁ + Q ₂ +... + Q _R ≧ Q, where Q is the quantity 2310c of the bid data acquired in the acquisition step). Inputting into the quantity 2210c of

A listing step to perform,

A bidding step in the thirteenth aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of profit adjustment processing can be referred to in FIG. The exhibition step (step S2) is shown in FIG.

First, the exhibition data whose ID 2210a is equal to the value of ID2111 of the management data 2110 of the first storage means 2100 and whose lowest successful bid price 2210b is equal to or less than the value of the limit 2112 of the management data 2110 of the first storage means 2100 is the first. 2 in the exhibition data table 2210 of the storage means 2200 of No. 2 (step S21), and selects one exhibition data having the largest lowest successful bid price 2210b among the exhibition data obtained by the search (step S22). A value obtained by adding the value of the acquired bid data quantity 2310c to the value of the selected exhibition data quantity 2210c is input to the selected exhibition data quantity 2210c (step S23), and the exhibition step is completed.

Next, the sixteenth aspect of the present invention will be described. The sixteenth aspect of the present invention is an auction apparatus 2000 further comprising a bidding means 2800 used in the thirteenth aspect of the auction apparatus 1000 used in the eleventh aspect of the present invention, wherein X ≧ Y (where X Of the exhibition data 2211 to 221N input to the exhibition data table 2210 of the second storage means 2200, the exhibition data having the lowest successful bid price 2210b which is not more than the limit value 2112 of the management data 2110 of the first storage means 2100. The value of the limit 2112 of the management data 2110 of the first storage means 2100 out of the bid data 2311 to 231M input to the bid data table 2310 of the third storage means 2300 The sum of the values of the bid data quantity 2310c having the highest bid price 2310b exceeding Deployment apparatus 2000,

An obtaining step according to the thirteenth aspect of the present invention;

An exhibition step according to the fifteenth aspect of the present invention;

A bidding step in the thirteenth aspect of the present invention;

It is an invention to execute profit adjustment processing consisting of

An example of the profit adjustment process can be referred to in FIG. 36, and an example of the exhibition step (step S2) can be referred to in FIG.

As described above, according to the first to third profit adjustment methods described above (specifically, the first to sixteenth aspects of the present invention), prizes manufactured by businesses or prizes that can be easily procured are additionally exhibited in auctions, and prizes are given. As an example, a function will be realized in which an increase in economic profit provided to a winner is suppressed within a limit, and a gift can be reliably given to a winner who wishes to receive a prize. In addition, if the price of the prize is higher than expected, it will also benefit the company that produces the prize itself, so the function of providing the company with a place that aims to make a prize with higher added value is also realized.

Next, a fourth profit adjustment method will be described. In the above-described first to third profit adjustment methods, the value of the premium is controlled by the method of adding the listing. However, the value of the premium can be controlled even by using the method shown in FIG. It is. FIG. 40 is a conceptual diagram illustrating a fourth profit adjustment method in the present invention.

The portion shown in white on the right side of FIG. 40 is the amount paid by the winning bidder when the prize is awarded. In the fourth profit adjustment method, when the prize is awarded and the winning bid price exceeds the limit amount, the limit is paid to the exhibitor, and the operator acquires the difference between the winning bid price and the limit amount. According to the fourth profit adjustment method, it is possible to suppress the economic profit provided to the exhibitor (the portion indicated by the hatching on the left side of FIG. 40) within the limit.

In order to realize the concept of the fourth profit adjustment method described above, the seventeenth aspect of the present invention uses an auction apparatus shown in FIG. FIG. 41 is a block diagram showing a structural example of an auction apparatus used in the seventeenth aspect of the present invention.

The only difference between the auction apparatus 3000 used in the seventeenth aspect of the invention and the auction apparatus 1000 used in the first aspect of the present invention is that a fifth storage means 3500 and a sixth storage means 3600 are added to the auction apparatus 3000. It is.

The fifth storage means 3500 is a means for storing the received amount 3510 (the amount that represents the right to receive the seller of the auction among the successful bid prices 3410), and the sixth storage unit 3600 is the acquired amount 3610 ( It is a means for storing (amount of money meaning the acquisition right of the auction operator) of the winning bid price 3410).

The exhibition data table 3210 can be referred to in FIG. 42, and the bid data table 3310 can be referred to in FIG. 42 is the same as FIG. 3, and FIG. 43 is the same as FIG. (However, the value of the lowest successful bid price 3210b is a value less than or equal to the limit amount 3112. This is because when the successful bid price exceeds the limit amount, there is no exhibition remaining without being awarded.)

The seventeenth aspect of the present invention is the auction apparatus 3000 described above, in which the management data 3110 is previously input to the first storage unit 3100, the exhibition data table 3210 is input to the second storage unit 3200 in advance, The exhibition data table 3210 of the storage means 3200 is preliminarily input with zero or more exhibition data, the bid data table 3310 is preliminarily input to the third storage means 3300, and the bid data table 3310 of the third storage means 3300 is zero or more. The auction device 3000 in which bid data is input in advance is

A winning bid price input step of inputting the winning bid price 3410 to the fourth storage means 3400 using the pricing means 3700;

When the value of the successful bid price 3410 of the fourth storage means 3400 is compared with the value of the limit 3112 of the management data 3110 of the first storage means 3100, and the value of the successful bid price 3410 is less than or equal to the value of the limit 3112 Inputs the value of the successful bid price 3410 to the fifth storage means 3500, and if the value of the successful bid price 3410 exceeds the value of the limit 3112, the value of the limit price 3112 is stored in the fifth storage means 3500. Receipt amount input step to enter,

An acquisition amount input step of inputting a value obtained by subtracting the value of the received amount 3510 of the fifth storage unit 3500 from the value of the successful bid price 3410 of the fourth storage unit 3400 to the sixth storage unit 3600;

It is an invention to execute profit adjustment processing consisting of

FIG. 44 is a process diagram showing an example of the profit adjustment process in the seventeenth aspect of the present invention.

First, the bidding price is input to the fourth storage unit 3400 using the pricing unit 3700 (step S1), the value of the bidding price 3410 in the fourth storage unit 3400 and the management data 3110 of the first storage unit 3100 are stored. The value of the limit price 3112 is compared. If the value of the contract price 3410 is equal to or less than the value of the limit price 3112 (step S2 / Y), the value of the contract price 3410 is input to the fifth storage means 3500 (step S3). ), If the value is not less than the value of the limit 3112 (step S2 / N), the value of the limit 3112 is input to the fifth storage means 3500 (step S4). Next, a value obtained by subtracting the value of the received amount 3510 of the fifth storage unit 3500 from the value of the successful bid price 3410 is input to the sixth storage unit 3600 (step S5), and the process is terminated.

In the seventeenth aspect of the present invention described above, a higher effect can be obtained when there is no recipient who wishes to receive (a winner who wishes to receive a prize rather than a prize display). If there is a recipient, it is better to use a method as shown in FIG. FIG. 45 is a conceptual diagram illustrating another example of the fourth profit adjustment method in the present invention.

In another example of the 4th profit adjustment method, in addition to the 4th profit adjustment method, if the successful bid price exceeds the limit amount, the premium is received by the difference between the successful bid price and the limit amount. By giving the right to make a successful bid instead (the applicant also submits the bid and bids at the same time), the economic benefits provided to the recipient (the part shaded on the right in Fig. 45) are within the limit. Can be suppressed. (Hereafter, the term “request for receipt” is used in this sense)

In order to realize the concept of another example of the fourth profit adjustment method described above, the 18th aspect of the present invention uses an auction apparatus shown in FIG. FIG. 46 is a block diagram showing a structural example of an auction apparatus used in the eighteenth aspect of the present invention.

The only difference between the auction apparatus 4000 used in the eighteenth aspect of the invention and the auction apparatus 3000 used in the seventeenth aspect of the present invention is that the lower limit price 4113, the exhibiting means 4800, and the receiving request means 4900 are added to the auction apparatus 4000. is there.

The lower limit price 4113 is a lower limit price of the lowest successful bid price that can be set in the auction. (However, the value of the lower limit price 4113 is less than the value of the limit amount 4112.)

The exhibition means 4800 creates the exhibition data or receives the exhibition data from the exhibition data creation device 7000 connected to the auction apparatus 4000 and the network 5000 as shown in FIG. 47, and creates the creation data as shown in FIG. Alternatively, the value of the lowest successful bid price 4210b of the received exhibition data is compared with the value of the limit 4112 of the management data 4110 of the first storage means 4100 and the value of the lower limit price 4113 of the management data 4110 of the first storage means 4100. Means for inputting the exhibition data into the exhibition data table 4210 of the second storage means 4200 when at least the value of the lowest successful bid price 4210b is not more than the value of the limit amount 4112 and exceeds the value of the lower limit price 4113; It is. The exhibition data creation device 7000 is a device that includes creation means 7100 for creating exhibition data and transmission means 7200 for transmitting the created exhibition data to the auction apparatus 4000.

The receiving request means 4900 is a means for generating the receiving request data or a means for receiving the receiving request data from the receiving request data generating apparatus 8000 connected to the auction apparatus 4000 and the network 5000 as shown in FIG. . The desired receipt data creation device 8000 is a device that includes a creation unit 8100 that creates desired receipt data and a transmission unit 8200 that transmits the created desired receipt data to the auction device 4000.

As shown in FIG. 50, the desired receipt data 4910 is data including at least an ID 4911, a maximum bid price 4912, and a quantity 4913 (where the value of the quantity 4913 is an integer value of 1 or more).

The exhibition data table 4210 can be referred to in FIG. 51, and the bid data table 4310 can be referred to in FIG. 51 is the same as FIG. 3, and FIG. 52 is the same as FIG. (However, the value of the lowest successful bid price 4210b is not more than the value of the limit amount 4112 and not less than the value of the lower limit price 4113. This means that if the winning bid price exceeds the limit amount, there will be no listings left unsuccessfully. Because.)

The eighteenth aspect of the present invention is the auction apparatus 4000 described above, in which the management data 4110 is previously input to the first storage unit 4100, the exhibition data table 4210 is input to the second storage unit 4200 in advance, The exhibition data table 4210 of the storage means 4200 is preliminarily input with zero or more exhibition data, the bid data table 4310 is preliminarily input to the third storage means 4300, and the bid data table 4310 of the third storage means 4300 is zero or more. The auction device 4000 in which bid data is input in advance is

An acquisition step of acquiring the reception request data 4910 using the reception request means 4900;

Create arbitrary R pieces of exhibition data (where R is an arbitrary integer satisfying 1 ≦ R ≦ Q, and Q is the value of the quantity 4913 of the desired received data 4910 acquired in the acquisition step), For each of the R exhibition data created, the following four steps:

(1) a step of setting the value of ID 4911 of the desired receipt data 4910 acquired by the acquisition step as the ID 4210a of the exhibition data;

(2) a step of setting the value of the lower limit price 4113 of the management data 4110 of the first storage means 4100 to the lowest successful bid price 4210b of the exhibition data;

(3) When the exhibition data is r-th of the R exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R), the quantity of the exhibition data 4210c to _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q 2, ...,} Q R , and r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R , respectively Is an arbitrary integer that takes a value of 1 or more and satisfies Q ₁ + Q ₂ +... + Q _R = Q, where Q is the value of the quantity 4913 of the desired received data 4910 acquired in the acquisition step) Process,

(4) inputting the exhibition data into the exhibition data table 4210 of the second storage means 4200;

A listing step to perform,

Create arbitrary U pieces of bid data (where U is an arbitrary integer satisfying 1 ≦ U ≦ Q, and Q is the value of the quantity 4913 of the desired received data 4910 acquired in the acquisition step), For each of the U bid data created, the following four steps:

(1) a step of setting the ID 4911 value of the desired receipt data 4910 acquired by the acquisition step in the ID 4310a of the bid data;

(2) The sum of the value of the limit 4112 of the management data 4110 of the first storage means 4100 and the value of the maximum bid price 4912 of the desired receiving data 4910 acquired by the acquisition step is added to the maximum bid price 4310b of the bid data. Setting the value,

(3) When the bid data is the u-th bid data (where u is an arbitrary integer satisfying 1 ≦ u ≦ U) among the U pieces of bid data, the quantity of the bid data 4310c to _{Q u} (however, _{Q u} is the U of quantity _{Q 1, Q 2, ...,} and _{Q U,} u-th of the quantity of the, U number of quantity _{Q 1, Q 2, ...,} Q U , respectively And an arbitrary integer satisfying Q ₁ + Q ₂ +... + Q _U = Q, where Q is the value of the quantity 4913 of the desired received data 4910 acquired by the acquisition step) Process,

(4) inputting the bid data into the bid data table 4310 of the third storage unit 4300;

A bidding step to

A receipt request process consisting of:

In the seventeenth aspect of the present invention, the profit adjustment processing is executed.

FIG. 53 is a process diagram showing an example of the reception request process in the eighteenth aspect of the present invention.

First, the reception request data 4910 is acquired using the reception request means 4900 (step S1). Next, the exhibition data is created (step S2), the value of ID 4911 of the desired receipt data 4910 acquired in step S1 is set in the ID 4210a of the exhibition data (step S3), and the lowest successful bid price 4210b of the exhibition data is set. The value of the lower limit price 4113 of the management data 4110 of the one storage means 4100 is set (step S4), and the value of the quantity 4913 of the desired receipt data 4910 acquired in step S1 is set to the quantity 4210c of the exhibition data (step S5). ), The exhibition data is input to the exhibition data table 4210 of the second storage means 4200 (step S6). Next, bid data is created (step S7), the value of ID 4911 of the desired receipt data 4910 acquired in step S1 is set in the ID 4310a of the bid data (step S8), and the highest bid price 4310b of the bid data is set to the second bid data 4310b. The value of the sum of the limit 4112 of the management data 4110 of the storage means 4100 of 1 and the value of the highest bid price 4912 of the desired receipt data 4910 acquired in step S1 is set (step S9), and the quantity of the bid data The value of the quantity 4913 of the desired receipt data 4910 acquired in step S1 is set in 4310c (step S10), the bid data is input to the bid data table 4310 of the third storage means 4300 (step S11), and the process is performed. finish.

The profit adjustment process can be referred to in FIG.

In the above example, it is configured that a lower limit price is set for the lowest successful bid price of the applicant who wishes to receive, and a price exceeding the lower limit price is set for the lowest successful bid price of the seller other than the desire recipient. This is because the priority of the applicant's listing is made higher than that of the seller other than the recipient. If the priority of the applicant's listing is lower than that of the seller other than the recipient, the applicant's listing remains unsuccessful and the recipient wishes to win another listing. It can happen. In order to solve this problem, any method other than the above-mentioned specific example (for example, means for discriminating the listing of the applicant who wishes to receive and the seller of an exhibitor other than the applicant) For example, a method of allowing a lower limit price to be set for the lowest successful bid price of an exhibitor other than the applicant who wants to receive the information. When using a method in which a lower limit price can be set for the lowest successful bid price of an exhibitor other than the recipient who wishes to receive, the range of the lower limit price can be set to a limit amount or less.

As described above, the fourth profit adjustment method (in the specific example, the seventeenth and eighteenth aspects of the present invention) provides an economic benefit provided as a prize even when a prize that cannot be easily procured is put on an auction. A function is realized that can suppress the rise in the amount within the limit and also provide a corresponding profit to the winner who wishes to receive it.

In the present invention, the operator does not know whether or not a strict legally stipulated limit is set as the limit. Also, the operation is not different depending on whether it is exact or not. Therefore, a business operator who uses the present invention can freely set a limit at his / her own discretion.

Characteristic principle of the present invention (in an auction dealing with prizes, by adding an exhibition based on a preset limit (or dividing profit), the price of the prize is suppressed to the limit or less. As long as it has (principle), any data structure and data processing other than the above specific examples may be used.

It is a figure which shows the classification | category of this invention. It is a block diagram which shows one structural example of the auction apparatus used for 1st this invention. It is a figure which shows one structural example of the exhibition data table used for 1st this invention. It is a figure which shows one structural example of the bid data table used for 1st this invention. It is a conceptual diagram explaining the price adjustment method from the past. It is a conceptual diagram explaining the 1st profit adjustment method in this invention. It is a processing figure showing an example of profit adjustment processing in the 1st present invention. It is a processing figure showing an example of n detecting means used for the 1st present invention. It is a processing figure showing an example of acquisition of _Sn and _{Sn + 1} . It is a processing figure showing an example of acquisition of _Bn and _{Bn + 1} . It is a processing figure showing an example of profit adjustment processing in the 2nd present invention. It is a conceptual diagram explaining the 2nd profit adjustment method in this invention. It is a processing figure showing an example of profit adjustment processing in the 3rd present invention. It is a processing figure showing an example of five X detection steps in the 3rd present invention. It is a processing figure showing a continuation of an example of five X detection steps in the 3rd present invention. It is a processing figure showing an example of five Y detection steps in the 3rd present invention. It is a processing figure showing a continuation of an example of five Y detection steps in the 3rd present invention. It is a conceptual diagram explaining the 1st another example of the 2nd profit adjustment method in this invention. It is a processing figure showing an example of profit adjustment processing in the 4th present invention. It is a processing figure showing an example of four X detection steps in the 4th present invention. It is a processing figure showing a continuation of an example of four X detection steps in the 4th present invention. It is a conceptual diagram explaining the 2nd another example of the 2nd profit adjustment method in this invention. It is a processing figure showing an example of four Y detection steps in the 5th present invention. It is a processing figure showing a continuation of an example of four Y detection steps in the 5th present invention. It is a conceptual diagram explaining the 3rd another example of the 2nd profit adjustment method in this invention. It is a conceptual diagram explaining the 4th another example of the 2nd profit adjustment method in this invention. It is a processing figure showing an example of profit adjustment processing in the 7th present invention. It is a processing figure showing an example of profit adjustment processing in the 8th present invention. It is a processing figure showing an example of profit adjustment processing in the 9th present invention. It is a processing figure showing an example of profit adjustment processing in the 12th present invention. It is a conceptual diagram explaining the 3rd profit adjustment method in this invention. It is a block diagram which shows the example of 1 structure of the auction apparatus used for 13th this invention. It is a block diagram which shows the example of 1 structure of the bid data preparation apparatus used for 13th this invention. It is a figure which shows the example of 1 structure of the exhibition data table used for 13th this invention. It is a figure which shows the example of 1 structure of the bid data table used for 13th this invention. It is a processing figure showing an example of profit adjustment processing in the 13th present invention. It is a processing figure showing an example of the exhibition step in the 13th present invention. It is a conceptual diagram explaining another example of the 3rd profit adjustment method in this invention. It is a processing figure showing an example of the exhibition step in the 15th present invention. It is a conceptual diagram explaining the 4th profit adjustment method in this invention. It is a block diagram which shows one structural example of the auction apparatus used for the 17th this invention. It is a figure which shows one structural example of the exhibition data table used for the 17th this invention. It is a figure which shows one structural example of the bid data table used for the 17th this invention. It is a processing figure showing an example of profit adjustment processing in the 17th present invention. It is a conceptual diagram explaining another example of the 4th profit adjustment method in this invention. It is a block diagram which shows the example of 1 structure of the auction apparatus used for the 18th this invention. It is a block diagram which shows one structural example of the exhibition data creation apparatus used for the 18th this invention. It is a processing figure showing an example of the exhibition means used for the 18th present invention. It is a block diagram which shows the example of 1 structure of the reception hope data preparation apparatus used for the 18th this invention. It is a figure which shows one structural example of the receiving desired data used for the 18th this invention. It is a figure which shows one structural example of the exhibition data table used for the 18th this invention. It is a figure which shows one structural example of the bid data table used for the 18th this invention. It is a processing diagram showing an example of the reception request processing in the 18th present invention.

Explanation of symbols

1000 Auction apparatus 1100 First storage means 1110 Management data 1111 ID
1112 limit 1200 second storage means 1210 exhibition data table 1210a ID
1210b Minimum successful bid price 1210c Quantity 1211 Exhibit data 1212 Exhibit data 121N Exhibit data 1300 Third storage means 1310 Bid data table 1310a ID
1310b Maximum bid price 1310c Quantity 1311 Bid data 1312 Bid data 131M Bid data 1400 Fourth storage means 1410 Successful bid price 1700 Pricing means 1710 Rearranging means 1720 n detecting means 1730 Successful bid price determining means 2000 Auction device 2100 First storage means 2110 Management data 2111 ID
2112 Limit amount 2200 Second storage means 2210 Exhibition data table 2210a ID
2210b Minimum successful bid price 2210c Quantity 2211 Exhibit data 2212 Exhibit data 221N Exhibit data 2300 Third storage means 2310 Bid data table 2310a ID
2310b Maximum bid price 2310c Quantity 2311 Bid data 2312 Bid data 231M Bid data 2400 Fourth storage means 2410 Successful bid price 2700 Pricing means 2710 Sorting means 2720 n detection means 2730 Successful bid price determining means 2800 Bid means 3000 Auction equipment 3100 1st Storage means 3110 management data 3111 ID
3112 Limit 3200 Second storage means 3210 Exhibition data table 3210a ID
3210b Minimum successful bid price 3210c Quantity 3211 Exhibit data 3212 Exhibit data 321N Exhibit data 3300 Third storage means 3310 Bid data table 3310a ID
3310b Maximum bid price 3310c Quantity 3311 Bid data 3312 Bid data 331M Bid data 3400 Fourth storage unit 3410 Successful bid price 3500 Fifth storage unit 3510 Amount received 3600 Sixth storage unit 3610 Acquisition amount 3700 Pricing unit 3710 Sorting unit 3720 n detection means 3730 successful bid price determination means 4000 auction apparatus 4100 first storage means 4110 management data 4111 ID
4112 Maximum amount 4113 Lower limit price 4200 Second storage means 4210 Exhibition data table 4210a ID
4210b Minimum successful bid price 4210c Quantity 4211 Exhibit data 4212 Exhibit data 421N Exhibit data 4300 Third storage means 4310 Bid data table 4310a ID
4310b Maximum bid price 4310c Quantity 4311 Bid data 4312 Bid data 431M Bid data 4400 4th storage means 4410 5th storage means 4500 5th storage means 4510 Amount received 4600 6th storage means 4610 Acquisition amount 4700 Pricing means 4710 Sorting means 4720 n detecting means 4730 successful bid price determining means 4800 exhibiting means 4900 receiving desired means 4910 receiving desired data 4911 ID
4912 Maximum bid price 4913 Quantity 5000 Network 6000 Bid data creation device 6100 Creation means 6200 Transmission means 7000 Exhibit data creation device 7100 Creation means 7200 Transmission means 8000 Receipt desired data creation device 8100 Creation means 8200 Transmission means

Claims (4)

An auction apparatus that manages one or a plurality of auctions using prizes provided by a business as an exhibit, and management data (the ID of the business of the auction and the auction for each auction) First storage means for storing data including at least the limit amount of the successful bid price), and exhibition data (ID and minimum successful bid price (however, the value of the lowest successful bid price is the limit of the management data of the first storage means) A second storage means for storing an exhibition data table capable of storing a plurality of data (including data including at least a value equal to or less than the amount of money) and a quantity (however, the value of the quantity is an integer value of 1 or more); A bid data table capable of storing a plurality of bid data (data including at least an ID, a maximum bid price, and a quantity (however, the quantity value is an integer value of 1 or more)) is stored. The third storage means, the fourth storage means for storing the winning bid price of the auction, and the fifth storage for storing the amount of money received (the amount of money that represents the right to receive the seller of the auction among the winning bid prices). Means, sixth storage means for storing the acquisition amount (the amount of money for the acquisition right of the operator of the auction among the winning bids), and the following three means: (1) the second storage means Sorting means for sorting the exhibition data of the exhibition data table in ascending order of the lowest bid price value, and sorting the bid data in the bid data table of the third storage means in descending order of the highest bid price value, (2) on the basis of the highest bid price and quantity of the lowest accepted bid price and quantity and bid data of exhibition data sorted by the sorting means, a maximum of n that satisfies the S _n ≦ B _n (However, the sort Q1 the value of the quantity of exhibition data in order from the top, q2, ..., and qr, S ₁ the value of the lowest bid price of the sorted listing data side by side from the beginning by the value of the quantity of and the exhibition data in the order _{, S 2, ..., S q1} , S q1 + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, S q1 + q2 + 2, ..., S q1 + q2 + ... + qr and, in the order of the value of the arranging of bid data that has been changed quantity from the beginning t1 , T2,..., Tu, and the highest bid price values of the sorted bid data are arranged in order from the top and by the quantity value of the bid data, so that B ₁ , B ₂ ,..., B _t1 , B _{t1 + 1} , B _{t1 + 2, ..., B t1} + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , and q1 + q2 + ... + qr = i, t1 + N detection means for detecting 2+... + Tu = j, and the range of n when n exists is 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n when n does not exist is n = 0) (3) Based on n detected by the n detecting means, at least the following four conditions; (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3- 3) P ≧ B _{n + 1} , (3-4) P is an arbitrary value (however, (3-1) is excluded when n = 0, and (3-2) is excluded when S _{n + 1} does not exist) If B _{n + 1} does not exist, any P satisfying (3-3) is determined as the winning bid price of the auction, and the determined winning bid is input to the fourth storage means A pricing unit having at least a price determining unit, wherein the management data is stored in the first storage unit. The exhibition data table is preliminarily input to the second storage means, zero or more exhibition data is preliminarily input to the exhibition data table of the second storage means, and the third storage means The auction apparatus in which the bid data table is input in advance, and zero or more bid data is input in advance in the bid data table of the third storage unit,
A winning bid price input step of inputting a winning bid price into the fourth storage means using the pricing means;
The value of the successful bid price in the fourth storage means is compared with the limit value of the management data in the first storage means, and if the value of the successful bid price is less than the limit value, the fifth Receiving the winning bid value to the storage means, and if the winning bid price exceeds the limit value, the received amount input step of inputting the limit value to the fifth storing means;
An acquisition amount input step of inputting to the sixth storage means a value obtained by subtracting the value of the received amount of the fifth storage means from the value of the winning bid price of the fourth storage means;
A profit adjustment method for an auction characterized by executing a profit adjustment process comprising: An auction apparatus that manages one or a plurality of auctions using prizes provided by a business as an exhibit, and management data (the ID of the business of the auction and the auction for each auction) First storage means for storing a limit amount of the winning bid price and a lower limit price of the lowest winning bid price of the auction (however, the value of the lower limit price is a value less than the limit value)) And exhibition data (ID and minimum winning bid price (however, the value of the lowest winning bid is not more than the limit value of the management data of the first storage means and not less than the lower limit price value of the management data of the first storage means) Second storage means for storing an exhibition data table capable of storing a plurality of data (including at least a quantity value) (where the quantity value is an integer value of 1 or more)) A third storage means for storing a bid data table capable of storing a plurality of bid data (data including at least an ID, a highest bid price, and a quantity (where the value of the quantity is an integer value of 1 or more)); A fourth storage means for storing the winning bid price of the auction; a fifth storing means for storing an amount of money received (amount of money that represents the right to receive the seller of the auction among the winning bid price); Sixth storage means for storing the auction operator's right of acquisition for the winning bid price) and the following three means: (1) Listing in the exhibition data table of the second storage means Sorting means for sorting data in ascending order of lowest bid price value, sorting means for sorting bid data in the bid data table of the third storage means in descending order of highest bid price value, (2) the sorting On the basis of the highest bid price and quantity of the lowest accepted bid price and quantity and bid data of exhibition data that has been sorted by the means, S _n ≦ B _n satisfy the maximum of n (however, the sorted quantity of exhibition data Q1, q2,..., Qr in order from the top, and the lowest bid price values of the sorted exhibition data are arranged in order from the top and by the value of the quantity of the exhibition data, S ₁ , S ₂ ,. _Sq1 , _{Sq1 + 1} , _{Sq1 + 2} ,..., _{Sq1 + q2} , _{Sq1 + q2 + 1} , _{Sq1 + q2 + 2} ,..., _{Sq1 + q2 + ... + qr.} B ₁ , B ₂ ,..., B _t1 , B _t by arranging the highest bid price values of the sorted bid data in order from the top and by the quantity value of the bid data. _{1 + 1} , B _{t1 + 2} ,..., B _{t1 + t2} , B _{t1 + t2 + 1} , B _{t1 + t2 + 2} ,..., B _{t1 + t2 +... + Tu} , q1 + q2 +. n ≤ i and 1 ≤ n ≤ j, and n detection means for detecting n when n does not exist) (3) at least the following based on n detected by the n detection means (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3-3) P ≧ B _{n + 1} , (3-4) P is an arbitrary value, ( However, (3-1) is excluded when n = 0, (3-2) is excluded when S _{n + 1} does not exist, and (3-3) is excluded when B _{n + 1} does not exist. Arbitrary P satisfying all is determined as the winning bid price of the auction A bid price determination means for inputting the determined winning bid price into the fourth storage means; and creating the exhibition data or creating the exhibition data networked with the auction apparatus. A minimum successful bid price value of the created or received exhibition data received from the apparatus, a limit value of the management data in the first storage means, and a lower limit price value of the management data in the first storage means. Comparing, at least when the value of the lowest successful bid price is less than or equal to the limit value and exceeding the value of the lower limit price, the exhibition means for inputting the exhibition data into the exhibition data table of the second storage means; Create desired receipt data (data including at least ID, maximum bid price, and quantity (however, the quantity value is an integer value of 1 or more)) or the desired receipt data A receiving request means for receiving data from a receiving request data creation device connected to a network, and the management data is preliminarily input to the first storage means, and the exhibition data table is input to the second storage means. Is entered in advance, zero or more of the exhibition data is inputted in advance into the exhibition data table of the second storage means, the bid data table is inputted in advance into the third storage means, An auction apparatus in which zero or more bid data is input in advance into a bid data table,
An acquisition step of acquiring reception request data using the reception request means;
Create any number of the exhibition data (where R is an arbitrary integer satisfying 1 ≦ R ≦ Q, and Q is the value of the quantity of the desired received data acquired in the acquisition step) For each of the R exhibition data, the following four steps:
(1) a step of setting an ID value of desired receipt data acquired by the acquisition step as an ID of the exhibition data;
(2) a step of setting a lower limit price value of the management data of the first storage means to the lowest successful bid price of the exhibition data;
(3) When the exhibition data is r-th of the R exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R), the quantity of the exhibition data _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q} 2 to, ..., and _{Q R,} r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R is, each 1 Taking the above values and setting any integer satisfying Q ₁ + Q ₂ +... + Q _R = Q, where Q is the value of the quantity of the desired received data acquired in the acquisition step),
(4) inputting the exhibition data into the exhibition data table of the second storage means;
A listing step to perform,
Create arbitrary U pieces of the bid data (where U is an arbitrary integer satisfying 1 ≦ U ≦ Q, and Q is the value of the quantity of desired received data acquired in the acquisition step) For each of the U bid data received, the following four steps:
(1) a step of setting the ID value of the desired data received in the acquisition step as the ID of the bid data;
(2) A step of setting a value of the sum of the limit value of the management data in the first storage means and the value of the highest bid price of the received desired data acquired in the acquisition step as the maximum bid price of the bid data ,
(3) When the bid data is u-th bid data (where u is an arbitrary integer satisfying 1 ≦ u ≦ U) among the U pieces of bid data, the quantity of the bid data Q _u (where Q _u is the u-th quantity among _U quantity Q ₁ , Q ₂ ,..., Q _U , and U quantity Q ₁ , Q ₂ ,..., Q _U is 1 respectively. Taking the above values and setting any integer satisfying Q ₁ + Q ₂ +... + Q _U = Q, where Q is the value of the quantity of the desired received data acquired in the acquisition step),
(4) inputting the bid data into the bid data table of the third storage means;
A bidding step to
A receipt request process consisting of:
A winning bid price input step of inputting a winning bid price into the fourth storage means using the pricing means;
The value of the successful bid price in the fourth storage means is compared with the limit value of the management data in the first storage means, and if the value of the successful bid price is less than the limit value, the fifth Receiving the winning bid value to the storage means, and if the winning bid price exceeds the limit value, the received amount input step of inputting the limit value to the fifth storing means;
An acquisition amount input step of inputting to the sixth storage means a value obtained by subtracting the value of the received amount of the fifth storage means from the value of the winning bid price of the fourth storage means;
A profit adjustment method for an auction, comprising: a profit adjustment process comprising: An auction apparatus that manages one or a plurality of auctions using prizes provided by a business as an exhibit, and management data (the ID of the business of the auction and the auction for each auction) First storage means for storing data including at least the limit amount of the successful bid price), and exhibition data (ID and minimum successful bid price (however, the value of the lowest successful bid price is the limit of the management data of the first storage means) A second storage means for storing an exhibition data table capable of storing a plurality of data (including data including at least a value equal to or less than the amount of money) and a quantity (however, the value of the quantity is an integer value of 1 or more); A bid data table capable of storing a plurality of bid data (data including at least an ID, a maximum bid price, and a quantity (however, the quantity value is an integer value of 1 or more)) is stored. The third storage means, the fourth storage means for storing the winning bid price of the auction, and the fifth storage for storing the amount of money received (the amount of money that represents the right to receive the seller of the auction among the winning bid prices). Means, sixth storage means for storing the acquisition amount (the amount of money for the acquisition right of the operator of the auction among the winning bids), and the following three means: (1) the second storage means Sorting means for sorting the exhibition data of the exhibition data table in ascending order of the lowest bid price value, and sorting the bid data in the bid data table of the third storage means in descending order of the highest bid price value, (2) on the basis of the highest bid price and quantity of the lowest accepted bid price and quantity and bid data of exhibition data sorted by the sorting means, a maximum of n that satisfies the S _n ≦ B _n (However, the sort Q1 the value of the quantity of exhibition data in order from the top, q2, ..., and qr, S ₁ the value of the lowest bid price of the sorted listing data side by side from the beginning by the value of the quantity of and the exhibition data in the order _{, S 2, ..., S q1} , S q1 + 1, S q1 + 2, ..., S q1 + q2, S q1 + q2 + 1, S q1 + q2 + 2, ..., S q1 + q2 + ... + qr and, in the order of the value of the arranging of bid data that has been changed quantity from the beginning t1 , T2,..., Tu, and the highest bid price values of the sorted bid data are arranged in order from the top and by the quantity value of the bid data, so that B ₁ , B ₂ ,..., B _t1 , B _{t1 + 1} , B _{t1 + 2, ..., B t1} + t2, B t1 + t2 + 1, B t1 + t2 + 2, ..., and _{B t1 + t2 + ... + tu} , and q1 + q2 + ... + qr = i, t1 + N detection means for detecting 2+... + Tu = j, and the range of n when n exists is 1 ≦ n ≦ i and 1 ≦ n ≦ j, and n when n does not exist is n = 0) (3) Based on n detected by the n detecting means, at least the following four conditions; (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3- 3) P ≧ B _{n + 1} , (3-4) P is an arbitrary value (however, (3-1) is excluded when n = 0, and (3-2) is excluded when S _{n + 1} does not exist) If B _{n + 1} does not exist, any P satisfying (3-3) is determined as the winning bid price of the auction, and the determined winning bid is input to the fourth storage means A pricing unit having at least a price determining unit,
A winning bid price input step of inputting a winning bid price into the fourth storage means using the pricing means;
The value of the successful bid price in the fourth storage means is compared with the limit value of the management data in the first storage means, and if the value of the successful bid price is less than the limit value, the fifth Receiving the winning bid value to the storage means, and if the winning bid price exceeds the limit value, the received amount input step of inputting the limit value to the fifth storing means;
An acquisition amount input step of inputting to the sixth storage means a value obtained by subtracting the value of the received amount of the fifth storage means from the value of the winning bid price of the fourth storage means;
An auction apparatus characterized by executing a profit adjustment process comprising: An auction apparatus that manages one or a plurality of auctions using prizes provided by a business as an exhibit, and management data (the ID of the business of the auction and the auction for each auction) First storage means for storing a limit amount of the winning bid price and a lower limit price of the lowest winning bid price of the auction (however, the value of the lower limit price is a value less than the limit value)) And exhibition data (ID and minimum winning bid price (however, the value of the lowest winning bid is not more than the limit value of the management data of the first storage means and not less than the lower limit price value of the management data of the first storage means) Second storage means for storing an exhibition data table capable of storing a plurality of data (including at least a quantity value) (where the quantity value is an integer value of 1 or more)) A third storage means for storing a bid data table capable of storing a plurality of bid data (data including at least an ID, a highest bid price, and a quantity (where the value of the quantity is an integer value of 1 or more)); A fourth storage means for storing the winning bid price of the auction; a fifth storing means for storing an amount of money received (amount of money that represents the right to receive the seller of the auction among the winning bid price); Sixth storage means for storing the auction operator's right of acquisition for the winning bid price) and the following three means: (1) Listing in the exhibition data table of the second storage means Sorting means for sorting data in ascending order of lowest bid price value, sorting means for sorting bid data in the bid data table of the third storage means in descending order of highest bid price value, (2) the sorting On the basis of the highest bid price and quantity of the lowest accepted bid price and quantity and bid data of exhibition data that has been sorted by the means, S _n ≦ B _n satisfy the maximum of n (however, the sorted quantity of exhibition data Q1, q2,..., Qr in order from the top, and the lowest bid price values of the sorted exhibition data are arranged in order from the top and by the value of the quantity of the exhibition data, S ₁ , S ₂ ,. _Sq1 , _{Sq1 + 1} , _{Sq1 + 2} ,..., _{Sq1 + q2} , _{Sq1 + q2 + 1} , _{Sq1 + q2 + 2} ,..., _{Sq1 + q2 + ... + qr.} B ₁ , B ₂ ,..., B _t1 , B _t by arranging the highest bid price values of the sorted bid data in order from the top and by the quantity value of the bid data. _{1 + 1} , B _{t1 + 2} ,..., B _{t1 + t2} , B _{t1 + t2 + 1} , B _{t1 + t2 + 2} ,..., B _{t1 + t2 +... + Tu} , q1 + q2 +. n ≤ i and 1 ≤ n ≤ j, and n detection means for detecting n when n does not exist) (3) at least the following based on n detected by the n detection means (3-1) S _n ≦ P ≦ B _n , (3-2) P ≦ S _{n + 1} , (3-3) P ≧ B _{n + 1} , (3-4) P is an arbitrary value, ( However, (3-1) is excluded when n = 0, (3-2) is excluded when S _{n + 1} does not exist, and (3-3) is excluded when B _{n + 1} does not exist. Arbitrary P satisfying all is determined as the winning bid price of the auction A bid price determination means for inputting the determined winning bid price into the fourth storage means; and creating the exhibition data or creating the exhibition data networked with the auction apparatus. A minimum successful bid price value of the created or received exhibition data received from the apparatus, a limit value of the management data in the first storage means, and a lower limit price value of the management data in the first storage means. Comparing, at least when the value of the lowest successful bid price is less than or equal to the limit value and exceeding the value of the lower limit price, the exhibition means for inputting the exhibition data into the exhibition data table of the second storage means; Create desired receipt data (data including at least ID, maximum bid price, and quantity (however, the quantity value is an integer value of 1 or more)) or the desired receipt data A receiving request means for receiving from a receiving device and a receiving request data creation device connected to the network.
An acquisition step of acquiring reception request data using the reception request means;
Create any number of the exhibition data (where R is an arbitrary integer satisfying 1 ≦ R ≦ Q, and Q is the value of the quantity of the desired received data acquired in the acquisition step) For each of the R exhibition data, the following four steps:
(1) a step of setting an ID value of desired receipt data acquired by the acquisition step as an ID of the exhibition data;
(2) a step of setting a lower limit price value of the management data of the first storage means to the lowest successful bid price of the exhibition data;
(3) When the exhibition data is r-th of the R exhibition data (where r is an arbitrary integer satisfying 1 ≦ r ≦ R), the quantity of the exhibition data _{Q r} (however, _{Q r} is the R quantity _{Q 1, Q} 2 to, ..., and _{Q R,} r th quantity of the, R-number of quantity _{Q 1, Q 2, ...,} Q R is, each 1 Taking the above values and setting any integer satisfying Q ₁ + Q ₂ +... + Q _R = Q, where Q is the value of the quantity of the desired received data acquired in the acquisition step),
(4) inputting the exhibition data into the exhibition data table of the second storage means;
A listing step to perform,
Create arbitrary U pieces of the bid data (where U is an arbitrary integer satisfying 1 ≦ U ≦ Q, and Q is the value of the quantity of desired received data acquired in the acquisition step) For each of the U bid data received, the following four steps:
(1) a step of setting the ID value of the desired data received in the acquisition step as the ID of the bid data;
(2) A step of setting a value of the sum of the limit value of the management data in the first storage means and the value of the highest bid price of the received desired data acquired in the acquisition step as the maximum bid price of the bid data ,
(3) When the bid data is u-th bid data (where u is an arbitrary integer satisfying 1 ≦ u ≦ U) among the U pieces of bid data, the quantity of the bid data Q _u (where Q _u is the u-th quantity among _U quantity Q ₁ , Q ₂ ,..., Q _U , and U quantity Q ₁ , Q ₂ ,..., Q _U is 1 respectively. Taking the above values and setting any integer satisfying Q ₁ + Q ₂ +... + Q _U = Q, where Q is the value of the quantity of the desired received data acquired in the acquisition step),
(4) inputting the bid data into the bid data table of the third storage means;
A bidding step to
A receipt request process consisting of:
A winning bid price input step of inputting a winning bid price into the fourth storage means using the pricing means;
The value of the successful bid price in the fourth storage means is compared with the limit value of the management data in the first storage means, and if the value of the successful bid price is less than the limit value, the fifth Receiving the winning bid value to the storage means, and if the winning bid price exceeds the limit value, the received amount input step of inputting the limit value to the fifth storing means;
An acquisition amount input step of inputting to the sixth storage means a value obtained by subtracting the value of the received amount of the fifth storage means from the value of the winning bid price of the fourth storage means;
And a profit adjustment process.

Images