CN102831545A - Novel network bidding system - Google Patents
Novel network bidding system Download PDFInfo
- Publication number
- CN102831545A CN102831545A CN2012103209397A CN201210320939A CN102831545A CN 102831545 A CN102831545 A CN 102831545A CN 2012103209397 A CN2012103209397 A CN 2012103209397A CN 201210320939 A CN201210320939 A CN 201210320939A CN 102831545 A CN102831545 A CN 102831545A
- Authority
- CN
- China
- Prior art keywords
- bidding
- subscript
- data
- module
- commodity
- 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
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a network bidding system, which is used for a bidder to bid commodities through the internet. The system comprises a database storage, a bidding module, a bidding price calculation module, a bid winning calculation module, a target commodity management module and an interactive display module, wherein the bidding module carries out cycling alteration processing on bid beginning price data of the commodity according to the bidding behavior of the bidder, so that another bidding price data are generated; the another bidding price data are stored in the database storage and set as the existing bidding price data; if the bidder triggers to the bidding module again, the bidding module carries out the same cycling alteration processing so as to achieve the bidding mode. Therefore, when the existing bidding price data are equal to the tolerant bidding price data, the bid winning calculation module decides the bidder of the existing bidding price data as the bidding winner; or when the bidding time ends, the existing bidding price data are not equal to the tolerant bidding price data, the bid winning calculation module decides the last bidder as the bidding winner. According to the network bidding system, various bidding mode is achieved through a specific calculation rule so as to provide an abundant bidding mode for consumers; and enterprises can attract more consumers by using the operation mechanism.
Description
Technical field
Technical field of the present invention provides a kind of network bidding system, refers to that especially a kind of suitor of confession sees through the network auction system of internet competitive bidding commodity, and realizes combining with internet advertising marketing.
Background technology
Traditional network auction pattern mainly is divided into two kinds, and one is English auction, promptly must mark according to the highest suitor of bid, and buy commodity with the price of competitive bidding, or the highest price bidder in special time buys commodity; Two are the sealed tender mode, and promptly every buyer only can go out valency one time, and does not all know each other to bid separately, when closing time, announces all marked prices simultaneously by website operator, and must be marked by highest price.
Flourish along with the Internet, the innovation of the auction formats of commodity emerges in an endless stream, and brings more convenient, polynary, diversified consumption mode for the consumer.
Yet the present auction model of main flow and can't attract more consumers together to participate in competitive bidding is if enterprise also can't attract the more consumers activity that takes part in auction prolonging with the auction system under the line.
Summary of the invention
One of the present invention purpose provides a kind of network bidding system, supplies suitor's competitive bidding with the specific calculation to commodity price data in system, and then attracts more consumers, and this system architecture is simple, is beneficial to operation, can realize that price changes in proper order.
Another object of the present invention is to make system reach the purpose of the mode diversification of bidding with the simple calculations rule by the specific calculation of commodity price data.
For reaching above-mentioned purpose and other purposes, the invention discloses a kind of network bidding system, it is characterized in that comprising: a subscript module is used for competitive bidding and begins the back and for the suitor subscript operation is provided, and the bidding price of subject matter done increasing or decreasing handle; A database storage module is used to store subject matter information, comprises commodity essential information, price, auction data, user profile; Must mark computing module for one, the unique bidder who is used for confirming the auction price that subject matter is final and has this price; An interaction display module is used for the whole auction process of Dynamic Display, and behind End of Auction, whole auction process is saved in database; A merchandise control module is used for the management of commodity auction time, the displaying of merchandise news.
In one embodiment of the invention, this subscript computing module adopts a kind of increasing or decreasing one specific variations price data, makes price data or present bidding price data change processing in proper order so that target is risen.
More comprise in one embodiment of the invention: a competitive bidding time module reciprocal is that connection is somebody's turn to do to such an extent that mark computing module, has two stages.
Phase one,, after competitive bidding begins,, control and be somebody's turn to do to such an extent that the mark computing module makes it determine that this affiliated suitor of present bidding price data is the winning bidder through the time interval of this acquiescence competitive bidding time data in order to according to one of internal memory acquiescence competitive bidding time data.
Subordinate phase; If at end of phase one in a certain set time; The generation of competitive bidding behavior is arranged, will trigger this stage, as long as the generation of competitive bidding behavior was arranged in this stage; Then the competitive bidding time will automatically prolong to a certain set time, and this set time is compared the meeting weak point much with the competitive bidding time of acquiescence usually.
In one embodiment of the present of invention, the network bidding system more can comprise: suitor's account management system comprises suitor's integration managing; The feedback of competitive bidding cost; Also more comprise an online purchase system, be used for the payment of the not enough amount of money of auction trade mark, and the information inquiry of commodity logistics.
For making the auditor further understanding and understanding can be arranged to purpose, characteristic and the effect of the utility model, please cooperate brief description of drawingsfig to detail now as after.
Description of drawings
Fig. 1 is the system schematic of the present invention in an implementation system.
Fig. 2 is an auction process flow diagram of the present invention.
Fig. 3 participates in the process flow diagram of auction for user of the present invention.
Fig. 4 buys the process flow diagram of commodity in the intact back of auction for user of the present invention.
Embodiment
Fig. 1 is according to system schematic of the present invention.The present invention's network bidding systems is installed in the webserver; Be used to supply the suitor to come the competitive bidding commodity through the internet; This communication network is mainly cable network, wireless network etc. and can connects open network (for example: the network the Internet) also comprises the 2G/3G network.
The present invention's network bidding system comprises: subscript module 101, competitive bidding computing module 102, interactive module 103, commodity control module 104, subscriber information module 105 and data storage module 106.To participate in specific broken number (for example: 1 ~ 4 roll over) conduct the marked price lattice of the commodity of competitive bidding among one of the present invention embodiment according to its market price; Suitor's subscript behavior will make this suitor's the certain integration of accounts deduction; And this plays the each time subscript behavior in proper order change of marked price lattice along with the suitor; And the price after the order change each time promptly can become new present bidding price data; Promptly can to change in proper order with these present bidding price data be next new present bidding price data to timestamp under next suitor; So the order change is gone down, when the not earthquake at the appointed time of present bidding price or this bidding price reach in a certain special value (as original cost 5%) time, the suitor under these present bidding price data is the winning bidder.
Fig. 2 is the process flow diagram according to auction of the present invention, and auction employing order variable price is handled, and auction time lengthening module is arranged.The order change is meant that order increases progressively processing or the processing of successively decreasing in proper order.Increase progressively processing with order, when a subscript behavior was arranged, the present bidding price data of commodity will increase a specified amount, when present bidding price data are not increasing at the appointed time, just can determine the winning bidder.
With the example that order is successively decreased and handled, suppose that a marked price lattice of commodity are 100 yuan, when the 1st sub-subscript behavior takes place, from 1 yuan of marked price deduction, and with 99 yuan of present bidding price data as these commodity.When the 2nd sub-subscript behavior takes place; From 1 yuan of present bidding price data (99 yuan) deduction; And with 98 yuan as the up-to-date present bidding price data of these commodity; By that analogy, when this commodity not earthquake in official hour (for example: 20 yuan) or up-to-date present bidding price data reduce to give tacit consent to during marked price lattice data (for example: 5 yuan), the affiliated suitor of this bidding price is the winning bidder.Therefore, this moment, this winning bidder promptly buied this commodity with 20 yuan or 5 yuan, wherein; If this winning bidder is repeatedly a subscript; Then the actual cost of buying these commodity of this winning bidder is repeatedly the subscript expense (for example: the subscript expense is 1 yuan each time, and the winning bidder is total to subscript 3 times, and then its total cost of buying commodity is 23 yuan or 8 yuan) that subscript is paid; Otherwise; If this winning bidder is subscript 1 time only, the subscript expense of then being paid is minimum (for example: the subscript expense is 1 yuan each time, and total cost that the winning bidder buys commodity is 21 yuan or 6 yuan).
Also comprise the auction time processing that automatically prolongs in the auction process of the present invention, for instance: a commodity auction duration was made as 12 hours, when auction countdown also remaining last 30 seconds the time; If in this time, there is not the subscript behavior, last suitor is the successful bidder so, or in the end 30 seconds the subscript behavior is arranged; Countdown will return to and pick up counting in 30 seconds so; If somebody's competitive bidding afterwards is with continuing to return to so circulation 30 seconds; The subscript of in 30 seconds, having no talent, last suitor is the successful bidder.
Fig. 3 is the process flow diagram of participating in auction according to user of the present invention, when the user participates in auction at every turn, all need pay the auction expense with integration, fixedly collects at every turn, if integration is not enough to pay this auction behavior, then need buy integration.If the user participates in this auction when accumulating used integration and being higher than certain numerical value (user's setting) or commodity original cost 40%, will point out the user.
Fig. 4 is a process flow diagram of buying commodity according to user of the present invention in the intact back of auction; The user can be divided into two kinds of situation after participating in completion of an auction, first kind be clap commodity; If the user clap in the process of commodity the used integration of accumulative total and last recorded price lattice sum be higher than commodity value; The difference that then returns to both is given the user, if the user clap in the process of commodity the used integration of accumulative total be lower than commodity value with last recorded price lattice sum, the user just need pay by last recorded price so.
Second kind be the user do not clap commodity, if these commodity only support the auction, the user will have no right to buy this commodity so; If this commodity support directly buys, the user can supply the original cost of commodity and the difference of used integration is bought this commodity so.
The present invention discloses with some embodiment hereinbefore, so has the knack of this operator and it should be understood that this embodiment only is used to describe this creation, and should not be read as the scope that limits the present invention.It should be noted, with the variation and the displacement of this embodiment equivalence, all should be made as in the category that is covered by the present invention such as.Therefore, the present invention's protection domain when with claim the person of being defined be as the criterion.
Claims (7)
1. a network bidding system is installed in the server end, uses for subscript person and sees through communication network competitive bidding commodity, and comprise: a database storage device is used for store commodity information, competitive bidding information and winning bidder's information; One subscript module is used for competitive bidding and begins the back and supply subscript person's subscript, this database storage device of this subscript Module Links with obtain supply these commodity that subscript person browses play marked price lattice data, and be used for subscript person's subscript information data is stored to this database storage device; One bidding price computing module, tethers connect this database storage device and this subscript module, are used for according to subscript person's subscript behavior a marked price lattice data or the present bidding price data of these commodity being carried out a change processing in proper order; And one must mark computing module, and tethers connects this database storage device, be used to these present bidding price data equal this one of mark computing module internal memory give tacit consent to during marked price lattice data, determine these present bidding price data affiliated under the mark person be the winning bidder; One interactive module, be when mark commodity in auction process, Dynamic Display goes out whole auction process; Show up-to-date target price synchronously, and behind End of Auction, preserve the whole process of auction in database; And auction information is synchronized to self and third party exchanges and (comprise and be not limited to weibo.com; Renren.com, facebook.com, t.qq.com) platform; One commodity displaying module provides the commodity auctions time (comprise start time/termination of prolongation/auction time of setting/auction time of auction time), and merchandise news provides.
2. according to claim 1 network bidding system; Wherein this bidding price computing module is to be used for adopting increasing progressively in proper order to handle or successively decrease in proper order to handle changing processing in proper order as this; This is played marked price lattice data or present bidding price data, increase or deduct the specific variations price data.
3. according to claim 1 network bidding system; Wherein more comprise: competitive bidding time module reciprocal; System connect be somebody's turn to do the mark computing module; In order to according to one of internal memory acquiescence competitive bidding time data, after competitive bidding begins through the time interval of this acquiescence competitive bidding time data and this present bidding price data do not equal as yet this this of mark computing module internal memory give tacit consent to during marked price lattice data, control be somebody's turn to do the mark computing module make its determine these present bidding price data affiliated under the mark person be the winning bidder.
4. according to claim 1 network bidding system; Wherein be somebody's turn to do to such an extent that the mark computing module more comprises the total subscript amount of money data that are used for count index person, and the total subscript amount of money data that are used for the price data of competitive bidding commodity are deducted the winning bidder wait to mend amount of money data with what export this winning bidder.
5. according to claim 1 network bidding system wherein is somebody's turn to do to such an extent that the mark computing module more is used for output prompting message when these total subscript amount of money data equal the price data of these competitive bidding commodity.
6. according to claim 1 network bidding system, wherein this competitive bidding time module reciprocal more comprises and is used for prolonging this acquiescence competitive bidding time data.
7. according to claim 1 network bidding system wherein more comprises: subscript person's accounts database reservoir, and tethers connects this subscript module, in order to store the amount of money data of subscript person's residue; And a feedback counting module, tethers connects this subscript person's accounts database reservoir and this subscript module, in order to the subscript person in the preset feedback subscript time, stores a feedback amount of money data to this subscript person's account.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103209397A CN102831545A (en) | 2012-09-03 | 2012-09-03 | Novel network bidding system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103209397A CN102831545A (en) | 2012-09-03 | 2012-09-03 | Novel network bidding system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102831545A true CN102831545A (en) | 2012-12-19 |
Family
ID=47334664
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012103209397A Pending CN102831545A (en) | 2012-09-03 | 2012-09-03 | Novel network bidding system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102831545A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104240089A (en) * | 2013-06-18 | 2014-12-24 | 乐市亚太股份有限公司 | Bidding method with different information indications and access tights |
| WO2015051732A1 (en) * | 2013-10-07 | 2015-04-16 | 朱锐泷 | Scrambling/passing-based real-time application system |
| CN104636969A (en) * | 2013-11-15 | 2015-05-20 | 易拍全球(北京)科贸有限公司 | Artwork time-limited auction system |
| CN105205004A (en) * | 2015-10-28 | 2015-12-30 | 广州华多网络科技有限公司 | Method and system for realizing multi-window auction control |
| TWI603278B (en) * | 2016-06-17 | 2017-10-21 | 南臺科技大學 | Method of determining bid winner in on-line auction by automatically decreasing bidding prices |
| TWI603277B (en) * | 2013-11-29 | 2017-10-21 | 南臺科技大學 | Method, system, computer program and computer-readable recording medium for random type auction |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020038282A1 (en) * | 2000-09-27 | 2002-03-28 | Montgomery Rob R. | Buyer-side auction dynamic pricing agent, system, method and computer program product |
| CN201274061Y (en) * | 2008-06-24 | 2009-07-15 | 翁启文 | Commodity auction deciding system |
| CN101894352A (en) * | 2010-08-17 | 2010-11-24 | 深圳市金槌拍卖行有限公司 | Network-based auction method and system |
-
2012
- 2012-09-03 CN CN2012103209397A patent/CN102831545A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020038282A1 (en) * | 2000-09-27 | 2002-03-28 | Montgomery Rob R. | Buyer-side auction dynamic pricing agent, system, method and computer program product |
| CN201274061Y (en) * | 2008-06-24 | 2009-07-15 | 翁启文 | Commodity auction deciding system |
| CN101894352A (en) * | 2010-08-17 | 2010-11-24 | 深圳市金槌拍卖行有限公司 | Network-based auction method and system |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104240089A (en) * | 2013-06-18 | 2014-12-24 | 乐市亚太股份有限公司 | Bidding method with different information indications and access tights |
| WO2015051732A1 (en) * | 2013-10-07 | 2015-04-16 | 朱锐泷 | Scrambling/passing-based real-time application system |
| CN104636969A (en) * | 2013-11-15 | 2015-05-20 | 易拍全球(北京)科贸有限公司 | Artwork time-limited auction system |
| TWI603277B (en) * | 2013-11-29 | 2017-10-21 | 南臺科技大學 | Method, system, computer program and computer-readable recording medium for random type auction |
| CN105205004A (en) * | 2015-10-28 | 2015-12-30 | 广州华多网络科技有限公司 | Method and system for realizing multi-window auction control |
| CN105205004B (en) * | 2015-10-28 | 2018-03-23 | 广州华多网络科技有限公司 | Realize the method and system of multiwindow auction control |
| TWI603278B (en) * | 2016-06-17 | 2017-10-21 | 南臺科技大學 | Method of determining bid winner in on-line auction by automatically decreasing bidding prices |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102831545A (en) | Novel network bidding system | |
| Oh et al. | Investor experience matters: Evidence from generative art collections on the blockchain | |
| CN108898436A (en) | Advertisement placement method and system, server and computer readable storage medium | |
| Li et al. | Coordinating replenishment and pricing in a firm | |
| CN105531735A (en) | Preferential internet auction system on basis of bid participation time | |
| KR20200095223A (en) | System and method for trade of design based on exchange and computer program for the same | |
| CN102999863A (en) | Auction method and server | |
| CN108921613A (en) | Advertisement price competing method, system and advertisement placement method, system | |
| CN103620632A (en) | Method and device for providing stock information | |
| CN111415179A (en) | User rights information processing method and device and electronic equipment | |
| Sun et al. | The optimal format to sell a product through the internet: Posted price, auction, and buy-price auction | |
| CN110827149A (en) | Method for constructing distributed economic system Deco based on block chain | |
| CN109685655A (en) | A kind of generation method of securities trading suggestion, device, system and block chain node | |
| CN201274061Y (en) | Commodity auction deciding system | |
| KR102218800B1 (en) | A method for providing transaction services of advertisement traffic networks | |
| TWM422128U (en) | Network auction system | |
| CN107274230A (en) | Consumption data processing method and processing device | |
| TWI597676B (en) | Method for managing bonuses and service server thereof | |
| JP5699175B2 (en) | Advertisement distribution system, method and program | |
| CN112396500A (en) | E-commerce marketing system based on live broadcast technology | |
| CN112330369A (en) | Online trading system for agricultural and sideline products | |
| TWI601082B (en) | Method of selling goods at a reduced price | |
| Li et al. | Research on the Profit Model of Tiktok Live Broadcast E-commerce Platform | |
| Liu | Recognition of virtual currency sales revenue of online game companies | |
| TW201337820A (en) | Refined Dutch auction method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20121219 |