EP3417416A1 - Method and system for sealed bid auctions - Google Patents
Method and system for sealed bid auctionsInfo
- Publication number
- EP3417416A1 EP3417416A1 EP16890421.7A EP16890421A EP3417416A1 EP 3417416 A1 EP3417416 A1 EP 3417416A1 EP 16890421 A EP16890421 A EP 16890421A EP 3417416 A1 EP3417416 A1 EP 3417416A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- bidder
- bid
- auction
- price
- bidders
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/08—Auctions
Definitions
- the present disclosure relates to auctions and, more specifically, to a method and system for sealed bidding in online auctions.
- the method allows for vendors to either transfer ownership rights or share possession rights for the auctioned subject, wherein the auctioned subject may be tangible or intangible and include anything that may have a value for example, goods, skills, services, space, or financial resources, etc. It can be used on broad spectrum of electronic devices, including but not limited to computers, mobile device and tablets, etc.
- the method disclosed herein may be applied in live auctions.
- Open auctions are such where bids are broadcast to all participants. Open auctions may be of ascending-bid (English) or descending-bid (Dutch) model. In an ascending-bid auction model properties of value are offered up for bidding, and the winner is the last bidder that offers the highest price after a certain amount of time.
- the descending-bid auction is an auction model where the property of value begins at a higher asking price, which is lowered by the auctioneer until the bidder accepts.
- One of the major advantages of the open auctions is that the bidders see each other's bids, which makes the auction transparent. However, there are many negative impacts associated with transparency for disclosing the bid amounts in open auctions.
- Bid shielding occurs when a high value bid is withdrawn at the last minute of the auction to allow a lower bid to be accepted.
- Bid shilling introduces the tactics of artificially high bids in order to increase the price to force the bona fide bidders to pay more for the properties they want to buy.
- Bid shading occurs when the bidder knowingly places a bid that is below or above what they believe the auctioned property is actually worth. The purpose of shading is to mislead other bidders on the actual price of the item.
- Bid sniping is last minute bidding with the intent of preventing other bidders from responding and outbidding the price. Software is apparently available to aid in the practice.
- Indecent bidders are hard to detect on the Internet because from the appearance alone it is not easy to identify the difference between indecent and bona fide bidders.
- all online auction systems have a fixed bid close time, "bid sniping" may occur within any open bid system and a bidder can legally bid anytime between the first second through the last second of the auction. It is almost impossible to identify who is a bona fide bidder and who is an indecent bidder if the "bid sniping" occurs in the last second of the auction.
- Many open auction online websites claim to have measures to detect and remove the indecent abusers. Although there are measures in place to prevent fraudulent or unfair activities in online auctions, currently available systems and methods are not effective.
- user-reporting suspicious bidding activity are too slow and involve too many variables to create favorable results for bona fide bidders.
- User-reporting measures involve investigations which may take more time than can be afforded for the bidders as an auction may end before the issues are resolved. Additionally, too many variables are considered when determining if a user is abusing the system. Furthermore, bona fide bidders may not have enough evidence to show another user is cheating. Even with laws that impose fines or even jail time for illegal or fraudulent bidding, the anonymity provided by the internet allows a massive amount of fraudulent activities to still take place.
- Sealed-bid auctions may vary depending on what winning price is paid for the item and there are sealed-bid first-price and sealed-bid second-price auction methods.
- the traditional form of sealed-bid auction is a first-price auction, where the highest bid wins the auction.
- first-price auctions buyers may face several problems.
- Winner's curse is one of common issues not only in open bid first-price auctions but also in sealed-bid auctions.
- “Winner's curse” often occurs when the winning bid amount in an auction exceeds the intrinsic value of the auctioned subject. It is especially true for buyers and/or winners with limited knowledge about the auctioned properties who may overpay for items due to lack of experience and improper market valuation of the auctioned items.
- the sealed second-price auction (Vickrey)
- the winner pays not the highest winning price, but the second-highest price placed for the auctioned property. It means that the bidder placing the highest bid for the property will win the auction but will only be required to pay the second-highest price placed for an item, which is naturally lower than the highest winning bid and may potentially reflect the real value of the auctioned property.
- This type of auction has some attractive features, for example, lesser amount of "winner's curse", as bidders may place their bids without being concerned about overpaying for the property.
- sealed-bid second-price auction has an issue of the inherent deficiency, where bidders may be artificially increasing the bid without consideration of the real value of the auctioned item. Since the winning bidder only pays a second- highest bid amount, indecent bidders often use this tactic to win the auction. This may discourage bona fide bidders who bid the real perceived value of the property from participating in the auction, because it is very hard for bona fide bidders who bid realistic amounts to win against the indecent bidders who artificially inflate the price they bid. Another shortfall of this method is remorse of the second-highest bidder, who doesn't win the auction but whose price is used as a real value of the item without any sort of reward.
- the sealed-bid second-price method has inherent logical flaw, as the winner does not actually pay the price that the winner bid. Instead, the winner ends up paying the price bid by others, specifically the second-highest bid amount. And the bidder with the second-highest bid amount ends up with nothing, but will have his/her bid used as the referenced amount of payment for the winning bidder.
- This method is unfair to bona fide bidders who submit reasonable bid amounts because another indecent bidder may submit a bid with an artificially high amount in order to win the auction.
- bidders who submit second-highest bid amount may come to believe they are just a tool for providing reasonable prices without receiving anything in return. For example, one stamp is a collectible which currently often appears in online auction platforms.
- the goal of the present invention is to offer an auction platform that would offer more equal winning opportunities to bidders based on more fair bidding system and method.
- Exemplary embodiments of the present invention may classify the users into two different categories - vendors and bidders depending on the purpose of participating in the auction.
- "Vendor” or “vendors” is the party of the auction that makes tangible and/or intangible auctioned subjects of value available to bidder or bidders and get paid if the auction is successful.
- tangible auctioned subject means any type of subject that has a physical form and monetary value. It may include but is not limited to goods, machinery, buildings, land, space, inventory, etc.
- intangible auctioned subject means something that has a monetary value which individuals, business entities, non-profit organizations and/or government agents can have ownership or possession rights which do not have a physical form but have monetary value and can transfer such rights temporarily to somebody else, such as services or skills.
- "Bidder” or "bidders” is the party of the auction that places bids for the auctioned subject and the winning bidder pays the vendor for the value of the auctioned subject.
- a system for sealed bidding in an auction comprising: a server in communication with at least one of a plurality of vendors at a vendor computing device and at least one of a plurality of registered bidders at a bidder computing device through a communication network, wherein the server receives at least one auction request for at least one auctioned subject from at least one vendor computing device, the auction request having at least one description of the auctioned subject and a time duration of the auction input by at least one registered vendor into the vendor computing device and the server presents at least one auction based on at least one auction request to the plurality of registered bidders from at least one bidder computing device; at least one sealed bid received in at least one bidder computing device during the time duration of the auction and communicated to the server, wherein the at least one sealed bid includes a bid amount for the auctioned subject; a random bidder ID assigned by the server to each of the at least one sealed bids received from at least one bidder computing device during the time
- random IDs will be assigned for the registered bidders to bid and the bidders will self-determine himself/herself into two mainly different bidding categories, either as a bidding category one bidder or a bidding category two bidder.
- a bidding category one bidder pays the full winning bid amount and a bidding category two bidder has a chance for the recalculation of the final winning bid amount due to "price-protection policy" that they commit to pay before bidding.
- the recalculation is based on a "price-protection formula", where the final winning bid amount is calculated using: a "price-protection fee", a second-highest bid amount, and a pre-determined percentage of the difference between the winning bid and the second-highest bid amount.
- the method further comprises receiving at least one auction request for at least one auctioned subject in a server from at least one vendor computing device having at least a description of the auctioned subject and a time duration of the auction; presenting an auction based on the auction request to a plurality of bidder computing devices; receiving at least one sealed bid in one of the bidder computing devices during the time duration of the auction and communicating each sealed bid to the server, wherein the at least one sealed bid includes a bid amount for the auctioned subject; assigning a random bidder ID by the server to each of the at least one sealed bids received from at least one bidder computing device during the time duration of the auction; creating a data record for each of the at least one sealed bids and storing the data record in the server, the data record containing at least one random bidder ID, at least one actual bidder ID, at least one timestamp and at least one bid amount; and determining by the server the winning bid at the end of the time duration of the auction according to the data record for each of the at least one sealed bids.
- Figure 1A depicts a system architecture according to exemplary embodiments of the present invention
- Figure 1 B depicts the database according to exemplary embodiments of the present invention
- Figure 2 depicts a data record according to exemplary embodiments of the present invention
- Figure 3 depicts a computing device according to exemplary embodiments of the present invention
- Figure 4 depicts a computing device according to exemplary embodiments of the present invention.
- Figure 5A depicts the bidding process, from the bidder's side according to exemplary embodiments of the present invention
- Figure 5B depicts the continuation of the bidding process from the bidder's side according to exemplary embodiments of the present invention.
- Figure 5C depicts the process of distribution of the "price-protection fee" according to exemplary embodiments of the present invention.
- Figure 6A depicts the bidding process from the vendor's side according to exemplary embodiments of the present invention.
- Figure 6B depicts a continuation of the bidding process from the vendor's side according to exemplary embodiments of the present invention
- Figure 6C depicts a continuation of the bidding process from the vendor's side according to exemplary embodiments of the present invention.
- Figure 7 depicts the process of determining the winning bidder when there are more than one identical highest winning bid amounts.
- CEB includes but is not limited to sharing, lending, and renting, etc.
- the CEB can be categorized as sharing goods, sharing skills (i.e. professional or personal service skills), sharing spaces (i.e. sharing residential or office space), and sharing services, such as sharing of transportation (i.e. sharing car service), sharing financial resources (i.e. money lending) and sharing other items that are completely different from the above categories, if any, for auctions.
- sharing skills i.e. professional or personal service skills
- sharing spaces i.e. sharing residential or office space
- sharing services such as sharing of transportation (i.e. sharing car service), sharing financial resources (i.e. money lending) and sharing other items that are completely different from the above categories, if any, for auctions.
- Exemplary embodiments of the present invention provide a platform for sharing of any of the above resources that may have monetary value. Since sharing of resources implies a level of personal interaction at some points, the bidders may be subject to pre-approval by vendors before they can submit their bids and before the auction begins
- a vendor may be able to list a property of value for auction that may be in high demand and solicit bids from bidders who may have a need for sharing such goods. As sharing occurs without the transfer of ownership which may imply some risks, there may be a pre-approval procedure of bidders. Consequently, the winning bidder and vendor can come to an agreement through the method and system disclosed herein in the auction on the amount of the payment for sharing. Winning bidders may frequently recycle the usage of the property of value through exemplary embodiments of the present invention.
- vendors may provide individuals with certain expertise or a certain set of skills that may become in high demand by bidders when resources are low. Depending on the demand, bidders may submit bids to win the desired skills the vendor may possess. Details of the sharing, such as, for example, bidders' eligibility, may be subject of pre-approval by vendors. Consequently, the winning bidder and vendor can come to an agreement through the method and system disclosed herein in the auction on the amount of the payment and for sharing. For example, a talented and popular singer whose singing skills are in high demand could auction his/her skills to perform at the private party or special events. The bidder who offers the highest bid amount compared to other bidders, would win the auction and enjoy the singer's performance at their parties, for example, Christmas or New Years.
- a vendor may be able to list a space in which the vendor has the rights to possess but does not necessarily own the space. Vendors are able to solicit bids from bidders who may have a need to rent out or sub-lease the space at a certain location for a certain period of time. The winning bidder and vendor can come to an agreement through the method and system disclosed herein in the auction on the amount of the payment and for sharing. For example, in a holiday season when some of the hotel rooms are in high demand by visitors, hotels may auction their available inventory. That would not only allow the hotels to sell their rooms, but also obtain best possible prices since there would be many people looking for accommodation during holidays or special events, for example, Soccer World Cup. This method would be mutually beneficial for vendors and bidders, as vendors would obtain best possible price for their available space and bidders would be given opportunities to get the desired space, as long as they can offer the highest price for it.
- a vendor may list a ride sharing proposal with details of such proposal within an auction, for example, to share a ride with a bidder from point A to point B at a specific time.
- the bidders may be subject of pre-approval by vendor before participation in the auction. Bidders who are interested in sharing the ride submit their bids for the price they would like to pay.
- a vendor who is interested in lending money may list in an auction the details for a loan, including a certain amount of money with a certain duration.
- Bidders who are interested in loaning money may be subject to be pre-approved by the vendor before they bid. They may be able to bid to obtain the loan if the winning bidder can afford higher interest rate than others. And the winning bidder and vendor can come to an agreement through the method and system disclosed herein for the loan interest, etc. in the auction.
- the present invention further provides a system for online sealed bid auctions, mitigation of risks related to online auctions and optimization of vendor-bidder benefits.
- Bidders and vendors herein may include, but are not limited to various types of users such as individuals, business entities, not for-profit organizations or government agents or, etc.
- the system integrates a means for maintaining one or more of the databases, wherein such databases include but are not limited to vendor's and bidder's information without disclosing bidders' real IDs, information about auctioned tangible and/or intangible auctioned subject, and the database of successful transactions within specific period of time.
- the database serves as a reference point to potential bidders and vendors about the price of the previously auctioned subject, especially when the bidders and vendors lack adequate knowledge and experience.
- Users of the system who want to participate in online auctions may register for an account with the system, which includes a user agreement with the relevant rules as preset for both vendors and bidders prior to the start of the auction.
- Registering an account includes personally identifiable information as well as valid financial information. This may include, but is not limited to, name, address, email, phone number, and valid financial information.
- User accounts will be verified by the system through email or phone. Exemplary embodiments of the system will only allow users to register one account by email and/or phone number with a username. Such account can be used to bid or list the auctioned subject for auction. To prevent fraud in creating multiple accounts, the system will require a genuine name, genuine address and genuine financial information in order to register the account.
- Users of the system may be required to include financial information such as a debit card, credit card, third- party payment systems such as PayPalTM or SquareTM, and/or bank account details.
- Financial information is needed to confirm that bidders have enough money in their account to pay the amount of the sealed bid they submit. Verifying payment by confirming the buyer's financial capabilities will avoid default or delayed payments after the auction ends. This avoids issues that include but are not limited to delayed payment, buyers who bid purely for enjoyment, bidders who do not have enough money to pay, and buyers who cancel the transaction by non-payment after the auction ends.
- the system promotes bidders to submit bids only for amounts they are confirmed to have, thereby preventing the cancellation of transactions and unable to pay after auctions are completed on the basis that the bidding was erroneous, etc.
- Exemplary embodiments allow vendors to list auctioned subject offered for auction through an online auction platform. Vendors must register their auctioned subject for the online auction by submitting an introduction about the details of the auctioned subject, which may include but is not limited to written descriptions, photos, videos, etc. Any deficiencies must also be disclosed to avoid misrepresentations or fraud.
- the vendor's ID or username will be disclosed with the auction listing and will be disclosed when providing feedback after the transaction is completed at the end of the auction.
- the system will issue an index number for each auction subject that is listed and will also issue a timestamp for the start time of the auction. The system will track the auction until the end of the time duration of the auction as preset by the vendor.
- the vendor must provide double confirmation by confirming that the auction subject is ready to be delivered or performed once the auction concludes and proper payment is made, for example, if the auctioned items are goods, they will be delivered to the winning bidder, unless there are special circumstances beyond vendor's control, such as natural disasters, war, etc.
- the vendor must confirm that the starting or reserve price he/she sets for the auctioned subject is indeed the price he/she is willing to accept as a starting or reserve price. This prevents a vendor from cancelling the transaction after the auction ends by making excuses where the vendor cannot locate the property or claiming that he/she made a mistake while setting a starting or reserve price.
- the vendor's account may be suspended for a certain period, for example one month for the first time or the vendor's account may be suspended permanently if it occurs a second time, excluding certain circumstances and force majeure.
- bidders When bidding, normally visible aspects of the auction, for example, the bidder's username and other bidder-identifying information will not be shown. Instead, bidders will be listed in the order they bid using randomly generated ID numbers by the system, which will not be accessible to other bidders except bidders themselves even after the auction is finished. Once the auction is finished, only the vendor will be able to see the real ID of the winning bidder. Other bidders will only be able to see the bid amounts of other bidders without seeing their real IDs. The bidding times for each sealed bid will have a timestamp which is displayed to track the bids in the auction. Users will be able to see the applicable remaining time left for the auction regardless of where the user is located.
- a randomly generated numbers matched to each bidder that is unidentifiable eliminates the public disclosure of bidders' identities and the chance for others to potentially emotionally bid on the auction based on past interactions with the same bidders. Emotional bidding can lead to skewed prices that do not reflect real value.
- random bidder IDs may prevent or reduce "sh ill bidding", "collusion”, etc. as it will be impossible to identify bidders, their previous bidding activities and interests based on their IDs. Vendors will not be able to see identities of bidders and as such manipulate the winning price by asking friends or relatives etc. to submit unreal bids to inflate the price of the auctioned item before the end of the auction.
- the bidding process for sealed bids within the auction allows for honesty and integrity when listing for auction or submitting bids. Vendors will need to disclose their usernames and be known to potential bidders. Additionally, emotional bidding or indecent bidders who often shill bid, etc. will be taken away because bidders are not identifiable when using randomly generated ID numbers. However, the system will still allow a vendor to block a particular ID number from bidding if the vendor chooses to do so because that particular bidder was causing problems in previous transactions. When the vendor indicates an ID number they would like to block, the system will be able to match the ID number with the respective bidder and block the bidder from bidding within that auction.
- the sealed bids will not show the bid amounts to other bidders during the auction and before the end of the auction. Bidders may then bid a realistic amount that reflects their expectations and only an amount they have the capability to pay. Bidders must provide double confirmation by verifying the bid amount is accurate and after submitting their bid amount they need to verify the capability of paying the bid amount with any applicable shipping costs, insurance, etc. Therefore, there will be no discrepancies or argument that the bidder made a mistake on the amount when bidding. This method of receiving confirmation is necessary to provide some risk to indecent bidders, which may include any or all of the above indecent bidders described above, because there will be a potential cost involved with bidding without the intent to actually pay.
- the system will suspend their accounts indefinitely as payment cannot be made, unless the vendor and/or administrator of the system allows otherwise.
- the transaction must be completed within a certain amount of time, for example, within ten days of the auction ending. If the transaction is not completed within the certain time, except certain circumstances and force majeure, the system may suspend the defaulted party for a certain period of time, for example 30 days for the first incident. If there is a second incident, where the same party defaults to either provide or pay for services or goods, such defaulted party may be suspended permanently. Therefore, there should be no incidents of transactions not being completed timely as both vendors and bidders will have confirmed their respective capabilities for the auction. Once the auction ends and the winning bidder is determined, the winning bid price along with all the other submitted bid amounts will be revealed to all bidders.
- Exemplary embodiments of the present invention allow bidders to have only one valid bid amount, which however could be changed by adding more, lowering the amount of the bid and then re-submitting the bid again before the end if the auction. Additionally, bidders may withdraw their bid before the auction ends. Furthermore, withdrawn and/or changed bids will still remain sealed so others will not be aware of the withdrawn or changed bidding IDs and/or amounts. By keeping withdrawn or changed bids confidential the system prevents the bidders to use these withdrawn and changed bids as reference and also can eliminate misrepresentation or fraud. Exemplary embodiments of the present invention allow vendors to contemplate the real value they expect to receive from the proceeds of the auction and list the price they honestly believe auctioned subject is worth. This results in encouraging those users who are bona fide and have the capability to pay the amount to submit sealed bids and possibly win the auction without being concerned with being cheated.
- exemplary embodiments of the present invention can substantially prevent "bid shilling", “bid shielding", “bid sniping” and “collusion”, etc. because nobody knows who are the bidders, who is the highest bidder and what are the bid amounts during the auction, or the one who bids at the last second will not necessarily be the actual winning bidder at the end of the auction.
- a reserve price is a hidden minimum price that the vendor is willing to accept for a property.
- the vendor is only obligated to sell the property once the bid amount meets or exceeds the reserve price.
- the downside of this concept is that the bidders don't see the hidden price and are left to constantly speculate about the amount of the hidden reserve price, which oftentimes results in a failed auction as the bidders cannot reach the reserve price because they bid too low.
- Exemplary embodiment of the present invention differentiates from the prior art in a way that it allows the vendors to either set an open reserve price or a conditional hidden reserve price, at the vendor's discretion.
- the open reserve price is the minimum price the vendor will accept in order for the auction to be successful, which will be disclosed to the bidders.
- the vendor chooses to set an open reserve price, he open reserve price would be disclosed to the bidders prior the start of the auction to make the bidders aware of the minimum price accepted by the vendor. All bids below the open reserve price would be rejected by the system.
- the open reserve price would not allow for premature termination unless a pre-determined set of circumstances warrant the premature termination, as bidders are aware of the minimum reserve price since it is open, and can only submit bids that equal or exceed the reserve price preset by the vendor.
- conditional hidden reserve price is: first, the system allows the vendor to terminate the auction early or continue until the end of the auction if one of the bidders reaches or exceeds the reserve price set by the vendor. Second, the system would allow for the bids to be accepted even if the bids don't reach the conditional hidden price set by the vendor and the highest submitted bid amount would be considered a winning bid. This method of providing two categories for reserve prices is more efficient and transparent than the prior art because it allows auctions to still be completed successfully thereby reducing the chances for the auction to fail due to bidders' speculated bid amounts that don't reach undisclosed hidden reserve price set by the vendor.
- sealed-second price method with or without the one bid increment increase that is used by prior art is deficient because it may deprive all other bona fide bidders from winning as the winning bidder may potentially submit an artificially high bid amount to win the auction.
- sealed second-highest bid amount has been established as a base value that the winning bidder pays.
- the highest sealed price may be one bid increment more than the second-highest sealed bidder's bid amount.
- One bid increment is the amount by which the current highest bid must be raised by the bidder to win the auction.
- Bid increment is a pre-determined amount prescribed by the rules of the auction where the auction has a preset table of bid increments depending on the property's beginning or current price in the auction, such as $ 0.5, $1 , $5, or $10.
- one bid increment approach is not effective because the final winning amount to be paid is often times not substantially related to the final winning bid amount.
- the fact that the winner may only have to pay one increment value more than the second-highest winning price, may induce indecent bidders to place artificially high bid amounts with the sole purpose of winning the auction.
- Such indecent bidders do not have to take responsibility for paying the amounts they bid and therefore do not fear facing financial consequences of their artificially high bid amounts.
- the embodiment of the present invention intends to resolve this deficiency.
- the winning bidder is responsible for paying either the full amount of the winning bid or a certain percentage of the winning bid plus the amount of the second-highest bid. Since the winning bid amount is directly related to the amount the winner pays, the bidders are less likely to place artificially high bids.
- Exemplary embodiments of the present invention provide a method through computing system to divide the bidders into two categories, such as a bidding category one bidder and a bidding category two bidder, wherein a bidding category one winning bidder is required to pay the submitted sealed bid amount and wherein a bidding category two bidder is committed to buy a "price-protection policy" to have a chance of reducing the final winning bid amount.
- the bidder should self-determine or classify himself/herself either as a bidding category one or a bidding category two bidder based on his/her own experience, preference, in consideration of the auction strategies or as randomly chosen by the bidder.
- the name of the bidding category can be flexible, such as bidding category A and B, "experienced” and “inexperienced” or any other names to identify two different categories of bidders.
- Exemplary embodiments of the present invention divide the bidders into bidding category one and bidding category two bidders: A bidding category one bidder will be responsible for the winning bid amount, while bidding category two bidder may be able under certain conditions to enjoy the potential benefit of paying the reduced price with the purchase of the "price-protection policy".
- Exemplary embodiments may offer a "price- protection policy" at a certain percentage of the submitted bid amount (e.g.
- a bidder who confirms to be a bidding category one bidder when bidding for one auctioned subject, may identify himself/herself as a bidding category two bidder during the auction or when bidding for another auctioned subject in another auction. Accordingly, a bidding category one bidder who confirms the bid amount based on his/her own experience, preference or in consideration of auction strategies or as randomly chosen by the bidder should bid with confidence and have no regrets about the payment obligations if he/she is the winning bidder after the auction ends. Similarly, a bidding category two bidder who commits to pay the "price-protection fee" may feel comfortable bidding with the possibility of obtaining a potential discount if he/she is the winning bidder after the auction ends.
- the winning final price paid by a bidding category two winning bidder is calculated by the sum of: the "price- protection fee", the second-highest bid amount, and the amount from a pre-determined percentage of the difference of the winning bid amount and the second-highest bid amount.
- Bidders will have to confirm which bidding category they belong to before they start to bid and may change their bidding category before the end of the auction. The bidder will then be responsible for the amount of bid they submitted according to the bidding category they belong to.
- Bidding category one bidders will be responsible for the full submitted bid amount, whereas bidding category two bidders will have a chance for paying a reduced amount of the winning bid due to the "price-protection policy”.
- the final amount of the winning bid may be recalculated according to the "price-protection formula", where the winning final price paid by a bidding category two winning bidder is calculated by the sum of: the "price-protection fee", the second-highest bid amount, and the amount from a predetermined percentage of the difference of the winning bid amount and the second- highest bid amount.
- the system may provide the option for vendors to determine who will be awarded the fee for "price-protection policy".
- the fee paid for the "price-protection policy” may be entirely awarded to the vendor, entirely awarded to second-highest bidders wherein the "price-protection policy" fee amount is split between all second- highest bidders by the pre-determined percentage, or it may be split by the predetermined percentage between the vendor and second-highest bidder(s).
- the vendor is confident that the auctioned subject will attract many bidders, he/she may choose to keep the entire amount of the "price-protection fee”.
- the vendor wants to attract more bidders to participate in the auction for the auctioned subject, he/she may decide to award the entire "price-protection fee" to second-highest bidder(s). Therefore, even if the vendor receives less than the original winning bid because the bidder purchased the policy, the vendor will still have an option to receive a portion of the "price-protection fee" payment in addition to the recalculated winning bid amount. Additionally, the bidding category two bidders may bid without having to worry about overpaying for the auctioned subject, which will ultimately promote participation in the auction.
- the bidder if there is only one bidder placing the bid for the auctioned subject and the bidder identifies himself/ herself as a bidding category two bidder, the entire amount of the "price-protection fee" goes to the vendor and the starting price of the vendor is considered as the second-highest bid amount.
- Price-protection policy three examples are provided herein: Example One.
- a bidder for example, Bidder 1 , confirms he/she is a bidding category two bidder, submits a bid of $100 and pays a "price-protection fee", which may be 5% of the $100 (i.e. $5.00).
- the pre-determined percentage applicable to the winning bid is indicated as 20% for the difference between the winning price and second-highest bid amount, for example.
- Another bidder for example Bidder 2 confirms he/she is a bidding category one bidder and submits a bid of $50, which is the second-highest bid amount.
- Bidder 3 confirms he/she is a bidding category one bidder, submits a bid of $40.
- Bidder 1 is the winning bidder and the winning bid amount is calculated according to the above formula of the method where Bidder 1 pays: second-highest bid amount + [20% * (winning bid amount - second-highest bid amount)]. Therefore, Bidder 1 ends up paying: $50 + [20% * ($100 - $50)], which is $60.
- Bidder 1 's total cost for the auctioned item is now the $60 final price and the $5.00 "price-protection fee", which is a grand total of $65.
- Bidder 1 basically pays a total of $65 when Bidder 1 originally submitted a bid for $100, therefore saving $35.
- Bidder 3 ends up not winning and therefore no policy fees will be deducted from his/her account.
- Example Three Assume yet again the same situation in Example One, where Bidder 1 bids $100 and pays the $5.00 "price-protection fee”. Bidder 2 bids $80. Bidders 1 , who is the winning bidder at the end of the auction will pay: $80 + [20% * ($100-$80)], which is $84. Bidder 1's total costs for the auctioned subject is now the $84 and the $5.00 "price-protection fee", which is a final grand total of $89. Bidder 1 this time saves $11 but does not receive a significantly lower amount compared to Example One.
- exemplary embodiments of the present invention prevent the bidders who may bid artificially high amounts in order to win the auction without paying for the price that he/she bids because the present invention requires the bidder to pay full amount they bid or uses a certain pre-determined percentage between the winning amount and the second-highest bid amount.
- Bidders will be deterred from bidding artificially high and be prevented from overbidding because the higher the bid amount, the more money the bidder will have to pay in the end.
- Exemplary embodiments of the present invention will reflect a more realistic value of what the winning bidder should pay and also deter bidders from making artificial sealed bid amounts.
- Bidders who win will also be less likely to state they think they overpaid for the item if they are categorized as a bidding category one bidder, because the bidders will have an option to bid as a bidding category two bidders and have the final win amount recalculated, which may result in a potential discount.
- the "winner's curse" may be substantially reduced as a result.
- the bids may be required to be submitted in dollar amounts with two decimal spaces after the dollar amount (e.g. $25.78).
- the bidders may re-bid again within specific period of time pre-determined by the system.
- the two highest bidders who bid the same price are of two different categories (e.g. one is a bidding category one bidder and the other bidder is a bidding category two bidder)
- the final price for both bidders may be calculated and the bidder with the highest final price may be determined to be the winning bidder in this situation. Determining the winning bidder based on the highest final price in this situation will preserve fairness in that the person paying the most will be the winning bidder.
- Notifications may be sent by the system through the server to both vendor computing devices and/or bidder computing devices through emails, instant messages, voice messages, etc. when necessary to alert them of different occurrences, including but not limited of a successfully submitted bid, relevant time duration for the auction, rejected bids, auction wins, auction results, etc.
- the above system is used to provide a platform to facilitate at least one or multi-sided matching auction markets, where bidders may simultaneously bid from one or multiple vendors and vendors may solicit to one or multiple bidders, wherein each transaction is facilitated against a fee or commission.
- the system also comprises means for determining the costs associated with one or more risk elements of the transaction, wherein the means utilize the bidders' information to identify the highest bid and the second-highest bid amount, the cost of the "price-protection policy" for bidding category two users, as well as the final amount the winning bidder has to pay.
- the system or the platform may charge a certain percentage of service fees for providing auction services.
- the present invention may also utilize a data verification module in online auction. This would verify at least four major data sets through the system: 1) identify bidders and vendors; 2) identify that data submitted to the auction is accurate; 3) verify the winning bidder; and 4) verify completion of transaction, etc.
- ID Verification One of the problems that arise in online auctions is that of information asymmetry due to the fact that transactions are completely anonymous. To resolve the anonymity problem, the system may allow vendors and bidders to become "ID Verified" by paying a small fee to have their identity confirmed by a credit information company. Doing so may reassure the users that their counterparties, bidders and vendors, are verified since their identity is known, and there is more assurance that the users could be tracked down should a problem arise. Verification that Data Submitted to Auction is Correct. Receipt and Safeguarding of Bids. All bids received before the time set for the opening of bids are kept secure. The bids are not opened or viewed by seller or administrator and remain in restricted-access electronic bid box.
- the bid was withdrawn, it remains in the bid box until the auction is finished.
- Information concerning the identity and number of bids received is made available only to the administrator of the auction. Opening of bids.
- the bid opening time is preset by the vendor before the auction.
- the system verifies the accuracy of the bids. All bids shall be submitted in acceptable numerical format.
- the bids are verified by the system in the manner that precludes the possibility of a substitution, addition, deletion, or alteration in the bids. Recording of bids. All bids are completed and certified as to its accuracy by the bid system as soon after bid verification is complete. Where bid items are too numerous to warrant complete recording of all bids, abstract entries for individual bids may be limited to item numbers and bid prices.
- Bids shall be available for viewing wherein the real IDs of the bidders are coded/ encoded. Rejection of bids. After bids have been opened, award is made to that responsible bidder who submitted the highest responsive bid according to exemplary embodiments of the present invention, unless there is a compelling reason to reject all bids and cancel the auction. Every effort shall be made to anticipate changes before the opening of the auction and to notify all prospective bidders of any resulting modification or cancellation of the auctioned item. This will permit bidders to change or withdraw their bids and prevent unnecessary exposure of bid prices. As a general rule, after the opening of bids, an auction should not be cancelled and re-solicited. Award should be made on the initial bid invitation for bids and the additional quantity should be treated as a new acquisition.
- invitations for bid may be cancelled and all bids rejected before award but after opening when, it has been determined that- (1) Specifications have been revised; (2) The auctioned subject of value no longer available due to circumstances beyond vendor's control; (3) No bids have been received; (4) For other reasons, cancellation is clearly in the public's interest. Verification of completion of transaction. The winning bidder and the vendor would have to confirm that transaction was successfully completed by both parties: 1) The vendor received the payment for the auctioned subject 2) The bidder received the auctioned subject.
- a server (102) in communication with at least one of a plurality of vendors at a vendor computing device (e.g. 108, 1 14) and at least one of a plurality of registered bidders at a bidder computing device (e.g. 106, 1 10, 1 12) through a communication network (e.g. Internet (100)).
- the server (102) receives an auction request for an auctioned subject from a vendor computing device (e.g.
- the auction request having at least a description of the auctioned subject and a time duration of the auction input by at least one registered vendor into the vendor computing device and the server presents an auction based on the auction request to the plurality of registered bidders at a bidder computing device (106, 1 10 and 1 12); at least one sealed bid (200) may be received in a bidder computing device (e.g.
- the at least one sealed bid (200) includes a bid amount for the auctioned subject;
- a random bidder ID (202) may be assigned by the server (102) to each of the at least one sealed bids (200) received in a bidder computing device (106, 110 and 112) during the time duration of the auction;
- a data record (210) for each of the at least one sealed bids is stored in the server, the data record (210) containing at least the random bidder ID (202), an actual bidder ID (204), a timestamp (206) and a bid amount (208);
- the server (102) in communication with at least one of a plurality of registered vendors and at least one of a plurality of registered bidders through a communication network (e.g.
- the Internet (100) determines the winning bid at the end of the time duration of the auction according to the data record (210) for each of the at least one sealed bids.
- the server may have a database (104).
- the bidder computing device (300) may have an internal clock mechanism (302) that automatically identifies and communicates to the server (102) the timestamp (206) for each of the at least one sealed bids (200). The timestamp is used to determine the sequence of submitted bids.
- Each of the bidder computing devices (300) may also have a display (304) and be any computing device known in the art. For example, a smartphone, tablet, personal computer or any other computing device.
- the vendor computing device (400) an example of which is depicted in Figure 4, may have a display (402) and may be any computing device.
- the database (104) contains data related to the bidding process that includes but is not limited to: detailed information on tangible auctioned subjects (1 16); detailed information on intangible auctioned subjects (1 18); transaction data (122) which is divided based on the nature of the auctioned subject.
- the database also contains previous successful transactions with winning prices (120); bidding data (124) (e.g. bid history, prices, timestamps); users' data (126) (e.g. user profiles, financial information, auction history, sealed winning bidder ID information); and other transaction data (128).
- the database may be connected to and queried by vendors and bidders from a vendor computing device (108) or a bidder computing device (106) to obtain relevant information such as references about historical transactions and prices of the auctioned subjects.
- the historical transactions within the database may provide a price reference to at least one of the plurality of registered bidders or the plurality of registered vendors about at least one previously auctioned subject of value in case the bidders lack sufficient knowledge and experience about the properties they intend to bid on, or in case the vendors need references for listing reserve prices within auctions.
- the database can be queried for searches by at least one of the plurality of registered bidders or the plurality of registered vendors about at least one previously auctioned properties of value without disclosing the actual bidder ID of the winning bidders.
- Each of the at least one sealed bids may be securely stored in the server during the time duration of the auction; at the end of the auction bid amounts and the timestamps are displayed to the plurality of bidders, the actual bidder IDs are not displayed.
- the system may have a means for maintaining one or more of the databases, wherein such databases include but are not limited to winning bidders' and vendors' information without disclosed real ID (also referred to as an actual bidder ID), information about auctioned tangible and/or intangible auctioned subjects, and the database of successful transactions within specific period of time.
- databases include but are not limited to winning bidders' and vendors' information without disclosed real ID (also referred to as an actual bidder ID), information about auctioned tangible and/or intangible auctioned subjects, and the database of successful transactions within specific period of time.
- exemplary embodiments of the present invention allow bidders to register with the system (Step S500) before submitting bids for an auction.
- the user account is verified (Step S502) and registered bidders must select a bidding category (Step S504) based on experience, preference, in consideration of auction strategies, or as randomly chosen by the bidder, etc.
- a bidder who selects to be a bidding category two bidder may commit to pay a fee to purchase the "price-protection policy" for his/her winning bid (Yes, Step S508).
- Step S510 the bidder may begin to bid as a bidding category one bidder on the auction by entering a bid amount to submit to the system (Step S518). If the bidder chooses no (No, Step S508), then the bidder's ability to bid on the auction will end (Step S514).
- a bidder who selects to be a bidding category one bidder may begin bidding by entering a bid amount (Step S518).
- the bidder regardless if a bidding category one or bidding category two bidder, will then confirm the bid amount is accurate and then also confirm the bidder's financial ability to pay the entered bid amount and affiliated costs, which is the bidder's double confirmation (Step S520). If the bidder does not confirm either the bid amount or the financial ability to pay (No, Step S520), then the bidder will be notified by the system that the bid will be rejected (Step S522).
- the bidder may choose to change (Yes, Step S524) by confirming the bid amount and financial ability to pay (Step S528).
- Step S524 If the bidder still chooses to not confirm the bid amount and financial ability to pay (No, Step S524), then the bidder is precluded from bidding (Step S526). If the bidder confirms the bid amount and the financial ability to pay the submitted bid amount (Step S528), then the bid amount is accepted and entered within the system (Step S538) and assigns a random ID number and bid timestamp (Step S540).
- the system will query whether the submitted bid amount is lower than the starting price set by the vendor (Step S530). If the bid amount is lower than the starting price set by the vendor (Yes, Step S530), then the system will automatically reject the bid (Step S532) and allow the bidder to change the bid amount to no lower than the starting price set by the vendor (Step S534). If the bidder refuses to change their bid amount, then the system will make a final rejection of the bid (Step S536). After the bidder changes the bid amount, the system will once again query whether the submitted bid amount is lower than the starting price set by the vendor (Step S530).
- Step S530 If the submitted bid amount is not lower than the starting price (No, Step S530), then the system will accept the submitted bid amount and enter it for the auction within the bidding system (Step S538) and the bidder's ID will be sealed. Since all accepted bid amounts are sealed, the bidder and bid amount will be assigned a random identification number and a timestamp indicating when the bid was accepted by the system in the auction (Step S540).
- a bidder is allowed to change the submitted bid amount before the auction ends (Step S542). However, every bidder is allowed to submit only one valid bid. If the bidder does not change their submitted bid (No, Step S542), then the system determines the submitted bid to be the only valid bid (Step S544). If the bidder decides to change their submitted bid (Yes, S542), then the bidder may change the previous bid and re-enter a new bid amount and re-submit again (Step S548). If the bidder does not change the bid anymore, the system will determine the re-entered submitted bid to be the only valid bid (Step S550).
- Step S546 the auction will end.
- the bid amounts will be opened to the participants of the auction (Step S546), the system will determine if the bidder won the auction. If the bidder wins the auction and is a bidding category one bidder (Yes, category one, Step S552), then the bidder who won will pay the exact bid amount submitted for the auction plus related costs, if any such as shipping fees, etc. (Step S556).
- Step S552 If the bidder wins the auction and is a bidding category two bidder (Yes, category two, Step S552), then the bidder who won will pay a final price that is determined after applying the "price- protection formula" plus related costs, if any (Step S558). If the system determines that the bidder did not win (No, Step S552), then the bidder loses the auction and no payment will be made by the bidder (Step S554). After the bidder wins the auction and pays the final price, the vendor delivers the auctioned subject to the winning bidder (Step S560). After the auctioned subject has been delivered to the winning bidder, the parties may rate each other (Step S562). That concludes the transaction (Step 564).
- the final price is determined by applying the "price-protection formula" (Step S566).
- the "price-protection formula” is calculated by the sum of: the "price-protection fee", the second-highest bid amount, and the amount from a pre-determined percentage of the difference of the winning bid amount and the second-highest bid amount. (Step S568), then the system determines who will receive the "price-protection fee" (Step S570), which is preset by the vendor. The entire "price-protection fee” may be allocated to the vendor (Step S572) or to the second-highest bidder (Step S574).
- the system further determines the number of second-highest bidders. If there is only one second- highest bidder (Yes, Step S576), then the entire amount of the "price-protection fee" is allocated to the only one second-highest bidder (Step S578). If there are several second-highest bidders (No, Step S576), then the entire amount of the "price-protection fee” is split between all second-highest bidders by a pre-determined percentage (Step S580). Another option is when the "price-protection fee" is split (Step S582) between the vendor and the second-highest bidders by a pre-determined percentage.
- Step S584 one pre-determined portion of the "price-protection fee" is allocated to the vendor (Step S584); the rest of the portion of the "price-protection fee” is allocated to the second- highest bidder (Step S586).
- Step S588 the system further determines if there is only one second-highest bidder (Step S588). If the system determines that there is only one second-highest bidder (Yes, Step S588), then the rest of the portion of the "price- protection fee" is allocated to the only one second-highest bidder (Step S592).
- Step S590 the rest of the portion of the "price-protection fee" is allocated to the vendor (Step S590). If there is more than one second-highest bidder (No, more than one, Step S588), then the rest of the portion of the "price-protection fee" is split between all of the second-highest bidders (Step S594) by a pre-determined percentage.
- exemplary embodiments of the present invention allow vendors to register (Step S600) an account with the system.
- the vendor Before setting up the details of the auction, the vendor will be subject to verification by the system (Step S602). After verification by the system is complete, the vendor may post an auction request (Step S604).
- the vendor may input a description of the property, the time frame for the time duration of the auction, and specify if there are any pre-approved bidders (Step S606).
- the vendor decides who receives the "price-protection fee" (Step S608).
- the vendor may then specify whether the auction involves a transfer of ownership (Step S610).
- Step S610 If the auction involves a transfer of ownership (Yes, Step S610), then the vendor intends to sell the auctioned subject at the auction (Step S612). If the auction does not involve a transfer of ownership (No, Step S610), then the vendor intends to share the possession rights for the auctioned subject for a specified period of time at the auction (Step S614).
- Step S616 the vendor may set up a reserve price by discretion. If the vendor chooses to not set up a reserve price (No, Step S616), then he/she may set up any nominal starting price, such as $1.00, etc., the time frame, including the starting time and the end time of the auction (Step S618). The system will issue a timestamp (Step S618) for such listing with the unique index number to identify different listings. The system will then start to accept bids (Step S658), in which the bid amount cannot be lower than the starting price until the end of the auction (Step S660).
- Step S662 the system processes all of the bids to select the preliminary winning bid amount by the system.
- the vendor may choose between a conditional hidden reserve price (Step S620) or an open reserve price (Step S638). If the vendor chooses the open reserve price option (Step S638), then the system will advise the bidders of the reserve price before the bidders start to bid in the auction (Step S640).
- the auction begins with the timestamp and the time frame (Step S642) and the system receives bids from bidders (Step S644).
- Step S646 If the bids are below the reserve price (Step S646), then the bids are rejected by the system (Step S648) and no transaction occurs (Step S650). If the bids are equal to or above the reserve price (Step S652), then the bids are accepted by the system (Step S654). In both cases the premature termination by the vendor is not allowed (Step S656), unless a predetermined set of circumstances warrant the premature termination. If vendor chooses to set a conditional reserve price (Step S620), then the reserve price is not disclosed to bidders (Step S622).
- the vendor sets up a starting price (Step S624) and the system will notify the bidders about the possibility of the auction's premature termination by the vendor when auction starts with the time frame and time stamp (Step S626).
- the system starts accepting bids from the bidders (Step S628).
- the system will query whether the reserve price was exceeded by the bid amounts (Step S630). If the reserve price was exceeded (Yes, Step S630), then the auction is subject to premature termination as preset by the vendor (Step S628).
- the system will notify the vendor that the reserve price had been met and the vendor may choose to terminate the auction.
- the vendor may also set up the system that auction is terminated automatically as soon as the reserve price is met.
- Step S630 If the bids do not meet the reserve price, (No, Step S630), the system still accepts such bids from bidders (Step S632) in the system. If the bids are below the reserve price (Step S634), then the system will continue to accept bids from bidders. After the bids are accepted by the system (Step S636) until the auction ends (Step S660), the system processes all the bids to select the preliminary winning bid amount (Step S662).
- Step S662 the system selects the preliminary winning bid amount (Step S662).
- the preliminary winning bid amount is subject to change (Step S664) which may be adjusted depending on the self-determined bidding category. If the winning bidder is a bidding category one bidder (Step S666), then the vendor receives the full winning bid amount (Step S668) and the auction is completed (Step S684). If the winning bidder is a bidding category two bidder (Step S670), then the system calculates the final price by using the "price-protection formula" (Step S672).
- the "price-protection formula" is calculated (Step S674) as a sum of a pre-determined portion of the "price- protection fee” (Step S676), a second-highest bid amount (Step S678), and a predetermined percentage of the difference between the winning bid amount and the second-highest bid amount (Step S680). Therefore, the vendor will receive the sum of the above (Step S682). After that the auction is completed (Step S684), the winning bidder pays the final winning bid amount plus any applicable additional costs, if any (Step S686). Vendor delivers the auctioned subject (Step S688), both parties may rate each other (Step S690) and the transaction ends (Step S692).
- the system will determine the winning bidder with the highest bid amount (S700). The system determines if there are identical bid amounts (S702). If there are no identical bid amounts (No, Step S702), then the system chooses the highest bid (S704). If there are more than one identical bid amounts (Yes, Step S702), then the system determines whether they are same bidding category of bidders (Step S706) or different categories of bidders (Step S714).
- the term "same bidding category of bidders" means that at least two bidders belong to bidding category one or bidding category two.
- Step S706 If identical bid amounts are from bidders of same categories (Step S706), then the system prompts the bidders to re-submit the bids (Step S708) within the pre-determined timeframe. If the bidders re-submit the bids (Yes, Step S708), then the highest re-submitted bid wins (Step S710).lf the bidders don't re-submit the bids (No, Step S708) within the pre-determined timeframe, then the bidder who submitted original bid in the previous round first wins (Step S712). If the bidders with identical amounts are from different categories (Step S714), then the system calculates the final amount (Step S716). The bidder whose bid is the highest winning amount depending on final calculation wins (Step S718). Winning bidder pays the final winning amount (Step S720).
- the method described herein can be executed on a computing device and/or computer system, generally comprised of a central processing unit (CPU) that is operatively connected to a memory device, data input and output circuitry (IO) and computer data network communication circuitry.
- Computer code executed by the CPU can take data received by the data communication circuitry and store it in the memory device.
- the CPU can take data from the I/O circuitry and store it in the memory device.
- the CPU can take data from a memory device and output it through the IO circuitry or the data communication circuitry.
- the data stored in memory may be further recalled from the memory device, further processed or modified by the CPU in the manner described herein and restored in the same memory device or a different memory device operatively connected to the CPU including by means of the data network circuitry.
- the memory device can be any kind of data storage circuit or magnetic storage or optical device, including a hard disk, optical disk or solid state memory.
- Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held, laptop or mobile computer or communications devices such as cell phones and PDA's, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
- Source code may include a series of computer program instructions implemented in any of various programming languages (e.g., an object code, an assembly language, or a high-level language such as FORTRAN, C, C++, JAVA, or HTML) for use with various operating systems or operating environments.
- the source code may define and use various data structures and communication messages.
- the source code may be in a computer executable form (e.g., via an interpreter), or the source code may be converted (e.g., via a translator, assembler, or compiler) into a computer executable form.
- the invention may be described in the general context of computer- executable instructions, such as program modules, being executed by a computer.
- program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types.
- the computer program and data may be fixed in any form (e.g., source code form, computer executable form, or an intermediate form) either permanently or transitorily in a tangible storage medium, such as a semiconductor memory device (e.g., a RAM, ROM, PROM, EEPROM, or Flash-Programmable RAM), a magnetic memory device (e.g., a diskette or fixed hard disk), an optical memory device (e.g., a CD-ROM or DVD), a PC card (e.g., PCMCIA card), or other memory device.
- a semiconductor memory device e.g., a RAM, ROM, PROM, EEPROM, or Flash-Programmable RAM
- a magnetic memory device e.g., a diskette or fixed hard disk
- an optical memory device e.g., a CD-ROM or DVD
- PC card e.g., PCMCIA card
- the computer program and data may be fixed in any form in a signal that is transmittable to a computer using any of various communication technologies, including, but in no way limited to, analog technologies, digital technologies, optical technologies, wireless technologies, networking technologies, and internetworking technologies.
- the computer program and data may be distributed in any form as a removable storage medium with accompanying printed or electronic documentation (e.g., shrink wrapped software or a magnetic tape), preloaded with a computer system (e.g., on system ROM or fixed disk), or distributed from a server or electronic bulletin board over the communication system (e.g., the Internet or World Wide Web.)
- ROM read- only memory
- the software components may, generally, be implemented in hardware, if desired, using conventional techniques.
- the invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network.
- program modules may be located in both local and remote computer storage media including memory storage devices.
- Practitioners of ordinary skill will recognize that the invention may be executed on one or more computer processors that are linked using a data network, including, for example, the Internet.
- different steps of the process can be executed by one or more computers and storage devices geographically separated by connected by a data network in a manner so that they operate together to execute the process steps.
- a user's computer can run an application that causes the user's computer to transmit a stream of one or more data packets across a data network to a second computer, referred to here as a server.
- the server may be connected to one or more mass data storage devices where the database is stored.
- the server can execute a program that receives the transmitted packet and interpret the transmitted data packets in order to extract database query information.
- the server can then execute the remaining steps of the invention by means of accessing the mass storage devices to derive the desired result of the query.
- the server can transmit the query information to another computer that is connected to the mass storage devices, and that computer can execute the invention to derive the desired result.
- the result can then be transmitted back to the user's computer by means of another stream of one or more data packets appropriately addressed to the user's computer.
- Exemplary embodiments of the present invention may be also applicable in live auctions where sealed bids may be used in both online and live auctions to maximize the benefits for bidders and vendors.
- Bidders in a live sealed bid auction may self- determine within two different categories, for example a bidding category one or a bidding category two bidder, prior to submitting their sealed bids.
- Bidders who are self- determined to be bidding category two bidders may commit to purchase the "price- protection policy" by submitting a check or paying a deposit in a sealed manner, for example, in a sealed envelope.
- the bidders would be required to submit their sealed bids through a machine that would automatically or manually assign each bidder a random ID number and a clock machine may issue a timestamp.
- the bidding category would be recorded together with the sealed bid amounts before the submission of the envelopes to the place designated by the vendors or auctioneer's, such as the envelope deposit box.
- the relevant rules in a live sealed bid auction may be preset for both vendors and bidders prior to the start of the auction.
- the auctioneer and/or other related personnel from the auction organization may calculate the final price and select the winning bidder based on the calculated final prices.
- the method of "price-protection policy" used for live auctions is identical to the one used in online auctions.
- the bidders submit sealed bids that are opened at the end of the auction and bidders are not aware about bids submitted by other bidders.
- Bidders will have to confirm which bidding category they belong to before they start to bid in a live auction and may change their bidding category before the end of the auction.
- the winning bidder pays the final price according to whether he/she is a bidding category one or bidding category two bidder.
- Bidding category one bidders will be responsible for the full submitted bid amount, whereas bidding category two bidders will have a chance to recalculate the winning bid amount due to the "price-protection policy".
- the final amount of the winning bid may be recalculated according to the "price-protection formula", which is the sum of a "price- protection fee", a second-highest bid amount, and a pre-determined percentage of the difference between the winning bid and the second-highest bid amount.
- the auction may provide the option for vendors to determine who will be awarded the fee for "price-protection policy" prior to the start of the auction.
- bidders will be notified about who will receive the "price- protection fee" before the auction begins. As a practical matter, knowing that the second- highest bidders may be able to receive the entire or the partial amount of the "price- protection fee" may attract more bidders to participate in live auctions.
- the winning bidder pays the final price and related costs, such as service fees, taxes, shipping fees, if any, and the vendor will deliver the auctioned subject. The auction transaction is then completed.
Landscapes
- Business, Economics & Management (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
Claims
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/IB2016/050890 WO2017141074A1 (en) | 2016-02-19 | 2016-02-19 | Method and system for sealed bid auctions |
Publications (2)
Publication Number | Publication Date |
---|---|
EP3417416A1 true EP3417416A1 (en) | 2018-12-26 |
EP3417416A4 EP3417416A4 (en) | 2019-07-10 |
Family
ID=59625688
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP16890421.7A Withdrawn EP3417416A4 (en) | 2016-02-19 | 2016-02-19 | Method and system for sealed bid auctions |
Country Status (14)
Country | Link |
---|---|
EP (1) | EP3417416A4 (en) |
JP (1) | JP6839185B2 (en) |
KR (1) | KR20180113971A (en) |
CN (1) | CN108496195A (en) |
AU (1) | AU2016393168A1 (en) |
CA (1) | CA3003562C (en) |
IL (1) | IL258930A (en) |
MX (1) | MX2018004967A (en) |
MY (1) | MY202250A (en) |
PH (1) | PH12018500891A1 (en) |
RU (1) | RU2708789C2 (en) |
SG (1) | SG11201803465WA (en) |
WO (1) | WO2017141074A1 (en) |
ZA (1) | ZA201803418B (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110326017A (en) * | 2016-10-03 | 2019-10-11 | 欧佩科技股份公司 | The system and method for reversed sealed bid auction |
AU2018338645A1 (en) * | 2017-09-27 | 2020-05-07 | Wang, Kevin Sunline | Method and system for online auctions |
JP7196137B2 (en) * | 2020-07-30 | 2022-12-26 | バインフォー・インコーポレイテッド | Sealed-bid auction method and system |
CN113205399B (en) * | 2021-05-21 | 2023-07-14 | 中国联合网络通信集团有限公司 | Electronic bidding method, first bidding node equipment and neutral third party node equipment |
CN117592458B (en) * | 2024-01-19 | 2024-04-05 | 辽宁省网联数字科技产业有限公司 | Digital bidding document blind box analysis method and system based on artificial intelligence |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7702540B1 (en) * | 1995-04-26 | 2010-04-20 | Ebay Inc. | Computer-implement method and system for conducting auctions on the internet |
JP2002049790A (en) * | 2000-08-01 | 2002-02-15 | Digital Check:Kk | System and method for auction transaction |
US20020116316A1 (en) * | 2001-02-21 | 2002-08-22 | Peter Griffiths | Auction manager system and method of operation |
US20030041010A1 (en) * | 2001-08-23 | 2003-02-27 | Mark Yonao-Cowan | Online bidding for contracts |
US20030074330A1 (en) * | 2001-10-11 | 2003-04-17 | Nokia Corporation | Efficient electronic auction schemes with privacy protection |
US20030105709A1 (en) * | 2001-12-03 | 2003-06-05 | Edward Orlando | Internet auction site with immediate payment processsing |
KR100494302B1 (en) * | 2003-03-27 | 2005-06-10 | 송승준 | On-line auction system and the method for the same |
US7895087B1 (en) * | 2004-04-26 | 2011-02-22 | The Jellyvision Lab, Inc. | Method and system for providing an on-line auction |
US7398229B2 (en) * | 2004-06-04 | 2008-07-08 | Isis Innovation Limited | System and method for conducting electronic commerce |
US7752120B2 (en) * | 2004-06-14 | 2010-07-06 | Accenture Global Services Gmbh | Auction insurance system |
US7792723B2 (en) * | 2005-02-07 | 2010-09-07 | Liquid Markets Inc | Synthetic continuous double auctions |
US20070050290A1 (en) * | 2005-08-31 | 2007-03-01 | Transitiondynamics International, Inc. | System and method for anonymized disclosure of corporate data in electronic negotiations |
US7797187B2 (en) * | 2006-11-13 | 2010-09-14 | Farecast, Inc. | System and method of protecting prices |
US20090177555A1 (en) * | 2008-01-02 | 2009-07-09 | Milgrom Paul R | Assignment exchange and auction |
RU78342U1 (en) * | 2008-07-29 | 2008-11-20 | Эмиль Хагаевич Шальмиев | AUCTION SYSTEM |
US8341032B2 (en) * | 2009-06-18 | 2012-12-25 | Michlitsch Kenneth J | Methods for transforming an auctioned item of unknown value and buyer into an auctioned item of known value and buyer |
US8799037B2 (en) * | 2010-10-14 | 2014-08-05 | Palto Alto Research Center Incorporated | Computer-implemented system and method for managing motor vehicle parking reservations |
US10235688B2 (en) * | 2010-12-24 | 2019-03-19 | First Data Corporation | Web and mobile device advertising |
EA021508B1 (en) * | 2011-08-24 | 2015-07-30 | Открытое Акционерное Общество "Инфотекс" | Method of protected data exchange in e-auction and system for implementation thereof |
CN103854214B (en) * | 2012-11-28 | 2020-03-27 | 阿里巴巴集团控股有限公司 | Method and system for processing auction data |
-
2016
- 2016-02-19 AU AU2016393168A patent/AU2016393168A1/en not_active Abandoned
- 2016-02-19 EP EP16890421.7A patent/EP3417416A4/en not_active Withdrawn
- 2016-02-19 JP JP2018523023A patent/JP6839185B2/en active Active
- 2016-02-19 WO PCT/IB2016/050890 patent/WO2017141074A1/en active Application Filing
- 2016-02-19 SG SG11201803465WA patent/SG11201803465WA/en unknown
- 2016-02-19 CA CA3003562A patent/CA3003562C/en active Active
- 2016-02-19 KR KR1020187014942A patent/KR20180113971A/en unknown
- 2016-02-19 RU RU2018119336A patent/RU2708789C2/en active
- 2016-02-19 MY MYPI2018701660A patent/MY202250A/en unknown
- 2016-02-19 CN CN201680063828.9A patent/CN108496195A/en active Pending
- 2016-02-19 MX MX2018004967A patent/MX2018004967A/en unknown
-
2018
- 2018-04-25 IL IL258930A patent/IL258930A/en unknown
- 2018-04-26 PH PH12018500891A patent/PH12018500891A1/en unknown
- 2018-05-23 ZA ZA2018/03418A patent/ZA201803418B/en unknown
Also Published As
Publication number | Publication date |
---|---|
MY202250A (en) | 2024-04-19 |
PH12018500891A1 (en) | 2018-10-29 |
JP2019507399A (en) | 2019-03-14 |
CA3003562A1 (en) | 2017-08-24 |
AU2016393168A1 (en) | 2018-05-10 |
MX2018004967A (en) | 2019-04-09 |
RU2018119336A3 (en) | 2019-11-25 |
SG11201803465WA (en) | 2018-05-30 |
ZA201803418B (en) | 2019-07-31 |
EP3417416A4 (en) | 2019-07-10 |
KR20180113971A (en) | 2018-10-17 |
CA3003562C (en) | 2023-05-09 |
WO2017141074A1 (en) | 2017-08-24 |
JP6839185B2 (en) | 2021-03-03 |
IL258930A (en) | 2018-06-28 |
RU2018119336A (en) | 2019-11-25 |
CN108496195A (en) | 2018-09-04 |
RU2708789C2 (en) | 2019-12-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20220180426A1 (en) | Method and system for sealed bid auctions | |
US8498925B2 (en) | Public offering risk management | |
JP7233767B2 (en) | System and method for reverse bidding auction | |
CA3003562C (en) | Method and system for sealed bid auctions | |
US20070027792A1 (en) | Online auction system | |
US8606679B1 (en) | Methods and systems for online real estate transactions | |
EA011308B1 (en) | Method and system for optimal pricing and allocation | |
US20190080394A1 (en) | Method and system for online auctions | |
US20090248563A1 (en) | Method and apparatus for on-line auctions | |
US20180018732A1 (en) | System and method for reverse sealed bid auctions | |
JP7180904B2 (en) | Method and system for online auction | |
JP7196137B2 (en) | Sealed-bid auction method and system | |
US20130024314A1 (en) | Method of selling items | |
KR20210045946A (en) | Method and system for auctioning share of product | |
US20230368283A1 (en) | Method and system for online auctions | |
US20220172281A1 (en) | System and method for reverse sealed bid auctions | |
US20080147532A1 (en) | System and Methods for Transferring Tax Credits | |
US20220414773A1 (en) | System and Method to Create and Trade Securities from Equity | |
JP2024054459A (en) | Program and document generation device | |
Morris | SECURITIES EXCHANGE ACT OF 1934 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20180528 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
A4 | Supplementary search report drawn up and despatched |
Effective date: 20190613 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06Q 30/00 20120101AFI20190606BHEP Ipc: G06Q 40/00 20120101ALI20190606BHEP Ipc: G06Q 40/04 20120101ALI20190606BHEP Ipc: G06Q 40/06 20120101ALI20190606BHEP Ipc: G06Q 30/08 20120101ALI20190606BHEP |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20190808 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION HAS BEEN WITHDRAWN |
|
18W | Application withdrawn |
Effective date: 20200519 |
|
APBK | Appeal reference recorded |
Free format text: ORIGINAL CODE: EPIDOSNREFNE |
|
APAF | Appeal reference modified |
Free format text: ORIGINAL CODE: EPIDOSCREFNE |