CN108496195A - The method and system of sealed auction of submitting a tender - Google Patents
The method and system of sealed auction of submitting a tender Download PDFInfo
- Publication number
- CN108496195A CN108496195A CN201680063828.9A CN201680063828A CN108496195A CN 108496195 A CN108496195 A CN 108496195A CN 201680063828 A CN201680063828 A CN 201680063828A CN 108496195 A CN108496195 A CN 108496195A
- Authority
- CN
- China
- Prior art keywords
- bidder
- price
- auction
- bid
- tender
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 75
- 230000004224 protection Effects 0.000 claims abstract description 93
- 238000012790 confirmation Methods 0.000 claims abstract description 10
- 230000009977 dual effect Effects 0.000 claims abstract description 9
- 230000008569 process Effects 0.000 claims description 16
- 238000007789 sealing Methods 0.000 claims description 14
- 230000008859 change Effects 0.000 claims description 13
- 238000004891 communication Methods 0.000 claims description 12
- 230000007246 mechanism Effects 0.000 claims description 5
- 238000009826 distribution Methods 0.000 claims description 3
- 238000003860 storage Methods 0.000 description 14
- 238000012546 transfer Methods 0.000 description 13
- 238000005516 engineering process Methods 0.000 description 12
- 230000007547 defect Effects 0.000 description 9
- 235000014277 Clidemia hirta Nutrition 0.000 description 8
- 230000002860 competitive effect Effects 0.000 description 6
- 238000004590 computer program Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 5
- 230000000873 masking effect Effects 0.000 description 5
- 238000012795 verification Methods 0.000 description 5
- 238000005553 drilling Methods 0.000 description 4
- 235000013399 edible fruits Nutrition 0.000 description 4
- 244000033714 Clidemia hirta Species 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 210000000056 organ Anatomy 0.000 description 3
- 230000008520 organization Effects 0.000 description 3
- 239000000047 product Substances 0.000 description 3
- 201000009032 substance abuse Diseases 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000012797 qualification Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 241000144080 Alestes Species 0.000 description 1
- 241001269238 Data Species 0.000 description 1
- 241000282553 Macaca Species 0.000 description 1
- 241000208125 Nicotiana Species 0.000 description 1
- 235000002637 Nicotiana tabacum Nutrition 0.000 description 1
- 239000006227 byproduct Substances 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 230000006378 damage Effects 0.000 description 1
- 238000013524 data verification Methods 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 description 1
- 239000010931 gold Substances 0.000 description 1
- 229910052737 gold Inorganic materials 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 244000144972 livestock Species 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000036651 mood Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000007639 printing Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 239000011435 rock Substances 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 235000015170 shellfish Nutrition 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
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/08—Auctions
-
- 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
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
The invention discloses the system and method for the sealed bid executed by computer equipment auction, and wherein auction system includes sealed bid, distributes random ID to the bidder for not disclosing true ID, and obtains the dual confirmation of bidder and seller both sides.The seller can select a reserve price, such as open reserve price and conditionity secret reserve price.System is that bidder generates ID at random, and bidder is allowed to select a kind of bid classification, one type bidder's palpus full-payout concluded price from two different bid classifications, and two class bidders must buy " price protection service "." price protection service " allows to recalculate End-price based on " price protection formula ".Wherein, following several add up and obtain by the calculating of price protection formula：" price protection service charge ", the second high tender price and the difference by highest bid lattice and the second high tender price are multiplied by the amount of money that scheduled percentages calculate.
Description
Cross reference to related applications
This application is the U.S. Provisional Application for the Serial No. 62/246,987 submitted based on October 27th, 2015.The Shen
Full content please is included in the present invention by reference.
Technical field
Presently disclosed content is related to auctioning, more specifically to the method for the sealed bid in online auction
And system.This method enables the seller to transfer the possession of the ownership of auction subject matter, and shares the right of possession corporeal right of auction subject matter,
Middle auction subject matter can be tangible or invisible, it may include any valuable article, for example, commodity, technical ability, service,
Space, Place or financial resources etc..This method can be applied on various electronic equipments, including but not limited to：Computer, movement are set
Standby and tablet computer etc..In addition, the method disclosed here can also be used for live auction.
Background technology
Traditional auction is to negotiate to the price of scarce resource, and gone out with all receptible best price of both parties
Sell a kind of mode of these resources.The purpose of auction is to make seller's revenus maximization, buyer's cost minimization.Traditional auction exists
Ancient Greek's period with regard to existing, was mentioned for the first time at about B.C. 500 years.The auction in the U.S. can trace back to the 17th century,
Colonial period, it is popular after pilgrim arrives at east coast of the United States, this is because auction is produced in money crop, import
It is profitability possessed by product, livestock, tool, tobacco or even entire farm etc..It is one that mode by inch of candle, which sells out one's property,
The mode that kind quickly and effectively cashes existing property.From then on, auction experienced the different periods, and constantly develop.
In twentieth century later stage, especially nineteen nineties, science and technology starts to apply in auction business.Later auction business into
One step develops, to adapt to the application of the science and technology continued to develop.Auctioner begins to use the technologies such as computer, facsimile machine, mobile phone, makes it
Business carries out more quick and rich in efficiency.
The continuous development of science and technology is so that the auctioner of today is capable of providing live auction and online auction, to meet far and near visitor
The unique need at family.Current technology makes the bidder that those bid to auction subject matter live just without coming to auction personally
It can take part in auction.Online auction is popular, this is because internet is provided to user-friendly, convenient platform, with
Just each side concerned is exchanged with each other the property of value.Online auction can be carried out by mobile applications and website, as long as there is interconnection
Net, anyone can be carried out operating.
It is put into practice based on the prior art and auction, auction can be divided into open auction and sealed two kinds of auction.Open bat
It is a kind of auction technique that auction subject matter is publicized to all participants to sell.Open auction can be advance price auction (Britain) mould
Formula or Dutch auction (Holland) pattern.Under advance price auction model, the quotation to valuables is by lift-type.In the regular hour
Last bidder for inside quoting ceiling price wins auction.It is rigid to the quotation of valuable auction object under Dutch auction pattern
Start relatively high, auctioner continuously decreases price until buyer receives some price.The main advantage of open auction
One of be exactly that bidder can mutually see mutual quotation, allow in this way auction transparence.However, in open auction
It discloses the transparency that tender price is brought and also will produce many negative effects.
Although online auction is not only popular but also successfully, it is also not without insufficient and defect.For example, under open auction,
Fairness is a big problem.The shortcoming of open auction includes but not limited to：" the screen of submitting a tender of immoral buyer's operation
Cover ", " submit a tender masking ", " support is submitted a tender ", " bid is sniped " and " collusive tendering " etc..It is because tender price is to lead to the problem of these
It is open, and immoral buyer abuses auction procedure by participating in unlawful activities above-mentioned, bid rigging valence easily
Lattice.
When higher tender price the last moment of auction be revoked so that it is lower bid received when, " submit a tender screen
Cover " just have occurred." support is submitted a tender " introduces a kind of strategy of virtual height quotation, it is therefore an objective to which raising is bidded, and real bidder is forced
Think that the subject matter of purchase pays higher price for them.And when bidder deliberately outputs the bat thought below or above them
When selling the quotation of price value, " masking of submitting a tender " just has occurred.The purpose of masking is to mislead other bidders to make it that can not understand bat
Sell the real price of object.
" bid is sniped " refers to submitting a tender at the last moment, it is intended that prevents the response of other bidders and forces up commodity prices.By existing
Software is easy to reach this purpose.This, which is primarily adapted for use in those, the website of fixed shut-in time of submitting a tender." collusive tendering " no
It can only occur between bidder, for example bidder illegally colludes with, not mutual competitive tender be determined, to make price maintenance in relatively low water
It is flat." collusive tendering " can also occur between the seller, for example, the mutual competitive tender other side of the seller auction subject matter, raise to fraud formula
Price needs the expense paid to increase highest bidder." collusive tendering " can lead to " shielding of submitting a tender ", " support is submitted a tender " and/or " submit a tender
Masking " etc., these phenomenons happen occasionally in open auction.
Based on all these defects of open online advance price auction, real bidder auctions to win, Hen Duoshi
Time needs to pay close attention to auction process, with ensure their quotation not by virtual height quotation be more than, especially auction it is last when
It carves.In the last moment of auction, if due to " bid is sniped " of other bidders so that really submitting a tender, everybody can not get the bid
If, entire auction procedure just become not only to have taken but also can cause prodigious psychological pressure to bidder.Due to " bid is sniped ", throw
Mark people has often put into plenty of time and effort, but can not win auction, this usually makes them generate sense of defeat.
It is online be difficult find immoral bidder because it is single be not easy to distinguish from surface immoral bidder and
Difference between real bidder.For example, all Network Auction Systems " are thrown all there are one the fixed bid shut-in time
Mark is sniped " it is all likely to occur in any open bidding system, bidder can be legally in the auction time limit of seller's setting
Interior carry out auction.If " bid is sniped " occurs in the last moment of auction, as a consequence it is hardly possible to determine that who is real bidder,
Who is immoral bidder.Many open Auction Sites claim to take measures to find and delete immoral bid
People.Although there is measure to prevent the fraud of online auction appearance or unjust phenomenon, existing system and method simultaneously ineffective.Than
Such as, the speed of the suspicious proposal activity of user's report is too slow, and the variable factor being related to is too many, can not be provided with to real bidder
The result of profit.In addition, for bidder, the investigation that user's report measure is related to is time-consuming longer, has exceeded bearing for bidder
Range.Because before being solved the problem of investigated, auction may just have finished on.In addition, whether determining user abuses and is
System needs to consider too many factor.Also, the evidence that really bidder may be not enough proves that some user is practising fraud.I.e.
Make to have law to be fined even punishment to the bid of illegalities or fraudulent, the anonymity of internet leads to a large amount of fraudulent activities
Still it happens occasionally.Due to it is open auction there are many defects, mainly due to tender price be disclose it is visible.Overcome this
One of the method for a little defects is exactly that sealed bid is taken to auction.Under this auction technique, tender price will not be thrown in sealing
It is disclosed during mark auction.It means that in sealed bid auction, bidder quotes their throwing in the first stage of auction
Mark the price lattice, but tender price to other bidders remain turned-off with not visible state, until in second stage tender price quilt
Until open.
Based on the tender price of auction subject matter, sealed bid auction can be divided into two kinds, and the first price sealed, which is submitted a tender, to be auctioned
It submits a tender and auctions with the second price sealed.The sealed bid auction of traditional form is the bid auction of the first price sealed, that is, is gone out
Valence soprano wins auction.In the first price sealed submits a tender auction, bidder may face some problems.Wherein, " winner
Curse " it is one of FAQs, it is present not only in open bid sealed-bid first price auction, and may also appear in sealed
It submits a tender in auctioning.In auction, when tender price is more than the inherent value of auction subject matter, it can usually occur that " winner curses
It curses ".This for those to auction subject matter the limited bidder of understanding and/or highest bidder for it is especially true.Because they
It may from want of experience and the improper and overbid of market value estimation to auctioning subject matter.It such as " is won to overcome
Defect as person's curse ", can be used the sealed bid auction of second of form, i.e. the second price sealed submits a tender auction (also referred to as
It ties up crith (Vickrey) to auction).Wherein highest bidder needs the not instead of highest bid lattice paid, is opened for auction subject matter
The second high price gone out.It means that the bidder for outputing ceiling price for auction subject matter will win auction, but only need to prop up
Pay the second high price outputed for auction subject matter.This wants lower naturally compared with middle target ceiling price, and the price can
The true value of auction subject matter can be reflected.Such auction has some attracting features, for example, " winner curses for less generation
Curse " because bidder does not have to concern meeting overbid when bidding.
The deficiency that auction has its intrinsic however, the second price sealed is submitted a tender, i.e. bidder may artificially raise quotation
True value without considering auction subject matter.Since highest bidder need to only pay the second high tender price, immoral bidder
Through winning auction frequently with this strategy.This may make real bidder discouraged.Because real bidder can be according to him
The true value bid of auction subject matter thought, but the real bidder for outputing reasonable tender price is difficult to defeat those
The artificial immoral bidder for raising tender price.Another problem of this auction technique is to cause the second high throwing of bid
Mark people's regrets.The second high bidder that bids can not win auction, but its tender price will be considered as auctioning the true of subject matter
Positive value, nonetheless, he will not obtain any type of remuneration.
The logic flaw that auction has its intrinsic in addition, the second price sealed is submitted a tender, because highest bidder's actual delivery is not
It is the tender price that it is outputed.On the contrary, what highest bidder finally paid is tender price that other people submit, it is exactly specifically the
Two high tender prices.And the second high bidder that bids finally whatever cannot get, but his/her quotation will be used as highest bidder's branch
The reference price paid.This method is inequitable to submitting the real bidder of reasonable price, because of other immoral throwings
Mark people may submit the tender price of virtual height to win auction.In addition, submitting the bidder of the second high tender price may
It will be considered that they are only to provide the tool of reasonable price, they will not obtain any return.For example, stamp is at present often in net
The article with reserve value that upper auction platform occurs.Assuming that there are four bidders, wherein three bidders are really to collect
Postal fan, they submit the tender price for really reflecting its market value, respectively $ 25, $ 30 and $ 35 for one piece of stamp.Such as
The 4th bidder of fruit submits the tender price of $ 100 in auction, under existing auction technique, such as the second price sealed
It submits a tender and auctions, the 4th bidder can not only win auction, and need to only pay the second high tender price, that is, $ 35.The valence
Lattice are significantly less than the tender price of original $ 100.Under this existing auction technique, more useful way is that total energy is submitted to win
The virtual height tender price of real bidder is crossed, but final need to pay the second high tender price.Since there are such causes
Defect is ordered, it is not very universal that the second price sealed, which is submitted a tender and auctioned in auction is put into practice,.
Available system and method are difficult to make up existing defect under the prior art.Spirit of the invention is to provide one
Auction platform, the auction platform provide the acceptance of the bid machine of more equality for bidder based on more fair bidding system and method
Meeting.
Invention content
User is divided into two side party of the seller and bidder by the embodiment of the present invention according to the purpose to take part in auction.It " sells
Side " refers to the side for providing tangible and/or invisible valuable auction subject matter.The seller entrusts platform of the present invention to auctioning target
Object is auctioned.If auctioned successfully, the seller obtains the cost of auction subject matter.For the purpose of the present invention, tangible auction mark
Object this term refer to any kind of article for having physical aspect and monetary value, including but not limited to commodity, machine
Tool, building, soil, space, inventory etc..Invisible auction subject matter, for example service or technical ability, this term refer to currency valence
The article of value.Individual, business entity, nonprofit organization and/or government organs can enjoy its ownership or the right of possession corporeal right.They are not
Have physical form but there is monetary value.The right can give other people with temporary transfer." bidder " refers to passing through sealed bid
Mode participate in auction, for auction subject matter bid a side.The bidder for winning subject matter is the successful bidder, to seller payments
Auction the cost of subject matter.
According to an aspect of the present invention, the present invention provides a sealed bid auction system, which includes：Service
Device, the server are communicated by the computer equipment of at least one of the communication network and multiple sellers seller, Yi Jitong
The computer equipment for crossing communication network and multiple registration at least one of bidders bidders communicates, wherein server from
The computer equipment of at least one seller receives at least one auction request in relation at least one auction subject matter.The auction is asked
It asks and is at least input at least one of seller's computer equipment description and bat as described in auction subject matter containing the registration seller
The time limit sold.Based on auction request, server is thrown at least one registration of the computer equipment from least one bidder
It marks people and shows at least one auction；At least one sealed bid, calculating of the system from least one bidder within the auction time limit
Machine equipment receives at least one sealed bid, and is transmitted to server.Wherein at least one sealed bid includes auction target
The tender price of object；The random ID of one bidder, within the auction time limit, server is directed to the calculating from least one bidder
Each sealed bid that machine equipment receives distributes an ID to bidder at random；The data record of each sealed bid, is taking
Store the data record of each sealed bid in business device, data record includes the ID being randomly assigned, extremely of at least one bidder
True ID, at least one timestamp and at least one tender price of a few bidder；Wherein by communication network with it is multiple
At least one of the registration seller seller and the service communicated at least one of multiple registration bidders bidder
Device determines middle target tender price at the end of auctioning the time limit according to each sealed bid data record.
At least one aspect according to the present invention, random ID will be assigned to registration bidder and submit a tender, and bidder will
It decides him/her in its sole discretion and belongs to any bid classification, be a kind of bidder either two class bidders.A kind of bidder will pay
Tender price in full, and two class bidders since they promise to undertake purchase " price protection service " before competitive bidding, thus obtain again
Calculate the chance of final price.It recalculates based on " price protection formula ", in this formula, final price is under
Row items are calculated：" price protection service charge ", the second high tender price and highest bid lattice and the second high bid
The difference of price is multiplied by the amount of money obtained after scheduled percentage.This method further comprises：Server is from least one seller
Computer equipment receive related at least one at least one auction request for auctioning subject matter.The auction request includes that auction is marked
Object at least one description and auction time limit；It is shown and is clapped to the computer equipment of multiple bidders according to auction request
It sells；At least one sealed bid is received from the computer equipment of bidder within the auction time limit, and each sealed bid is transmitted
To server.Wherein at least one sealed bid includes the tender price of auction subject matter；Within the time limit of auction, server meeting
A random bidder ID is distributed to each sealed bid of the computer equipment from least one bidder；It is each close
Envelope, which is submitted a tender, creates data record, and stores data record in the server, what which was randomly assigned including at least one
Bidder ID, the true ID of at least one bidder, at least one timestamp and at least one tender price；End in auction
When, server determines highest bidder according to dependency rule.Internal system will be provided in relation to historical auction and the reference of the price of transaction.
What the above-mentioned mode that introduction is only through about discussion of the invention carried out.Any content in this part is not answered
Limitations on claims are considered to be, claim defines the scope of the present invention.
Description of the drawings
Figure 1A describes the system architecture of the embodiment of the present invention；
Figure 1B describes the database of the embodiment of the present invention；
Fig. 2 describes the data record of the embodiment of the present invention；
Fig. 3 describes the computer equipment of the embodiment of the present invention；
Fig. 4 describes the computer equipment of the embodiment of the present invention；
Fig. 5 A describe bidder's bidding process according to the embodiment of the present invention；
Fig. 5 B describe bidder's bidding process (Continued) according to the embodiment of the present invention；
Fig. 5 C describe the assigning process of " the price protection service charge " according to the embodiment of the present invention；
Fig. 6 A are described according to the embodiment of the present invention, and the process of competitive bidding is arranged in the seller；
Fig. 6 B are described according to the embodiment of the present invention, and the process (Continued) of competitive bidding is arranged in the seller；
Fig. 6 C are described according to the embodiment of the present invention, and the process (Continued) of competitive bidding is arranged in the seller；And
Fig. 7 describes the process that highest bidder is determined when there are more than one identical highest bid lattice.
Specific implementation mode
According to the prior art, traditional auction means to auction the transfer of subject matter ownership.Traditional auction is by quotient
Product and its ownership are transferred to another party from a side together.The present invention includes but not limited to traditional auction.The implementation of the present invention
Example can not only make the ownership of auction subject matter be transferred to another party from a side, and can also be in the feelings that do not pass ownership
Under condition, the right of possession corporeal right for auctioning subject matter is transferred to another party from a side.The transfer of the auction subject matter right of possession corporeal right may include owning
Power transfer, also may not include ownership transfer.
It is the control that people exercise valuables to a kind of right of possession corporeal right of article.The transfer of the right of possession corporeal right needs merchandise one
Fang Youyi occupies the valuables, is worth with the money of exchange.Shared generation is not related to the transfer of ownership.It is shared can take it is a variety of
Form, including and be only limitted to by over-product, space, service etc. redistribute, share and reuse come for it is personal,
Business entity, nonprofit organization or government organs provide resource optimization.
Cooperative economy business (Collaborative Economy Business, CEB), also known as shared economic work, packet
It includes but is not limited to share, lends, hire out.In general, cooperative economy business, which can be divided into, shares the commodity for auction, technical ability
(i.e. professional skill or individual service technical ability), place (i.e. shared house or office space) and service, such as shared vehicles
(i.e. shared to be serviced with vehicle) shares financial resources (i.e. capital loan), and shared other objects for being totally different from above-mentioned classification
Product (if any).The present invention has the resource of monetary value to provide a shared platform for any of the above described type.Because
Shared resource means a degree of personal interaction in some sense, and bidder needs to obtain the seller's before auction starts
Approval in advance, can submit bid after approving.
About shared commodity, the seller can show that a kind of valuable commodity being in great demand are auctioned, and solicit intentionally
The bidder for sharing the commodity participates in submitting a tender.It is not related to ownership transfer due to shared, will produce corresponding risk, this
With regard to needing a program examined in advance to bidder.Highest bidder and the seller can disclose through the invention during auction
Method and system just share needed for pay cost reach an agreement.Highest bidder can continually recycle this through the invention to be had
Valence object.
About shared technical ability, certain specific speciality or certain special expertise can be provided for bidder by selling.It is dilute in resource
In the case of lacking, there are wilderness demands in bidder for this speciality and technical ability.For respective demand, bidder can submit throwing
It is marked with the technical ability that the phase acquisition seller possesses.Here, the qualification of bidder also needs to obtain the advance approval of the seller.Therefore highest bidder and
The method and system that the seller can disclose through the invention in auction just shares the amount of money paid needed for technical ability and reaches an agreement.Than
Such as, the performance technical ability of the market pop singer talented to certain has very high demand, he/her can auction the technical ability, in private
Perform in people's party or special events.Compared with other bidders, the bidder for providing highest bid lattice will win bat
It sells, so as to appreciate the performance of the singer on the party of bidder oneself such as Christmas Day or New Year party.
About shared place, selling can show that it enjoys the place of the right of possession corporeal right, but he/her is not necessarily required to possess this
Institute.Hereafter, the seller can rent or sublet from those needs to collect from the bidder in some place and submit a tender.Win the acceptance of the bid of auction
The method and system that people and the seller can disclose through the invention in auction reaches one with regard to sharing the amount of money paid needed for place
It causes.For example, during season in red-letter day, there is wilderness demand in the room in some hotels in tourist, and it is available that hotel can auction oneself
Inventory room.This not only makes hotel increase guest room sales volume, can also sell best price, because there is many people in festivals or holidays
Or (such as World Cup) finds lodging during special events.This method is mutual reciprocity and mutual benefit for the seller and bidder
Because the seller can be its available place obtain best price, as long as and bidder can provide highest price, have
Chance obtains ideal place.
The case where shared service, the type based on service can be divided into different classifications.Last highest bidder and the seller exist
The method and system that can be disclosed through the invention in auction is reached an agreement with regard to the amount of money paid needed for shared service.Such as altogether
When enjoying the vehicles, the seller can list detailed share-car scheme in auction.For example, in specific time and some bidder
The shared stroke by bus from place A to place B.Certain bidder may need to obtain criticizing in advance for the seller before participating in auction
It is accurate.Them are then submitted to be ready the tender price of payment the interested bidder of share-car.
As for shared financial resources, for example, the interesting seller for lending fund can show loan details, packet in auction
Include the amount of the loan and time limit.The bidder of interesting loan needs to obtain the advance approval of the seller before bid.If bidder
It can pay than other people higher interests, he can win loan.Highest bidder and the seller can be through the invention in auction
The method and system of disclosure is reached an agreement with regard to loan interest etc..
The present invention further provides a system for online sealed bid auction, which can reduce has with online auction
The risk of pass makes the interests of the seller-bidder optimize.Here bidder and the seller include but not limited to various types of use
Family, such as individual, business entity, non-profit organization or government organs.The side of one or more databases is safeguarded in the system integration
Method, wherein these databases include but not limited to seller information and do not disclose bidder's information of the true ID of bidder, tangible
And/or invisible auction subject matter information and the database in relation to the Successful Transaction in the specific period.Database is potential throws
Mark people and the seller provide before auctioned subject matter price reference, especially when bidder and the seller lack enough knowledge and
When experience.
Participate in intentionally online auction user can login account in systems, it is the seller and throwing to be included in before auction starts
Mark people's pre-set user agreement and dependency rule.Login account includes personally identifiable information and effective financial information, including
But it is not limited to：Name, address, Email, telephone number and effective financial information.System will pass through Email or electricity
Words verify user account.The embodiment of system will only allow user to pass through Email and/or phone number registration one
A account and a user name.The account can be used for showing auction subject matter in auction or submit a tender to auction subject matter.
Multiple accounts are created to fraudulent in order to prevent, and system may require that user provides true name, address and true finance letter
Cease the registrable account in rear.System can require the information of user's offer finance aspect, such as debit card, credit card, Third-party payment
Precious (PayPal) or Aleste (Square) payment system of system such as shellfish etc. and/or bank account information.Financial information is provided
It is to confirm in bidder's account that it is that payment provides safeguard to have enough funds.This will avoid occurring after End of Auction promise breaking or
Delay in payment situation, while also avoiding following situations, include but not limited to defer payment, bidder is based purely on enjoyment progress
The case where bid, bidder, do not have the case where enough funds are paid and bidder not to pay the bill after End of Auction and cancel
The case where transaction.System only allows bidder that them is submitted to confirm the tender price for payment of having the ability, to prevent End of Auction
Bidder Cancels Transaction and situations such as financial insolvency afterwards.
This kind of exemplary embodiment allows the seller to show auction subject matter by online auction platform.The seller must pass through
It is including but not limited to written to retouch in the subject matter of online auction to register them to submit the details introduction of related auction subject matter
It states, photo, video etc..It must be disclosed if any any defect, to avoid misleading statement or fraud.The ID of the seller
Or user name will be disclosed together with the auction subject matter of displaying, and in End of Auction, the feedback element after the completion of merchandising
Also it can be disclosed.Subject matter is auctioned before online auction platform formally displaying, system can give the auction subject matter of every displaying
Corresponding call number is distributed, and issuing time is stabbed, and the initial time of auction is recorded.The system auctions tracking, until the seller
The preset auction time limit terminates.The seller must carry out dual confirmation, once i.e. End of Auction, and pay and complete, auction subject matter
It can be delivered.For example, if auction subject matter is commodity, they will consign to highest bidder, be difficult to control unless the seller occurs
The special circumstances of system, such as natural calamity, war.In addition to this seller must confirm the auction subject matter trigger price set by him/her
Or reserve price is strictly that he/her is ready the price received.It can prevent the seller after End of Auction in this way, auction mark can not be found
Object be that trigger price is arranged or mistake occurs when reserve price by or with it to Cancel Transaction for excuse.Unless certain special circumstances occur
And force majeure, if the seller is confirmed in systems, but Cancel Transaction after closing the transaction or nondelivery auction mark
Object, then the account of the seller will likely can be suspended a period of time, such as the first time occur will suspend one month, if second
The account of secondary generation, the seller may permanently be deactivated.
In tendering process, the information that can see usually in auction, for example, the user name of bidder is related with other
The information of bidder's identity will be not displayed.On the contrary, system will at random be generated according to the bid sequence of bidder, and for them
Id number show bidder.Other than the seller, other bidders can not obtain the id number of the bidder, even
The ID can not be also obtained after the bid ends.Once auction complete, only the seller it can be seen that highest bidder true ID.Bidder
The tender price of other bidders will be can only see, and can't see the true ID of other bidders.The bid of each sealed bid
Time is all attached, and there are one timestamps, to track bid situation in auction process.Anywhere user can see applicable
Auction remaining time.The number to match with every bidder generated at random may make the identity of bidder that can not recognize,
This eliminates the need for the possibility of open disclosure bidder's identity, and avoids certain bidders and carry out potential mood in auction
Property the case where submitting a tender, this emotionality submits a tender the bidder being intended to for interacting therewith in the past.Emotionality bid can lead to valence
Lattice distort, and can not reflect the true value of subject matter.In addition to this, the bidder ID randomly generated can prevent or reduce " support
Force up commodity prices ", " collusive tendering " etc. because will be unable to identification bidder or the pervious proposal activity of bidder according to the random ID
And interest.The seller can not see the identity and tender price of bidder, therefore also friend or relative etc. can not be allowed to pass through submission
It is false to bid to raise subject matter price, in End of Auction front control tender price.
When displaying auction subject matter or submission are submitted a tender, the sealed bid process in auction is advocated honest and honest.The seller
It needs to disclose the user name of oneself to potential bidder.Due to the use of the id number generated at random, bidder can not be recognized
Identity, avoid immoral bidder and carry out emotionality bid or often carry out supporting and lifting valence.However, system will still permit
Perhaps the seller shields specific id number, is allowed to participate in submitting a tender.Why the seller does so, and is due to the specific bidder
It was manufactured in pervious transaction troublesome.When the seller wants to shield an id number, system submits a tender the id number with corresponding
People matches, and the bidder is then shielded in auction, prevents it from participating in submitting a tender.
Other than the true id number of secrecy, before End of Auction, sealed bid will not be in auction and be thrown to other
It marks people and shows tender price.Bidder can output one and react them to auction subject matter value expectation, and branch of having the ability
The tender price paid.Bidder must provide dual confirmation, confirm tender price, and after submitting bid, confirm branch of having the ability
Tender price and corresponding freight charges, the service charge etc. that it is submitted are paid, avoids bidder that amount of money mistake occurs when submitting a tender or strives
By.The method of this dual confirmation is necessary, this gives immoral bidder (including any or all above-mentioned immoral throwing
Mark people) manufacture certain risk.Because potential expense will be generated by being not intended to carry out the bid of actual delivery.System requirements is submitted a tender
People in good faith, pays the tender price for needing to pay in the certain time after End of Auction.Usually supported and lifted
The immoral bidder that valence is submitted a tender will be greatly reduced, because the embodiment of the present invention makes the triumph for having obtained bidder's confirmation throw
Mark is difficult to be revoked.By relevant appropriate expense of collecting and submit a tender, to embody the risk of economic loss, immoral bidder
It will hang back to bid.If immoral bidder is precisely highest bidder, his or her tender price is higher, then gets the bid
Possibility it is higher, therefore, immoral bidder will pay higher cost.
If highest bidder fails to pay tender price in the given time, indefinite duration is suspended their account by system, is removed
The non-seller and/or system manager allow its account to be not suspended.After End of Auction, transaction must be complete within the regular hour
At for example, being completed in ten days after End of Auction.Unless certain special circumstances and force majeure occurs, if transaction is not one
It fixes time interior completion, system will suspend the account of delinquent party for a period of time.When occurring for the first time, account suspends 30 days.If the
No matter secondary generation breaks a contract due to not providing or non-payment services or commodity, delinquent party's account all may permanently be stopped
With.Therefore, it does not complete to be prevented the case where transaction in time, because the seller and bidder have had been acknowledged what it took part in auction
Ability.Once End of Auction, after highest bidder is determined, the every other tender price of tender price and submission will disclose together to
All bidders.
The exemplary embodiment of the present invention allows bidder only to output an effective tender price, but bidder can be with
Tender price is increased or decreased, and resubmits bid before End of Auction.In addition, bidder can cancel throwing before End of Auction
Mark.The bid for having cancelled and/or having changed will still keep sealing state, other people can not just know that those have been cancelled or more in this way
The bidder ID and/or tender price of the bid changed.The bid for having cancelled or having changed is kept into confidential state, so that it may to prevent from throwing
The tender price that mark people has been cancelled or changed using these as reference, while can also eliminate misleading or fraud.The present invention permits
Perhaps the seller estimates the real value of auction subject matter, so that capable of reflecting of outputing that they are thought auctions subject matter true value
Tender price.Those can be encouraged to have the ability to pay its tender price in sealed bid in this way and the real of auction may be won
Bidder because they need not worry cheated.
Therefore, exemplary embodiment of the invention can prevent " shielding of submitting a tender ", " masking of submitting a tender ", " bid macaque significantly
Hit " and " collusive tendering " etc., because no one knows the identity of bidder, which bidder bids highest, in auction process
Each tender price is how many, submits the bidder to submit a tender to be also not necessarily practical highest bidder in the last moment of auction.
Based on existing auction technique, the way that reserve price is common is set.Reserve price is the minimum of the acceptable secret of the seller
Price.Under Reserve Auction mode, the seller is only obligated to sell the subject matter when tender price meets or exceeds reserve price.This
The shortcomings that way is that bidder can not see concealed reserve price, and must constantly guess reserve price, if bidder's bid is too low, is reached
Less than reserve price, auction failure is frequently resulted in.The present invention is different from the prior art.It allows the seller voluntarily to select to be setting one
A disclosed reserve price, or one conditionity secret reserve price of setting.Disclosed reserve price is the seller to allow auction to succeed institute
Receptible lowest price, the price will be disclosed to bidder.When the seller selects that disclosed reserve price is arranged, start in auction
Before, the reserve price of the disclosure will be disclosed to bidder, to make bidder know the receptible lowest price of the seller, less than public affairs
Opening all bids of reserve price will be refused by system.Unless certain situation being previously set and terminate auction in advance, open bottom
The auction of valence is that the seller is not allowed to terminate auction in advance, due to just having known reserve price when bidder is disclosed from reserve price, and
And the bid equal to or higher than the preset reserve price of the seller can only be submitted.According to the present invention, conditionity secret reserve price is：First, such as
Fruit there are one bidder bid meet or exceed the seller setting reserve price, system will allow the seller select in advance terminate auction or
Continue auction until the auction time limit terminates.Secondly, even if tender price does not reach the conditionity secret bottom of seller's setting
Valence, system will allow acceptance of tenders price, highest-bidder that will win the purchase right of subject matter.Two classes of this offer
The method of reserve price is more more efficient than the prior art and transparent because it make auction can favorably accomplish, to reduce by
In the tender price that bidder speculates be not up to the hidden reserve price of seller's setting and the case where lead to abortive lot.
In addition, about the second price sealed auction method, no matter this method use bid ladder whether, be all defective
's.It may cause all real bidders to lose the possibility for winning subject matter, because highest bidder may output a void
High tender price is to win auction.In the prior art, the second high sealing tender price is confirmed as the base of highest bidder's payment
Quasi- value.Highest sealed price may be higher by a ladder of bidding than the second high sealing tender price.One ladder of bidding is to submit a tender
It is artificial win auction and must on the basis of existing highest bid lattice the increased amount of money.Ladder of bidding is advised by auction rules
A fixed predetermined amount of money.A preset ladder table of bidding is provided when auction, ladder of bidding exists depending on subject matter
Trigger price in auction or present price, such as $ 0.5, $ 1, $ 5 or $ 10.However staircase method of bidding is not actually active, because
Many times, there is no significant relationships with final tender price for highest bidder's amount of money to be paid.In fact, highest bidder is only
The amount of money that tender price higher than second is higher by a ladder of bidding must be paid, this will lure that immoral bidder deliberately takes into
At high price, sole purpose is exactly to win auction.These immoral bidders, which need not undertake, pays its high tender price outputed
Responsibility, therefore be not concerned about in face of oneself artificial economic consequences for outputing virtual height tender price.The present invention can solve this
Defect.According to the embodiment of the present invention, otherwise highest bidder needs to pay tender price in full or pays the certain of tender price
Percentage adds the second high tender price.Because tender price needs the amount of money paid directly related with highest bidder, bidder is not
Excessively high tender price may be artificially outputed greatly.
The exemplary embodiment of the present invention provides a kind of method by computer system and bidder is divided into two classes, such as
A kind of bidder and two class bidders need to pay submitted sealed bid price wherein if a kind of bidder's acceptance of the bid, and
Two class bidders then promise to undertake purchase " price protection service " to obtain the chance for reducing End-price.Bidder according to he/
Herself experience, preference and classification belonging to policy selection oneself is auctioned based on it or bidder can also randomly choose or from
Row determines oneself to be a kind of bidder or two class bidders.Based on both types, bid item name can be flexible, such as
It is properly termed as bid classification A and bid classification B, or is known as the bidder of " experienced " and " lacking experience " or other are any
Title identifies both different types of bidders.Bidder is divided into a kind of bidder to the embodiment of the present invention and two classes are thrown
Mark people：It needs to pay the tender price oneself outputed if a kind of bidder's acceptance of the bid, and two class bidders perhaps may be used if getting the bid
To enjoy the profit potential that purchase " price protection service " is brought under certain condition -- pay concessional price.If submitted a tender
People shows that he or she is two class bidders, and the embodiment of the present invention can provide " price protection service ", and service charge is bidder
The certain percentage (such as 3% or 5%) of the tender price of submission, to potential reduction concluded price.In different auctions
The bidder of auction can select to change bidder's classification belonging to them.If bidder submits a tender for an auction subject matter
When confirm it oneself is a kind of bidder, he/her can also be in auction process, or two classes oneself will be identified as in other auctions
Bidder.Therefore, a kind of bidder according to his/her experience, preference and considers that auctioning strategy determines tender price or throwing
It marks people to determine after randomly choosing tender price, auction should be carried out with confidence.If he/her wins target after End of Auction
Object should not also pay it obligation and feel to regret.Equally, when two class bidders of acceptance and guarantee " price protection service charge " submit a tender
Can be lighter, because after End of Auction, if he/her is highest bidder, it is concessional that potential price may be obtained.
The exemplary embodiment of the invention will be solved by using " price protection service " and " price protection formula "
Drawbacks described above such as " winner's curse ".According to the embodiment of the present invention, under the final price that pays is when two class bidders get the bid
The sum of row items：The difference of " price protection service charge ", the second high tender price and tender price and the second high tender price
It is multiplied by the number that preset percentages calculate.Before starting bid, bidder must confirm the bid classification belonging to them,
But before End of Auction, they can change the bid classification belonging to it.According to the bid classification belonging to them, bidder needs
The tender price submitted to it undertakes potential obligation for payment.A kind of bidder holds the tender price in full submitted to it
Carry on a shoulder pole obligation for payment.And due to having purchased " price protection service ", the concluded price after the payable reduction and concession of two class bidders.Ultimate price
Lattice can be calculated by " price protection formula ", wherein the End-price paid after two class bidders acceptance of the bid is to pass through
The following adds up to be calculated：" price protection service charge ", the second high tender price and by tender price and second
The calculated number of predetermined percentage of the difference of high tender price.According to different business strategies, system makes the seller be selected
It selects and determines that who will be obtained " the price protection service charge " of two class bidders.Default, " price protection clothes based on the seller in systems
Business expense " may be fully allocated to the seller, it is also possible to be fully allocated to bid the second high bidder i.e. " price protection service charge "
It is allocated according to predetermined percentage by the high bidder of Any and All Bid second, alternatively, price protection service charge also may be used
It is allocated by predetermined percentage by the seller and second high bidder's (may be multiple) of bid.In fact, if
The seller is confident, and thinks that many bidders will be attracted by auctioning subject matter, he/her may select to retain " price protection in full
Service charge ".On the other hand, if the seller wishes that more bidders is attracted to participate in submitting a tender, he/her may determine " price
Protection service charge " is fully allocated to second high bidder's (may be more people) of bid.Therefore, even if since bidder has purchased
Price protection service so that the auction money that the seller receives is fewer than initial tender price, and the seller still can be in the conclusion of the business recalculated
It selects to collect a part of " price protection service charge " outside price.In addition, it can be to clap that two class bidders do not have to concern when submitting a tender
It sells subject matter and states a price excessively high, this enthusiasm that final raising bidder takes part in auction.In addition, if only there are one bidders couple
Auction subject matter is submitted a tender, and he/her is identified as two class bidders by bidder, then the whole of " price protection service charge "
Cost will return the seller to own, and the trigger price of the seller is considered as the second high tender price.
However, purchase " price protection service " is related to relevant risk factors.Buy " price protection service " not always
Bidder can be reduced and need the concluded price paid.If the difference between tender price and the second high tender price is very big, that
The protection service of two class bidder's purchasing prices will likely be such that their End-price is greatly reduced.But if acceptance of the bid
Difference very little between price and the second high tender price or only inappreciable difference, the protection of two class bidder's purchasing prices
Service may additionally increase cost or loss, because the End-price of highest bidder's payment will likely be higher than the throwing of its submission
Marked price lattice.The abuse that the potential loss that purchase " price protection service " is brought will can effectively prevent bidder to system.If no
There are potential loss, and setting " price protection service " will be meaningless, because each bidder can buy, " price protection takes
Business ", to reduce concluded price, pays less expense, this principle that destruction commercial operation should accept the risk.
In order to illustrate the potential risk of purchase " price protection service ", three examples are enumerated here：Example one, if there are one
Bidder, such as No. 1 bidder confirm that he/her is two class bidders, submit the tender price of $ 100, and pay " price protection
Service charge ", the amount of money are 5% (i.e. the $ 5.00) of $ 100.Predetermined percentage suitable for tender price is 20%, that is, is used
The difference of tender price and the second high tender price is multiplied by 20% to calculate End-price.Another bidder, such as 2
Number bidder confirms that he/her is a kind of bidder, and submits the quotation of $ 50, this is the second high tender price.In addition, another
Bidder, such as No. 3 bidders confirm that he/her is a kind of bidder, submit the tender price of $ 40.In End of Auction, No. 1
Bidder gets the bid, and according to above-mentioned formula, No. 1 payable amount of money of bidder is:Second high tender price+[20% × (highest is thrown
The high tender price of marked price lattice-the second)].Therefore, No. 1 bidder finally needs to pay：$ 50+ [20% × ($ 100- $ 50)], i.e. $
60.The totle drilling cost of No. 1 artificial auction subject matter payment of submitting a tender is 60, and additional 5.00 " price protection service charge " amounts to
65.The tender price that No. 1 bidder originally submitted is $ 100, but he actually only takes and amounts to $ 65, to save $ 35.
No. 3 bidders do not win subject matter finally, therefore price protection service charge will not be deducted from his/her account.
Example two, it is assumed that situation is identical with upper example, the difference is that the tender price of No. 1 bidder is $ 101, and pays $
5.05 " price protection service charge ".No. 2 bidders bid $ 100, this is the second high tender price.Highest bidder when End of Auction
For No. 1 bidder.The amount of money of payment is by he：$ 100+ [20% × ($ 101- $ 100)], i.e. $ 100.20.No. 1 artificial claps of submitting a tender
The totle drilling cost for selling subject matter cost is $ 100.20, separately adds " price protection service charge " $ 5.05, amounts to $ 105.25.At this point, No. 1
The tender price of the $ 101 of expense submission more initial than its of bidder's payment has more $ 4.25, and therefore he assumes responsibility for purchase " price is protected
It is lost caused by shield service ".
Example three assumes again that the " price protection of the situation identical as example one, No. 1 bidder's bid 100 and payment 5.00
Service charge ".No. 2 bidders' bid $ 80.No. 1 bidder is the successful bidder in End of Auction and will payment：$ 80+ [20% ×
($ 100- $ 80)], i.e. $ 84.The totle drilling cost of No. 1 artificial auction subject matter payment of submitting a tender is 84 plus 5.00 " price protections
Service charge ", final totle drilling cost are $ 89.This time No. 1 bidder saves 11, it is apparent that low not as good as the cost of example one.
Therefore, the embodiment of the present invention prevents bidder artificially to output the case where virtual height tender price is to win auction.
Or because of tender price or use tender price that the present invention claims bidder's full-payout, it is quoted and the second high bid
Some predetermined percentage of the difference of price calculates concluded price.Bidder will be prevented from submitting virtual height quotation or offer
It is high.Therefore, the present invention prevents bidder to output the case where virtual height tender price wins auction.Because the present invention claims bidders
Its tender price for quoting of full-payout or payment pass through the calculated price of price protection formula.Bidder will be prevented from deliberately
Submit the quotation far above subject matter real value.Because tender price is higher, bidder finally needs the price paid may
Also higher.The present invention is the price of closer subject matter real value by reflect highest bidder's payment, while will also prevent to throw
Mark people outputs the sealed bid price of virtual height.A kind of bidder is also less likely to think when winning subject matter oneself to be subject matter
Extravagent price is paid, because bidder can select the identity with two class bidders to submit a tender, to be counted again
End-price is calculated, it is concessional to obtain potential price.Therefore, final " winner's curse " can be greatly decreased.
In order to be reduced as far as the multiple bids for same amount occur it may require that submitted and thrown as unit of dollar when bid
Standard gold volume, and remain into 2 significant digits (such as $ 25.78).
If two bidders output the ceiling price of same amount, and belong to same bid classification (such as two
Bidder is a kind of bidder either two class bidders), then the two bidders can be in the predetermined spy of system
It rebids in timing section.However, if the two bidders for outputing identical highest bid lattice belong to different bids
Classification (such as a bidder is a kind of bidder, another bidder is two class bidders), then the two bidders are such as
If fruit is got the bid, payable concluded price is calculated by respectively affiliated classification is pressed respectively.In that case, the bid of submission
The high bidder of price will win subject matter and be the successful bidder.Bat is maintained according to the method that highest concluded price determines highest bidder
The fairness sold, because the highest people that bids will be the successful bidder.
After bidder and the seller complete transaction, if mutually the feedback opinion of other side's offer each other will be helpful to preferably for they
Improve auction service.In general, this is realized by evaluating and/or commenting on.After End of Auction, both sides are by paying and delivering
Subject matter completes transaction (as being applicable in).The system of this patent enables the seller and bidder mutually to evaluate and provides and transaction phase
The feedback of pass.Before submitting unfavorable ratings/comment, system will provide the chance got in touch with each other to both sides.This will be carried for both sides
For preferably linking up, to solve questions and doubts, to reduce unfavorable ratings.
When needing to prompt the seller and the following situations of bidder, including but not limited to：Tender price submit successfully, related clap
Sell the time limit, tender price is rejected, win auction, auction result etc., system can be disappeared by server with Email, immediately
The modes such as breath, voice messaging send to the computer equipment of the seller and bidder and notify.
Above system can provide a platform, to promote at least one party or multi-party matched auction marketplace, wherein bidder
It can submit a tender at one or more sellers simultaneously, and sell the bid that can collect one or more bidders, platform is to every
A certain proportion of expense or commission are collected in transaction.
System also includes the method determined with the relevant expense of one or more risk factors of transaction, and wherein this method makes
Identify that highest bid lattice and the second high tender price, two class bidders are bought " price protection service " with bidder's information
The final price that cost and highest bidder must pay.In addition to this, the system or platform can also be received for the auction service that it is provided
Take a certain proportion of service charge.
The present invention can also use Data Verification module in online auction.It is main that this will verify at least four by system
Data group：1) bidder and the seller are determined；2) determine that the auction data submitted is accurate；3) highest bidder is verified；And 4) really
Recognize transaction completion etc..
ID is verified.One of online auction problem is information asymmetry, is carried out this is because transaction is full energy matries
's.In order to solve anonymity issue, system allows the seller and bidder in payment small charge and confirms it through credit information company
Become " identity has verified that " user after identity.It does so usable family to trust, because their counterparty-bidder or selling
Fang Jun is verified, that is, their identity is known.In addition, once going wrong, user can also be chased after
Whether track, the auction data for verifying submission are correct.The reception and keeping of bid：All throwings received before the opening of bid time of setting
Marked price lattice are all secrecy, and are kept properly, and the seller or administrative staff will not open or consult any bid, these bid prices
Lattice are saved in the electronic bidding case that limitation accesses.If bid is revoked, it will be preserved in bid case to auction knot
Beam.Before bid starts, the information in relation to bidder's identity and quantity can be obtained by only auctioning administrative staff.Opening of bid：When opening of bid
Between preset before auction by the seller.The accuracy that system verification is submitted a tender：All bids are with acceptable digitlization lattice
Formula is submitted.System verifies bid by preventing the replacement to bid, addition, deletion or the possibility of change.Record
It submits a tender：After the completion of verification of submitting a tender, submits a tender and be considered as completion and by its accuracy of system authentication.It, can not when bid project is too many
When ensureing all bids by complete documentation, the summary entries individually submitted a tender can only record goods to auction number and tender price.
Bid can be consulted, but the true identity of bidder is encrypted.The refusal of bid：After opening of bid, according to the present invention, submit most
The bidder of high tender price gets the bid, and refuses all bids unless there are convincing reason and cancels auction.The seller should use up
The variation before auction starts is predicted in all effort, and notifies the resulting any related auction target of all potential source rocks
The case where modification or cancellation of object.This will allow bidder's change or withdraw a bid, and prevent the unnecessary leakage of tender price.
In the usual course, it must not cancel after opening of bid or re-request is auctioned.In situations, it submits a tender after starting and in auction result
Before generation, bid invitation can be cancelled, refuse all bids：(1) patent specification is changed；(2) since the seller is uncontrollable
Situation, valuable auction subject matter can not be auctioned；(3) any bid is not received；(4) obviously meet the public based on other
The reason of interests, cancels auction.Verification after the completion of transaction：Highest bidder and the seller must confirm that the transaction of both sides successfully completes：
1) seller obtains the cost of auction subject matter, and 2) bidder has received auction subject matter.
Auction result is caused to be postponed till except the acceptable time range of bidder if occurring difficult management after opening of bid
If, notify that all bids are rejected bidder.When system judges it is necessary to refuse all bids, system is notified that each
All bids of position bidder are rejected, and illustration.Receive unreadable electronic bidding：If the bid that system receives is not
Readable degree indeed reaches the stage that cannot be satisfied bid basic demand, and system will notify bidder：Due to undesirable,
Bid will be rejected.Mistake in bid：System will check all bidding errors, if it find that mistake, will notify bidder, entangle
Lookup error rear is subjected to its bid.Mistake includes but not limited to apparent decimal point dislocation etc..
As shown in Figure 1A -4, server (102) passes through in communication network (for example, internet (100)) and multiple sellers
The computer equipment (such as 108,114) of at least one seller and with multiple registration at least one of bidders bidders'
Computer equipment (such as 106,110,112) is communicated.Server (102) connects from the computer equipment (108,114) of the seller
Receive the auction request in relation to auctioning subject matter.Auction request includes to be input to computer equipment extremely by least one registration seller
Few one description and auction time limit in relation to auctioning subject matter.Server according to auction request bidder computer equipment
On (106,110 and 112) displaying auction is introduced to multiple bidders；Within the auction time limit, on the computer equipment of bidder
(such as 106,110,112) receive at least one sealed bid (200) and are communicated with server (102), wherein at least one
A sealed bid (200) includes the tender price of auction subject matter；Within the time limit of auction, server (102) is directed to from bid
People's computer equipment (106,110 and each of 112) receive (at least one) sealed bid (200) to bidder distribute one with
The ID (202) of machine；The data record (210) of each (at least one) sealed bid is stored in the server, and data record is at least
Include true ID (204), a timestamp (206) and a tender price of the random ID of a bidder, bidder
(208)；Wherein server (102) passes through at least one of communication network (for example, internet (100)) and multiple registration sellers
It the seller and communicates at least one of multiple registration bidders bidder, and is thrown according to each (at least one) sealing
Mark determining highest bidder at the end of auctioning the time limit of data record (210).Server may include one or more databases
(104).As shown in figure 3, the computer equipment (300) of bidder can be gathered around, there are one internal clocking mechanisms (302).Internal clocking machine
Structure can be directed to each (at least one) sealed bid (200) automatic identification timestamp (206) and send server (102) to.When
Between stamp for determine submit submit a tender sequence.The computer equipment (300) of each bidder also may include a display
(304), and can be existing any computer equipment.For example, smart mobile phone, tablet computer, PC or it is any its
His computer equipment.Equally, the computer equipment (400) of the seller, is shown in shown in Fig. 4 examples, may include a display (402),
And can be any computer equipment.
As shown in Figure 1B, database (104) includes data related with tendering process, including but not limited to：Tangible auction
The particulars (116) of subject matter；The particulars (118) of invisible auction subject matter；It is divided according to the property of auction subject matter
Transaction data (122).Database also includes pervious Successful Transaction record and concluded price (120)；Tender price data
(124) (such as bid history, price, timestamp)；Subscriber data (126) (such as files on each of customers, financial information, auction history,
Highest bidder's identity information of sealed bid)；And other transaction datas (128).Database can be set by the computer of the seller
The computer equipment (106) of standby (108) or bidder are connect with the seller and bidder, so that the seller and bidder inquire and obtain
Relevant information, such as the historical trading of auction subject matter and price reference.In the subject matter that bidder intends to submit a tender to them
In the case of lacking understanding enough and experience, or work as the seller in the case where determining that reserve price needs to refer to price, lane database
Historical trading data can be at least one of multiple registration bidders at least one of bidder or multiple registration sellers
The seller provides the price reference of at least one valuable auction subject matter auctioned in the past.Database can be multiple registration bidders
At least one of bidder or multiple registration at least one of seller seller's query search are at least one once auctioned
ID of the information of valuable auction subject matter without disclosing practical highest bidder.Each (at least one) sealed bid can auction
Lasting period be stored securely in server；In End of Auction, tender price and timestamp will be displayed to multiple
Bidder, and the true ID of bidder is not displayed.
The system has the method for safeguarding one or more databases, these databases include but not limited to highest bidder and the seller
Information, but non-disclosure its true identity (the also referred to as ID of practical bidder).The information of tangible and/or invisible auction subject matter
And the database about the Successful Transaction occurred in the specific period.
As shown in Figure 5A, the embodiment of the present invention allows bidder to be registered (step in system before submitting bid
Rapid S500).After registration, user account is verified (step S502), and registration bidder must be according to its experience, preference and bat
Selling a kind of bid classification of policy selection or bidder can also randomly choose (step S504).It is selected to the use of two class bidders
Family (step S506), which will promise to undertake, buys " price protection service " ("Yes", step S508).If two class bidders do not promise to undertake purchase
" price protection service " ("No", step S508), system can prompt bidder (step S510), as the throwing of two class bidders
Mark will be rejected.System will send request to bidder allows it to be changed to a kind of bidder (step S512).If bid person
"Yes" is selected, and is changed to a kind of bidder ("Yes", step S512), is submitted a tender then bidder can be used as a kind of bidder to input
Price is simultaneously submitted to and starts after system to submit a tender (step S518).If bidder selects no ("No", step S508), then submitting a tender
Bid qualification of the people in auction will be cancelled (step S514).
The user for being selected to a kind of bidder (step S516) can be started by inputting tender price (step S518)
It submits a tender.Bidder, either a kind of bidder or two class bidders, need to confirm the accuracy of tender price, while confirming to throw
It marks people to have the ability to pay the tender price and relevant cost of its input, this is the dual confirmation (step S520) of bidder.Such as
Fruit bidder does not confirm tender price or ability to pay ("No", step S520), then system will notify its bid of bidder
It will be rejected (step S522).Bidder can be by confirming tender price and ability to pay (step S528) selection change option
("Yes", step S524).If bidder's selection does not confirm tender price and ability to pay (no, step S524), then throwing
Mark people will be prohibited submitted a tender (step S526).If bidder confirms tender price and confirms that its economic capability is enough
The submitted tender price (step S528) of payment, then tender price will be received, and is input into system (step
S538), and the tender price is by an assigned random id number and bid timestamp (step S540).
It obtains dual confirmation once submitting a tender and submits to system, which sells whether the tender price that inquiry is submitted is less than
The trigger price (step S530) just set.If tender price is less than the trigger price ("Yes", step S530) of seller's setting, then
System can refuse the tender price (step S532) automatically, and allow bidder that tender price is changed to set not less than the seller
Trigger price (step S534).If bidder refuses change tender price, system will finally refuse the tender price (step
S526).After bidder changes tender price, whether system can inquire the tender price of submission less than being set by the seller again
Trigger price (step S530).If the tender price submitted is not less than trigger price (no, step S530), then system will receive submission
Tender price, and the amount of money is input in bidding system (step S538), and the ID of sealed bid people.Due to all receiving
Tender price be all sealing, bidder and tender price show assigned a random identification number and timestamp
The time (step S540) that tender price is received in auction by system.
As shown in Figure 5 B, after system distributes random id number and record bid timestamp (step S540), allow bidder
Submitted tender price is cancelled or changed before End of Auction (step S542).However, each bidder only allows submission one
A effective bid.If bidder does not change the bid (no, step S542) of its submission, then system can determine that it is submitted
Bid is its only effective bid (step S544).If bidder determines to change submitted bid (being S542), then throw
Mark people can change before bid, re-enter new tender price, then resubmit (step S548) again.If submitted a tender
People no longer changes tender price, and system can determine whether that the bid that it is resubmited is the only effective bid (step S550).Once
The time is auctioned by auction terminates (step S546) at once.
Once End of Auction, tender price will disclose (step S546) to auction participant, and system will determine that bidder is
It is no to have won auction.If bidder gets the bid, and he/her is a kind of bidder ("Yes", a kind of, step S552), then winning
Bidder's tender price for submitting payment for auction, separately plus correlative charges, if any, (the step such as such as freight charges
S556).If bidder wins auction, and he/her is two class bidders (being two classes, step S552), then winning auction
Bidder payment is separately added into correlative charges (if any) determining ultimate price afterwards using " price protection formula " calculated price
Lattice (step S558).If the system determine that bidder does not win auction (no, step S552), then bidder does not have to pay any
Fund (step S554).Bidder, which wins, to auction and after paying final price, sells direction highest bidder and puts up to auction subject matter
(step S560).After auction subject matter consigns to highest bidder, auction both sides can mutually be commented (step S562).It merchandises to this
Terminate (step 564).
As shown in Figure 5 C, after two class bidders win auction, final price is determined by application " price protection formula "
(step S566)." price protection formula " adds up the following：" price protection service charge ", the second high tender price,
The difference of tender price and the second high tender price is multiplied by the amount of money (step S568) that predetermined percentage obtains, is then based on
The seller's is default, and system will determine that who will obtain " price protection service charge " (step S570).It can be by whole " price protection service
Expense " distributes to the second high bidder (step S574) of the seller (step S572) or bid.Then system further determines that bid
The quantity of second high bidder.If only one bid second high bidder's (being, step S576), then all " prices
Protection service charge " will distribute to the second high bidder (step S578) of this unique bid.If there is multiple bids second
High bidder (no, step S576), then all " price protection service charges " by predetermined percentage in Any and All Bid
It is split (step S580) between second high bidder.Alternatively, " price protection service charge " is to predefine
Percentage the seller and bid the second high bidder between be split (step S582).In the case, " price protection
A part for service charge " is assigned to the seller (step S584) in predetermined ratio；Remaining of " price protection service charge "
Part is assigned to the bidder (step S586) of the second high tender price.In the next step, system further determines whether
Only the second high bidder (step S576) of a unique bid.If the system determine that only existing a second high throwing of bid
Mark people's (being, step S576).Then it is high will to distribute to unique bid second for the rest part of " price protection service charge "
Bidder (step S578).If the system determine that without second high bidder's (no, nothing, step S588) of any bid, than
Such as only there are one bidder in the case of, the preset trigger price of the seller will be considered as the second high price, " price protection take
The rest part of business expense " will be assigned to the seller (step S590).If there is more than one the second high bidder of bid (it is no,
More than one, step S588), then the rest part of " price protection service charge " by predetermined percentage in Any and All Bid
It is allocated (step S594) between second high bidder.
As shown in Figure 6A, the embodiment of the present invention allows seller registering account (step S600) in systems.It is clapped in setting
Before selling details, the seller must carry out system verification (step S602).After system verification is completed, the seller can issue auction request
(step S604).Before details is auctioned in setting, the seller can input explanation and auction time limit in relation to subject matter etc., and illustrate
Whether there is any bidder ratified in advance, is such as applicable in (step S606).In next step, the seller determines that who will obtain " price protection
Service charge " (step S608).Then the seller can illustrate whether auction is related to ownership transfer (step S610).If auction relates to
And ownership transfer (being, step S610), it is intended to sell auction subject matter (step S612) in auction then the seller has.If
Auction is not related to ownership transfer (no, step S610), then the seller intends to share auction mark in the special time period of auction
Object the right of possession corporeal right (step S614).
As shown in Figure 6B, once the seller determines transfer the ownership, reserve price (step S616) can be voluntarily arranged by selling.If sold
Side's selection is not provided with reserve price (no, step S616), then any nominal trigger price can be arranged in he/her, such as $ 1.00, and bat
It sells the time limit, including at the beginning of auction and the end time (step S618).System sends out one thus has unique call number
Timestamp (step S618) be identified.Then, system will start acceptance of tenders (step S658) until End of Auction, throws
Marked price lattice cannot be below trigger price (step S660).After End of Auction, during system will handle all bids and select tentatively
Marked price lattice (step S662).On the other hand, if the seller selects setting reserve price (being, step S616), the seller can with conditionity
Hide reserve price (step S620) or open reserve price (step S638).If the seller has selected open reserve price (step S638),
Before bidder starts bid (step S640), system will notify reserve price to bidder.Auction begins with timestamp
With auction time limit (step S642), system receives the bid (step S644) of bidder.If tender price is less than reserve price (step
S646), then tender price can refuse (step S648) by system, transaction will not occur (step S650).If tender price
Equal to or higher than reserve price (step S652), then system is by acceptance of tenders (step S654).The seller is not in both cases
Allow to terminate auction (step S656) in advance, supports to terminate auction in advance unless pre-determined special circumstances occur.If sold
Side's selection setting conditionity reserve price (step S620), then reserve price, which will not disclose, gives bidder (step S622).The seller is arranged
Auction price (step S624) is provided when the time limit of auction and timestamp (step S626), and when auction starts, system is notified that bidder
Terminate the possibility of auction in advance in relation to the seller, system starts the tender price (step S628) of acceptance of tenders people.System will be looked into
Ask whether tender price is more than reserve price (step S630).If exceeding reserve price (being, step S630), whether auction terminates then in advance
Depending on the preset condition of (step S628) seller.System is notified that seller's tender price has reached reserve price, and the seller can select
Terminate auction.The seller can also be configured in systems, once reaching reserve price, auction self termination.If tender price is not
Reach reserve price (no, step S630), system will acceptance of tenders people bid (step S632).If tender price is less than reserve price
(step S634), system will continue the bid of acceptance of tenders people.After bid is received by system (step S636), until End of Auction
Before (step S660), system will handle all bids and selects preliminary tender price (step S662).
As shown in Figure 6 C, received by system when submitting a tender, after End of Auction (step S660), system can primarily determine acceptance of the bid
Price (step S662).Preliminary tender price might have variation and adjustment (step S664), determine depending on bidder oneself
Fixed bid classification.If highest bidder is a kind of bidder (step S666), the seller will receive all acceptance of the bid cost (steps
S668), End of Auction (step S684).If highest bidder is two class bidders (step S670), " price is protected for system application
Shield formula " (step S672) calculates final price." price protection formula " is calculated by being added up to the following
(step S674)：The predetermined portions (step S676) of " price protection service charge ", the second high tender price (step S678), in
The predetermined percentage (step S680) of the difference for lattice and the second high tender price of marking the price.Therefore, the seller will obtain above-mentioned every (step
S682 the amount of money after) adding up.Later, (step S684) is completed in auction, and highest bidder pays End-price and is applicable in plus any
Extra charge, if any (step S686).The seller puts up to auction subject matter (step S688), and both sides evaluate mutually (step
It is rapid 690), closing the transaction (step 692).
As shown in fig. 7, after End of Auction, system will determine that highest-bidder is highest bidder (S700).System
Identical tender price (S702) is will be determined whether.If without identical tender price (no, step S702), system can be selected
Select highest tender price (S704).If there is more than one identical tender price (being, step S702), then system will determine
They whether be same type bidder (step S706) (step S714)." bidder of same type " this term refers to
At least a kind of bidder or two class bidders are belonged to there are two bidder.If identical tender price comes from same type
Bidder (step S706), then system can prompt bidder to resubmit bid (step within the predetermined time limit
S708).If bidder resubmits bid (being, step S708), then the highest bid lattice that resubmit are won (step
S710).If bidder does not resubmit bid (no, step S708) within the predetermined time limit, then it is last round of most
The bidder for first having submitted bid gets the bid (step S712).If the identical bidder of tender price comes from different classifications
(step S714), then system will calculating final price (step S716).Tender price highest bidder wins (step S718).
Highest bidder pays End-price (step S720).
Method as described herein can execute on computer equipment and/or computer system, computer equipment and/or
Computer system generally includes central processing unit (CPU), and CPU is operatively connected to storage device, data are output and input
Circuit (IO) and computer data network telecommunication circuit.The computer code that CPU is executed can obtain datel circuit and connect
The data of receipts, and store it in memory device.In addition, CPU can also obtain data and be stored it in from I/O circuits
In memory device.Moreover, CPU can be obtained from memory device data and by I/O circuits or datel circuit by its
Output.Data stored in memory can further be recalled from memory device, by CPU with side described in the specification
Formula is further processed or changes, and is stored again in same or different storage device.These storage devices can with one kind
The mode of operation is connect with CPU, includes by way of data network circuit.Memory device can be any kind of data
Storage circuit or magnetic memory or Optical devices, including hard disk, CD or solid-state memory.It is suitable for the invention known
Computer system, environment and/or the example of configuration include, but are not limited to PC, server computer, palm PC,
Laptop or mobile computer or communication equipment such as mobile phone and electronic notebook, are based on microprocessor at multicomputer system
System, set-top box, programmable consumer electronics, NetPC Network PC, minicomputer, mainframe computer including
The distributed computer environment etc. of any of above system or equipment etc..
It is aforementioned to realize that the computer program logic of above-mentioned all or part of functions be embodied in various forms, it wraps
Include but be not limited to source code form, computer can perform form and various intermediate forms (for example, by assembler, compiler,
The form that linker or locator generate).Source code package containing it is a series of various programming languages (for example, object code, compilation language
Speech or high-level language such as FORTRAN, C, C++, JAVA or HTML) in execute series of computation machine program instruction.They can use
In various operating systems or operating environment.Source code can define and use various data structures and the communication information.Source code can
(for example, passing through resolver) in the form of showing as computer and can perform, or can be by conversion (for example, passing through translater, compilation
Device or compiler) at computer it can perform form.
Description of the invention can carry out under the general environment of computer executable instructions, such as performed by computer
Program module.In general, program module include the routine for executing particular task or particular abstract data type, program, object,
Component, data structure etc..Computer program and data can be in any form (for example, source code form, computer can perform shape
Formula or intermediate form) be permanently or temporarily fixed in tangible media, as semiconductor storage (for example, RAM,
ROM, PROM, EEPROM or FLASH may be programmed RAM), magnetic storage apparatus (for example, floppy disk or Fixed disk), optical memory devices
(for example, CD-ROM or DVD), PC cards (for example, pcmcia card) or other storage devices.Computer program and data can be with
Signal in any form is transferred to using the various communication technologys on computer, these technologies include but not limited to analogue technique,
Digital technology, optical technology, wireless technology, networking technology and interconnection technique.Computer program and data can be any movement
The formal distribution of storage medium is pre-loaded to the document or electronic document (for example, shrink-wraping software or tape) of printing
Computer system (for example, system ROM or fixed disk), or by communication system (for example, internet or WWW) from service
Device or electronic bulletin board are allocated.It is understood that any component software of the present invention can be with ROM (read-only storages
Device) form realization.If desired, component software can be usually executed on the hardware using routine techniques.
The present invention can also be implemented in a distributed computing environment, the remote processing that wherein task is connected by communication network
Equipment executes.In a distributed computing environment, program module can be in local and remote computer storage media, including
Memory storage devices.It will be appreciated by one of ordinary skill in the art that the present invention can be in one or more computer processors
Upper execution.These computer processors are attached using data network, such as internet.In another embodiment, the mistake
The different step of journey can computer and storage device different by one or more geographical locations, by data network connection
It executes, to allow them to co-operate, the step of executing the process.In one embodiment, the computer of user can be transported
One application program of row so that the computer of the user transmits one or more data packets by data network and calculated to second
Machine, referred to herein as server.Conversely, server can be connected to the mass data storage dress of one or more storage databases
It sets.
Server can execute a program, receive and compile transmitted data packet, looked into the database to extract
The information of inquiry.Then, server may have access to mass storage device, obtain required query result to execute remaining of the invention
Step.In addition, server can be transferred to Query Information another computer for being connected to mass storage device, the calculating
Machine can execute the present invention to achieve desired results.The result can be passed by one or more data packets with correct address
Return the computer of the user.
The embodiment of the present invention is also applied for live auction.Sealed bid can be used for online and live auction, make bidder
With the benefit of the seller.In auctioning at the scene, people come to the spot, or are thrown by agent by telephone system
Mark；The seller and/or other related personnel can carry out the auction of valuables, and bidder can play an active part in bid.Scene sealing is thrown
The bidder of mark auction can decide the bidder's type of oneself in its sole discretion before submitting sealed bid, for example, one kind bidder or
Two class bidders.When being decided to become two class bidders, check can be submitted by sealing means (being such as placed in the envelope of sealing)
Or prop up purchase " price protection service " of paying earnest money.Bidder will be required that the machine will be every by machine submission sealed bid
Position bidder's one random id number of automatic or manual distribution, timer stab issuing time.By envelope be submitted to the seller or
The place that auctioner specifies, for example be submitted to before envelope storage box, the bid classification of bidder will together with sealed bid price
It is recorded.Before auction starts, the seller and bidder can preset the dependency rule that live sealed bid is auctioned.
When End of Auction, the auctioner and/or other related personnel that auction tissue will calculate final price, and according to calculating
Final price out selects highest bidder.The method that " price protection service " method for live auction is used with online auction
It is identical.The sealed bid that bidder submits is to be disclosed in End of Auction, and bidder can not know that other bidders carry
The tender price of friendship.When auctioning at the scene, before bid starts, bidder must confirm the bid classification belonging to them, clap
Bid classification belonging to oneself can be changed by selling before terminating them.Highest bidder props up according to he/her is a kind of or two class bidders
Pay final price.A kind of bidder will be responsible for the tender price in full that payment is submitted.And due to having purchased, " price protection takes
Business ", two class bidders there will be an opportunity to recalculate conclusion of the business price.Final price can be calculated by " price protection formula ",
The final price of wherein two class bidders payment is calculated by adding up the following：" price protection service
Take ", the second high tender price and the calculated amount of money of predetermined percentage by tender price and the difference of the second high tender price.
According to different business strategies, auction can provide selection for the seller, it is allowed to determine that who will obtain " price guarantor before auction starts
Protect service charge ".In auctioning at the scene, it will notify that who will obtain " price protection service charge " to bidder before auction starts.It is practical
On, when bidder learns that the second high bidder of bid has an opportunity to obtain all or part of " price protection service charge ", this will
More bidders are attracted to participate in live auction.Highest bidder pays final price and correlative charges, such as service charge, tax
Take, freight charges (if any), the seller puts up to auction subject matter.Auction trade terminates.
Embodiment described in the invention is only exemplary.For the professional person skilled to those, it is clear that can
To make various changes and change to it.All of these changes and modifications should all carry out within the scope of the invention, this specification
The attached claims define the scope of the present invention.Although the present invention is described in detail and says to the present invention
It is bright, it is apparent that, the description of this invention is to be carried out by way of example with description of the drawings, but this is not construed as pair
The limitation of the present invention.It is understood that for clarity, the various features of the present invention described under different embodiments
Offer can also be provided in single embodiment.On the contrary, for simplicity, the present invention's described in single embodiment is each
A feature can both provide respectively, can also be provided with any combining form appropriate.It is understood that in the present invention
The specific embodiment of description is only intended to provide extremely detailed disclosure to the present invention, it is no intended to be limited.
The change and modification to the device and method in the scope of the invention disclosed by this specification are for ordinary skill people
It is obvious for member.Therefore, although the present invention is disclosed by way of examples, it should be understood that
It is that other embodiment may also be within the purpose and scope of the invention, and claim below will be to the scope of the present invention
It is bound.
Claims (30)
1. a kind of sealed bid system for auction, the system include：
Server, computer equipment and multiple registration of the server by least one of communication network and multiple sellers seller
The computer equipment that at least one of bidder registers bidder communicates；Wherein, calculating of the server from the seller
Machine equipment receives at least one auction request about multiple auction subject matters；The auction request includes by least one registration
The seller is input to description and the auction time limit of at least one auction subject matter of seller's computer equipment；The server is according to bat
It sells request and shows auction to multiple bidders on the computer equipment of bidder；
At least one sealed bid, the sealed bid are within the time limit of auction from the computer equipment of at least one bidder
Upper reception, and send the server to；Sealed bid described in wherein at least one includes the bid price for auction subject matter
Lattice, and from bidder's computer equipment what is received at least the belong to bidder of a bid classification identity information；
The random ID of bidder receives at least one sealed bid within the time limit of auction from the computer equipment of bidder
Afterwards, server can distribute random ID to bidder；
The data record of at least one sealed bid, the data record are stored in server, and data record includes at least
The random ID of bidder, the true ID of bidder, the timestamp and tender price for auctioning subject matter；
Wherein, according at least one sealed bid data record, server by communication network and multiple registration sellers extremely
Lack a seller and communicated at least one of multiple registration bidders bidder, and determines at the end of auctioning the time limit
Win the bid of auction；
Wherein, according at least one sealed bid data record, server will determine auction the time limit by when win auction
It submits a tender；
Wherein, highest bidder pays End-price according at least one bid classification belonging to it.
2. system according to claim 1, wherein the computer equipment of bidder has internal clocking mechanism, can be automatic
Identify and transmitted to server the timestamp of at least one sealed bid；
Wherein, timestamp is for determining the sequence submitted and submitted a tender, when timestamp includes, minute, second and millisecond；
Wherein, which is configured as stabbing to each sealed bid distribution time；
Wherein, at least one sealed bid will be stored securely in server during auction continues；
Wherein, in End of Auction, tender price and timestamp will be displayed to multiple registration bidders, and wherein bidder's is true
Real ID will not be shown to other registrations bidder；And
At the beginning of timestamp is for determining the auction set by the seller and the end time, wherein the remaining time auctioned will show
Show to multiple registration bidders.
3. system according to claim 1, wherein
Reserve price can be arranged by selling, which can be disclosed reserve price, or can be conditionity secret reserve price；Wherein
Before auction starts, disclosed reserve price, which will be disclosed, gives registration bidder, and all bids less than open reserve price all will be by
System is refused；And
The auction of open reserve price would not allow for the seller to terminate in advance, be clapped unless preset special circumstances are supported to terminate in advance
It sells.
4. system according to claim 3, wherein conditionity secret reserve price can be arranged by selling；Wherein,
In conditionity secret reserve price, there are two kinds of selections, wherein and the one permission seller of selection terminates auction in advance, if it is
If the tender price concealed reserve price preset higher than the seller that auction subject matter is outputed；Or the two permission seller of selection receives sealing
It submits a tender, even if being not above by the preset conditionity secret reserve price of the seller, the highest of submission for the tender price that subject matter is outputed
Tender price will be considered as tender price.
5. system according to claim 1, wherein the bid classification logotype belonging to bidder is divided into two classes, i.e., a kind of
Bidder and two class bidders, wherein at least one sealed bid contains a kind of bidder's mark or two class bidders mark, and
And the mark is received by the computer equipment of bidder, wherein bid classification logotype is decided in its sole discretion by bidder.
6. system according to claim 5, wherein if a kind of bidder of sealed bid is submitted to win auction, he/
She needs the sealed bid price that payment is submitted for auction subject matter within the scheduled time limit.
7. system according to claim 5, wherein two class bidders need acceptance and guarantee price protection to take before starting to submit a tender
Business expense；
Wherein, price protection service charge is some scheduled percentage of the tender price of two class bidders；And wherein, if
Two class bidders win auction, and highest bidder needs the final price paid to be calculated by price protection formula.
8. system according to claim 7, wherein system can be set to by selling, by price protection service charge by following
Mode is allocated, wherein covering price protection service charge is distributed to the seller；Or
Covering price protection service charge is distributed into one or the high bidder of Any and All Bid second, wherein price protection service charge
It can be allocated between the high bidder of Any and All Bid second with predetermined percentage or price protection service charge
It can also be allocated according to predetermined percentage by the seller and the second high bidder of bid, wherein if bid the
The two high more than people of bidder, price protection service charge can be in the high bidders of Any and All Bid second by predefining
Percentage be allocated.
9. system according to claim 7, wherein wherein price protection formula is counted by being added up to the following
Calculate the amount of money that highest bidder need to finally pay：Price protection service charge；And the second high tender price；And by highest bid lattice
It is multiplied by the amount of money that scheduled percentage obtains with the difference of the second high tender price.
10. system according to claim 8, wherein if only there are one artificial auction subject matters of submitting a tender, and sealing to be submitted to throw
Mark, and determine that oneself is two class bidders, the preset trigger price of the seller will be considered as the second high tender price.
11. system according to claim 8, wherein before End of Auction, if there is any one tender price is higher than item
Part secret reserve price, the seller can terminate auction in advance manually or system is predeterminable to terminate auction in advance automatically, wherein hidden
Secret reserve price will be considered as the second high tender price.
12. system according to claim 1, wherein every registration bidder only allows that an effective sealing is submitted to throw
Mark, before the auction time limit terminates, the effective sealed bid that bidder can submit it is modified and cancels；
Before change is submitted a tender, bidder should cancel pervious bid from system, and the bid being revoked will be in seal shape
State is until End of Auction.
13. system according to claim 1, wherein further include obtaining at least one note from the computer equipment of the seller
The dual confirmation of the volume seller or the dual confirmation that at least one registration bidder is obtained from the computer equipment of bidder；
Wherein, once the registration seller confirms that highest bidder pays corresponding cost, auction subject matter can consign to highest bidder, and confirm
The seller is the trigger price of auction subject matter setting or reserve price is correct；Or
Registration bidder confirms that the tender price that artificial subject matter is outputed of submitting a tender is correct, and confirms that it has the ability payment to clap
Sell the tender price and correlative charges that subject matter is outputed.
14. system according to claim 1, wherein at the end of the auction time limit, tender price needs to be higher than every other note
The sealed bid price that volume bidder submits；
Wherein, after auctioning the time limit, at least one sealed bid price and the random ID for registering bidder are displayed on
In display device, and the true ID of highest bidder is displayed to the seller.
15. system according to claim 14, wherein if at least two of the registration bidder from same bid classification
Identical highest bid lattice have been outputed in a sealed bid；
System, which provides the registration bidder of the same bid classification to output identical highest bid lattice, resubmits sealing throwing
Target chance；
At least one registration bidder resubmits sealed bid, submits the registration bidder of highest bid lattice that will win bat
It sells；
The registration bidder for outputing identical highest bid lattice continues to rebid, until one of registration bidder outputs
Tender price become highest until；Or
If above-mentioned bidder does not resubmit sealed bid, highest bid is had submitted at first in previous round bid
The registration bidder of price will win auction.
16. system according to claim 14, wherein if at least two adhere to the registration bidder of different bid classifications separately
Identical tender price is provided, the high bidder of End-price will be confirmed as highest bidder；Wherein, middle target registration is submitted a tender
The final price of people will be calculated according to the bid classification belonging to it.
17. system according to claim 1, wherein server contains one or more databases, which goes through
History is merchandised；
Wherein, database is that at least one of multiple registration bidders at least one of bidder or multiple registration sellers sell
Side provides the price reference of at least one valuable auction subject matter auctioned in the past；And
Wherein, database can be that at least one of multiple registration bidders bidder or multiple registration at least one of the seller sell
The valuable auction subject matter auctioned before square search inquiry is at least one, and the true ID of highest bidder need not be disclosed.
18. the method for sealed bid, this method include in a kind of auction：
Server receives the auction request in relation to auctioning subject matter from the computer equipment of at least one seller, and the auction request is extremely
Few description comprising auction subject matter and auction time limit；
It is shown and is auctioned to the computer equipment of at least one bidder based on auction request；
At least one sealed bid is received on the computer equipment of bidder within the auction time limit, and is transferred to service
Device, the tender price and at least one bid belonging to bidder that wherein at least one sealed bid must contain auction subject matter
Classification logotype；
Server is randomly assigned ID to bidder, within the auction time limit, for from at least one of bidder's computer equipment
Sealed bid, server will be that bidder distributes random ID；
Data record is created and stored at least one sealed bid in the server, which includes at least one at random
Distribute to the ID of bidder, true ID, timestamp and the tender price of bidder；
Server records according at least one sealed bid data and determines the bid for winning auction in End of Auction；And
Wherein, highest bidder will pay End-price according to the bid classification of its selection.
19. according to the method for claim 18, wherein have in the computer equipment of bidder and the computer equipment of the seller
Internal clocking mechanism；
Wherein, internal clocking mechanism automatic identification timestamp and it is transferred to server, at least one sealed bid and extremely
Few registration seller has corresponding timestamp to the displaying for auctioning subject matter；
Wherein, in End of Auction, tender price and timestamp will be shown to registration user, but do not show that bidder's is true
ID；
Wherein, it the end time and is communicated at the beginning of the auction of internal clocking mechanism automatic identification and with server；
Wherein, the remaining auction time is displayed at least one bidder to take part in auction, and selling for subject matter is auctioned in displaying
Side.
20. according to the method for claim 18, wherein dual confirmation will be obtained from the registration seller and registration bidder；
Wherein, the registration seller must confirm：Once End of Auction, after bidder pays corresponding cost, auction subject matter can carry out
It delivers, and confirms that the trigger price of seller's setting or reserve price are correct；And
Wherein, registration bidder must confirm：The tender price that artificial auction subject matter is outputed of submitting a tender is correct, and confirms that it has
Ability pays the tender price oneself outputed.
21. according to the method for claim 18, wherein may further include auction the time limit terminate before change or cancel close
The step of envelope is submitted a tender, wherein when sealed bid is modified or is cancelled, the sealed bid information for being modified or having cancelled will not
It is disclosed to other registration bidders and the seller, wherein in auction, an effective sealing can only be received from each bidder
It submits a tender.
22. according to the method for claim 18, wherein further comprise the step of reserve price is arranged in the seller, wherein reserve price can
To be disclosed or the concealed reserve price of conditionity；Wherein
Disclosed reserve price, which will be disclosed, before auction starts gives registration bidder, and all bids less than open reserve price all will be
System refusal；And
The seller that open reserve price is arranged does not allow to terminate auction in advance, needs to terminate bat in advance unless preset special circumstances occur
It sells.
23. according to the method for claim 22, wherein further comprise providing two kinds of selections for the seller, wherein reserve price can
To be conditionity secret reserve price；The one permission seller of selection terminates auction in advance, if there is bidding above for registration bidder is default
Concealed reserve price if, the seller can select to terminate auction in advance manually or be clapped according to the default automatic termination of the seller by system
It sells；Or
Selection two allows to receive sealed bid, even if tender price does not reach concealed reserve price, and the highest bid lattice submitted
It will be considered as tender price.
24. according to the method for claim 18, wherein if a kind of bidder wins auction, need predetermined
Its sealed bid price submitted is paid in time limit.
25. according to the method for claim 18, wherein two class bidders are submitting sealed bid within the time limit of auction
Purchasing price protection service is promised to undertake before, wherein only two class bidders need price paid protection service when winning auction
Taking, the amount of money that need to finally pay will be calculated according to price protection formula,
Wherein, two class bidders acceptance of the bid if, the amount of money for payment of most having in the end will be determined by price protection formula, wherein by will under
Every add up of row is calculated：
Price protection service charge；And
Second high tender price；And
The amount of money that scheduled percentages calculate is multiplied by by the difference of highest bid lattice and the second high tender price.
26. according to the method for claim 25, wherein if only take part in auction there are one bidder, and the bidder
Two class bidders are voluntarily selected as, then the preset trigger price of the seller is considered as the second high tender price, if there is any
A tender price is more than concealed reserve price, and auction terminates concealed reserve price and is considered as the second high tender price at once.
27. according to the method for claim 25, wherein the seller can distribute price protection service charge in the following manner,
In：
Covering price protection service charge is distributed into the seller；Or
Covering price protection service charge is distributed into one or the high bidder of Any and All Bid second, wherein price protection service charge
It can be allocated according to the preset percentage of the seller by the high bidder of Any and All Bid second, or
Price protection service charge can be divided between the second high bidder of the seller and bid by predetermined percentage
Match, wherein if outputing the more than people of bidder of identical second high tender price, price protection service charge can it is all go out
It is allocated by predetermined percentage between the high bidder of valence second.
28. according to the method for claim 18, wherein the tender price for winning auction in End of Auction needs to be higher than institute
There are other tender prices, wherein
If at least there are two the registration bidders for belonging to same bid classification to output identical highest bid in sealed bid
Price, they will be required to resubmit sealed bid；
Wherein, if at least one registration bidder resubmits sealed bid, the registration bidder for submitting highest bid lattice will
Win auction；
Wherein, the registration bidder for outputing identical highest bid lattice constantly will resubmit bid, submit a tender until one of
Until the tender price that people submits reaches highest；Or
If bidder does not resubmit sealed bid, the note of highest tender price is submitted at first in previous round bid
Volume bidder will win auction.
29. according to the method for claim 28, wherein if at least there are two the registrations for belonging to different bid classifications to throw
Mark people outputs identical highest bid lattice, and the concluded price of bidder will again be counted according to the bid classification belonging to them
It calculates, final price the higher person will be confirmed as highest bidder.
30. according to the method for claim 18, wherein may further include in the entire time-continuing process of auction to registration
The step of seller and registration bidder show at least one sealed bid includes random ID, the timestamp of displaying registration bidder
And tender price, the true ID of wherein highest bidder is only shown to the bidder to submit a tender in auction and selling for subject matter is auctioned in displaying
Side.
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 (1)
| Publication Number | Publication Date |
|---|---|
| CN108496195A true CN108496195A (en) | 2018-09-04 |
Family
ID=59625688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201680063828.9A Pending CN108496195A (en) | 2016-02-19 | 2016-02-19 | The method and system of sealed auction of submitting a tender |
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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113205399A (en) * | 2021-05-21 | 2021-08-03 | 中国联合网络通信集团有限公司 | Electronic bidding method, bidding node, first bidding node and third party node |
| CN117592458A (en) * | 2024-01-19 | 2024-02-23 | 辽宁省网联数字科技产业有限公司 | Digital bidding document blind box analysis method and system based on artificial intelligence |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| MX2019003857A (en) * | 2016-10-03 | 2019-09-18 | Operr Tech Inc | System and method for reverse sealed bid auctions. |
| EP3688712A4 (en) * | 2017-09-27 | 2021-06-23 | Bynfor, Inc. | Method and system for online auctions |
| JP7196137B2 (en) * | 2020-07-30 | 2022-12-26 | バインフォー・インコーポレイテッド | Sealed-bid auction method and system |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020116316A1 (en) * | 2001-02-21 | 2002-08-22 | Peter Griffiths | Auction manager system and method of operation |
| 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 |
| US20080114622A1 (en) * | 2006-11-13 | 2008-05-15 | Hugh Crean | System and method of protecting prices |
| US20080133400A1 (en) * | 2005-02-07 | 2008-06-05 | Molloy Mark E | Synthetic continuous double actions |
| US7398229B2 (en) * | 2004-06-04 | 2008-07-08 | Isis Innovation Limited | System and method for conducting electronic commerce |
| US20090182680A1 (en) * | 2005-08-31 | 2009-07-16 | Transitiondynamics International, Inc. | System and method for anonymized disclosure of corporate data in electronic negotiations |
| US20100256999A1 (en) * | 2004-06-14 | 2010-10-07 | Accenture Global Services Gmbh | Auction result prediction with auction insurance |
| US20100325008A1 (en) * | 2009-06-18 | 2010-12-23 | Michlitsch Kenneth J | Methods for transforming an auctioned item of unknown value and buyer into an auctioned item of known value and buyer |
| US8095429B1 (en) * | 2004-04-26 | 2012-01-10 | The Jellyvision Lab, Inc. | Method and system for providing an on-line auction |
| CN103854214A (en) * | 2012-11-28 | 2014-06-11 | 阿里巴巴集团控股有限公司 | Processing method and system for auction data |
| US20150091741A1 (en) * | 2010-10-14 | 2015-04-02 | Palo Alto Research Center Incorporated | Computer-Implemented System And Method For Providing Management Of Motor Vehicle Parking Spaces During Scheduled Street Sweeping |
| US10235688B2 (en) * | 2010-12-24 | 2019-03-19 | First Data Corporation | Web and mobile device advertising |
Family Cites Families (7)
| 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 |
| US20030041010A1 (en) * | 2001-08-23 | 2003-02-27 | Mark Yonao-Cowan | Online bidding for contracts |
| KR100494302B1 (en) * | 2003-03-27 | 2005-06-10 | 송승준 | On-line auction system and the method for the same |
| 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 |
| EA021508B1 (en) * | 2011-08-24 | 2015-07-30 | Открытое Акционерное Общество "Инфотекс" | Method of protected data exchange in e-auction and system for implementation thereof |
-
2016
- 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 MY MYPI2018701660A patent/MY202250A/en unknown
- 2016-02-19 EP EP16890421.7A patent/EP3417416A4/en not_active Withdrawn
- 2016-02-19 RU RU2018119336A patent/RU2708789C2/en active
- 2016-02-19 AU AU2016393168A patent/AU2016393168A1/en not_active Abandoned
- 2016-02-19 CN CN201680063828.9A patent/CN108496195A/en active Pending
- 2016-02-19 CA CA3003562A patent/CA3003562C/en active Active
- 2016-02-19 KR KR1020187014942A patent/KR20180113971A/en unknown
- 2016-02-19 SG SG11201803465WA patent/SG11201803465WA/en unknown
- 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
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020116316A1 (en) * | 2001-02-21 | 2002-08-22 | Peter Griffiths | Auction manager system and method of operation |
| 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 |
| US8095429B1 (en) * | 2004-04-26 | 2012-01-10 | 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 |
| US20100256999A1 (en) * | 2004-06-14 | 2010-10-07 | Accenture Global Services Gmbh | Auction result prediction with auction insurance |
| US20080133400A1 (en) * | 2005-02-07 | 2008-06-05 | Molloy Mark E | Synthetic continuous double actions |
| US20090182680A1 (en) * | 2005-08-31 | 2009-07-16 | Transitiondynamics International, Inc. | System and method for anonymized disclosure of corporate data in electronic negotiations |
| US20080114622A1 (en) * | 2006-11-13 | 2008-05-15 | Hugh Crean | System and method of protecting prices |
| US20100325008A1 (en) * | 2009-06-18 | 2010-12-23 | Michlitsch Kenneth J | Methods for transforming an auctioned item of unknown value and buyer into an auctioned item of known value and buyer |
| US20150091741A1 (en) * | 2010-10-14 | 2015-04-02 | Palo Alto Research Center Incorporated | Computer-Implemented System And Method For Providing Management Of Motor Vehicle Parking Spaces During Scheduled Street Sweeping |
| US10235688B2 (en) * | 2010-12-24 | 2019-03-19 | First Data Corporation | Web and mobile device advertising |
| CN103854214A (en) * | 2012-11-28 | 2014-06-11 | 阿里巴巴集团控股有限公司 | Processing method and system for auction data |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113205399A (en) * | 2021-05-21 | 2021-08-03 | 中国联合网络通信集团有限公司 | Electronic bidding method, bidding node, first bidding node and third party node |
| CN113205399B (en) * | 2021-05-21 | 2023-07-14 | 中国联合网络通信集团有限公司 | Electronic bidding method, first bidding node equipment and neutral third party node equipment |
| CN117592458A (en) * | 2024-01-19 | 2024-02-23 | 辽宁省网联数字科技产业有限公司 | Digital bidding document blind box analysis method and system based on artificial intelligence |
| CN117592458B (en) * | 2024-01-19 | 2024-04-05 | 辽宁省网联数字科技产业有限公司 | Digital bidding document blind box analysis method and system based on artificial intelligence |
Also Published As
| Publication number | Publication date |
|---|---|
| RU2018119336A3 (en) | 2019-11-25 |
| PH12018500891A1 (en) | 2018-10-29 |
| AU2016393168A1 (en) | 2018-05-10 |
| EP3417416A1 (en) | 2018-12-26 |
| JP6839185B2 (en) | 2021-03-03 |
| WO2017141074A1 (en) | 2017-08-24 |
| RU2018119336A (en) | 2019-11-25 |
| CA3003562C (en) | 2023-05-09 |
| MX2018004967A (en) | 2019-04-09 |
| EP3417416A4 (en) | 2019-07-10 |
| SG11201803465WA (en) | 2018-05-30 |
| KR20180113971A (en) | 2018-10-17 |
| JP2019507399A (en) | 2019-03-14 |
| RU2708789C2 (en) | 2019-12-11 |
| MY202250A (en) | 2024-04-19 |
| ZA201803418B (en) | 2019-07-31 |
| CA3003562A1 (en) | 2017-08-24 |
| IL258930A (en) | 2018-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220180426A1 (en) | Method and system for sealed bid auctions | |
| US20080082355A1 (en) | Integrated rights marketplace systems and methods | |
| US20080109296A1 (en) | Contingent rights exchange associated with a social network | |
| US20090070249A1 (en) | Contingent event rights relating to team location | |
| US20080243532A1 (en) | Contingent purchase rights associated with consumer products | |
| US20080109234A1 (en) | Secondary market for contingent rights exchange | |
| US20080109322A1 (en) | Rights exchange user interface | |
| US20080109345A1 (en) | Contingent rights exchange relating to non-post season sporting events | |
| US20080109321A1 (en) | Contingent forward rights exchange | |
| US20080103801A1 (en) | Contingent travel rights exchange | |
| US20080103920A1 (en) | Contingent rights relating to a weather phenomenon | |
| US20080109323A1 (en) | Associating media channels with a contingent rights exchange | |
| US20080109297A1 (en) | Methods and systems for pricing contingent rights | |
| US20080103802A1 (en) | Contingent rights exchange relating to music production | |
| US20080103919A1 (en) | Contingent consumer product rights exchange | |
| US20080109233A1 (en) | Contingent rights exchange relating to a private event, good or service | |
| US20080103803A1 (en) | Contingent event rights relating to an event participant | |
| CN108496195A (en) | The method and system of sealed auction of submitting a tender | |
| US20190080394A1 (en) | Method and system for online auctions | |
| Parikh | Scarlet-Lettered Bankruptcy: A Public Benefit Proposal for Mass Tort Villains | |
| Sandler | Citrus groves in the cloud: Is cryptocurrency cloud mining a security? | |
| AU2018338645A1 (en) | Method and system for online auctions | |
| US20130024314A1 (en) | Method of selling items | |
| JP7196137B2 (en) | Sealed-bid auction method and system | |
| Simpson | Consumers Caught in the Cryptocurrency Crisis: Why Celebrity Endorsers Should Not Escape Liability |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20230614 Address after: Room 402, 30-50 Whitestone Expressway, Flushing, New York, USA Applicant after: Baifu Group Co. Address before: New York, United States Applicant before: Kevin Surin Wang |
|
| TA01 | Transfer of patent application right | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180904 |
|
| RJ01 | Rejection of invention patent application after publication |