CN113191861A - Auction method, computer device and storage medium - Google Patents
Auction method, computer device and storage medium Download PDFInfo
- Publication number
- CN113191861A CN113191861A CN202110488594.5A CN202110488594A CN113191861A CN 113191861 A CN113191861 A CN 113191861A CN 202110488594 A CN202110488594 A CN 202110488594A CN 113191861 A CN113191861 A CN 113191861A
- Authority
- CN
- China
- Prior art keywords
- auction
- time interval
- commodity
- transaction
- bidding
- 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.)
- Granted
Links
Images
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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/0611—Request for offers or quotes
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Technology Law (AREA)
- Entrepreneurship & Innovation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides an auction method, a computer device and a storage medium, wherein the method comprises the following steps: receiving a first auction-initiated transaction for a first commodity; when the execution of the first auction initiation transaction is successful, recording the bidding time interval of the first commodity on the block chain; receiving a first auction transaction for auctioning a first commodity generated by a second terminal of a first auctioneer; wherein the first auction transaction comprises a first auction; when the first auction transaction is successfully executed, recording a first auction price on the block chain; determining an auction time interval of the first commodity according to a pre-configured auction time interval selection rule; searching the highest auction price of the first commodity from the auction time interval, and determining a second auctioneer with the highest auction price as an auctioneer of the first commodity; and within the first payment block height interval, if the payment transaction of the first commodity generated by the third terminal of the second auction player is received and successfully executed, the auction is ended. The method and the system for realizing the auction service have better user experience on the block chain.
Description
Technical Field
The present application relates to the field of blockchain technology, and in particular, to an auction method, a computer device, and a storage medium.
Background
During the auction process, if the auction mode is non-extendable, there is a first scenario as follows: there may be a last few minutes or seconds for the auction merchandise to be high priced snipped. If the auction mode is extendable, there will be the following second scenario: several people are met and continuously added with price, so that the auction time is prolonged all the time.
Both the first scenario and the second scenario may cause a user experience to be poor.
Disclosure of Invention
In view of the above-mentioned drawbacks and deficiencies of the prior art, it would be desirable to provide an auction method, a computer device, and a storage medium that enable an auction service with a better user experience over a blockchain.
In a first aspect, the present invention provides an auction method for blockchain nodes, where the method includes:
receiving a first auction-initiated transaction for a first item generated by a first terminal of a first merchant;
when the execution of the first auction initiation transaction is successful, recording the bidding time interval of the first commodity on the block chain;
receiving a first auction transaction for auctioning a first commodity generated by a second terminal of a first auctioneer; wherein the first auction transaction comprises a first auction;
when the first auction transaction is successfully executed, recording a first auction price on the block chain;
determining an auction time interval of the first commodity according to a pre-configured auction time interval selection rule; wherein the auction time interval is included in the bid time interval;
searching the highest auction price of the first commodity from the auction time interval, and determining a second auctioneer with the highest auction price as an auctioneer of the first commodity;
and within the first payment block height interval, if the payment transaction of the first commodity generated by the third terminal of the second auction player is received and successfully executed, the auction is ended.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform an auction method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute an auction method provided according to embodiments of the present invention.
Embodiments of the present invention provide auction methods, computer devices, and storage media that initiate a transaction by receiving a first auction for a first item generated by a first terminal of a first merchant; when the execution of the first auction initiation transaction is successful, recording a bidding block height interval of the first commodity on a block chain; receiving a first auction transaction for auctioning a first commodity generated by a second terminal of a first auctioneer; when the first auction transaction is successfully executed, recording a first auction price on the block chain; determining an auction block height interval of the first commodity according to a pre-configured auction block height interval selection rule; searching the highest auction price of the first commodity from the auction zone height interval, and determining a second auctioneer with the highest auction price as an auctioneer for obtaining the first commodity; and in the first payment block height interval, if the payment transaction of the first commodity generated by the third terminal of the second auction player is received and successfully executed, the auction is ended, and the auction service with better user experience is realized on the block chain.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of an auction method according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a flowchart of an auction method according to an embodiment of the present invention. As shown in fig. 1, in this embodiment, the present invention provides an auction method for blockchain nodes, where the method includes:
s11: receiving a first auction-initiated transaction for a first item generated by a first terminal of a first merchant;
s12: when the execution of the first auction initiation transaction is successful, recording the bidding time interval of the first commodity on the block chain;
s13: receiving a first auction transaction for auctioning a first commodity generated by a second terminal of a first auctioneer; wherein the first auction transaction comprises a first auction;
s14: when the first auction transaction is successfully executed, recording a first auction price on the block chain;
s15: determining an auction time interval of the first commodity according to a pre-configured auction time interval selection rule; wherein the auction time interval is included in the bid time interval;
s16: searching the highest auction price of the first commodity from the auction time interval, and determining a second auctioneer with the highest auction price as an auctioneer of the first commodity;
s17: and within the first payment block height interval, if the payment transaction of the first commodity generated by the third terminal of the second auction player is received and successfully executed, the auction is ended.
Specifically, taking as an example that the first auction initiated transaction includes a bidding time interval of the auctioned first commodity, the first payment block height interval is 1000 block heights after the bidding time interval is ended, and S15 includes "determining the last 25% of the bidding time interval as the auction time interval";
suppose that a merchant A auctions a commodity S, and auction participants B to F participate in the auction of the commodity S;
the terminal of the merchant A responds to the request of the merchant A for auctioning the commodity S, generates an auction initiation transaction tx1 (the bidding time interval of the first commodity is designated to be 2021-04-0810: 00: 00-2021-04-1010: 00:00) and sends the auction initiation transaction tx1 to the blockchain network;
the blockchain node performs step S11, receiving tx 1;
the block chain node executes step S12, and records the bidding time interval 2021-04-0810: 00: 00-2021-04-1010: 00:00 of the commodity S on the block chain when the tx1 is successfully executed;
responding to the auction of the commodity S participated by the auctioneer B by the terminal of the auctioneer B, generating an auction transaction tx2 and sending the auction transaction tx2 to the blockchain network;
the blockchain node performs step S13, receiving tx 2;
the blockchain node performs step S14, and if tx2 is packaged at 2021-04-0912: 00:00, records Price _ B (hereinafter referred to as PB) to the blockchain when tx2 is successfully performed; those skilled in the art will appreciate that tx2 fails tx2 execution if it is not packed in the bid time interval described above;
similarly, the terminals of the auction participants C to F finally generate auction transactions tx3 to tx6 and send the transactions to the blockchain network;
the blockchain node executes the steps S13-S14, and records the PC-PF to the blockchain, wherein tx 3-tx 5 are packaged in 2021-04-1002: 00:00, and tx6 is packaged in 2021-04-109: 00: 00;
the block chain link point executes the step S15, and determines the time interval of the last 25% of the bidding time interval as an auction time interval, wherein the auction time interval is 2021-04-0922: 00: 00-2021-04-1010: 00: 00;
the block chain node executes the step S16, searches the highest auction of the commodity S from 2021-04-0922: 00: 00-2021-04-1010: 00:00, and determines the auctioneer F as the auctioneer of the commodity S if the PF is the highest auction;
assuming a block height of 13516676 for 2021-04-1010:00:00, the payment block height interval for item S is [13516676,13517676 ];
the terminal of the auctioneer F responds to payment of the commodity S by the auctioneer F, generates a payment transaction tx7 of the commodity S and sends tx7 to the blockchain network;
the blockchain node performs step S17, and in [13516676,13517676], if tx7 is received and successfully executed, the auction ends.
In further embodiments, the first auction-initiating transaction may not include a bidding time interval, which may be determined by the block link points according to a pre-configured bidding time interval selection rule and recorded onto the block chain; it will be appreciated by those skilled in the art that the bid time interval selection rules can be configured according to actual requirements, for example, to 48 hours from the time the first auction is initiated for packaging, to achieve the same technical effect.
In further embodiments, the first payment block height interval may be configured according to actual requirements, for example, to 500 block heights after the bidding time interval is over; it will be appreciated by those skilled in the art that the first payment block height interval may also be replaced by a first payment time interval according to actual requirements, achieving the same technical effect.
In further embodiments, S15 may be configured according to actual requirements, for example, to "determine the time interval of the middle 50% of the bidding time interval as the auction time interval", or other more random determination mechanisms, and the same technical effect may be achieved.
Those skilled in the art will appreciate that the block height and time can be switched, so the present application can also be simply transformed into:
"receiving a first auction-initiated transaction for a first item generated by a first terminal of a first merchant;
recording a bid block height interval for the first item onto a block chain upon successful performance of the first auction-initiating transaction;
receiving a first auction transaction for auctioning a first commodity generated by a second terminal of a first auctioneer; wherein the first auction transaction comprises a first auction;
when the first auction transaction is successfully executed, recording a first auction price on the block chain;
determining an auction block height interval of the first commodity according to a pre-configured auction block height interval selection rule; wherein the auction block height interval is included in the bid block height interval;
searching the highest auction price of the first commodity from the auction zone height interval, and determining a second auctioneer with the highest auction price as an auctioneer for obtaining the first commodity;
if the payment transaction of the first commodity generated by the third terminal of the second auction player is received and successfully executed in the first payment block height interval, the auction is ended, and the same technical effect can be achieved.
The above-described embodiments enable an auction service with a better user experience on the blockchain.
Preferably, recording the first bid on the blockchain comprises:
freezing a plurality of certificates of a first account of a first auction player, and recording a first auction price on a block chain;
after the second auctioneer with the highest price is determined as the auctioneer of the first commodity, the method further comprises the following steps:
unfreezing the deposit frozen by the account of the other auction participants of the first commodity, which are not the second auction participant;
the method further comprises the following steps:
if the payment transaction is not received or if the payment transaction is not successfully executed, the deposit blocked by the second account of the second auctioneer is penalized.
Those skilled in the art will appreciate that the unsuccessful execution of a payment transaction includes a variety of scenarios, such as insufficient commission for the payment transaction, the amount of the payment transaction differing from the determined maximum bid, and so forth.
It will be appreciated by those skilled in the art that the operational steps in the event of receipt of a payment transaction generated by a terminal of a non-second bidder may also be configured according to actual requirements, for example to penalize a deposit frozen by the account of the non-second bidder.
Preferably, the first auction initiation transaction includes a bid time interval for the auctioned first item.
The auction principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, recording the bid time interval for the first item onto the block chain comprises:
and determining the bidding time interval of the first commodity according to a pre-configured bidding time interval selection rule, and recording the bidding time interval to the block chain.
The auction principle of the above embodiment can refer to the method shown in fig. 1, and is not described herein again.
Preferably, the bidding time interval includes a first bidding time interval and a second bidding time interval, the first bidding time interval is [ t1, t2 ], the second bidding time interval is [ t2, t3], t1 is the start time of the bidding time interval, t3 is the end time of the bidding time interval, and t2 is the first time; determining an auction time interval for the first item according to a preconfigured auction time interval selection rule comprises:
calculating a first value according to a first formula; wherein the first formula is: m is a 60 1000, m is a first value, a is the difference between t3 and t 2;
calculating a first duration according to a second formula; wherein the second formula is: c is blockhash (x) mod m, c is a first duration, blockhash (x) is the block hash of the next block after the bidding time interval is ended, and the unit of c is millisecond;
and determining an auction time interval of the first commodity according to the ending time and the first time length of the bidding time interval.
Specifically, assume t2 is 2021-04-0910: 00: 00;
calculating m by the block chain node, wherein m is 24 by 60 by 1000;
the next block after the end of the bidding time interval is a block (13516677); the blockhash (13516677) is 0x841513792c67ff61a8eda03f220abf2fc33364853cb68fdfacf149f6e758b77f, and byte conversion is carried out on the blockhash, and the converted value is 3492603307840844083; block chain node calculation c, c 3492603307840844083mod (24 × 60 × 1000), c 26444083, i.e., 7 hours, 20 minutes, 44 seconds, 83 milliseconds;
the blockchain node determines an auction time interval for the item S based on the end time 2021-04-1010:00:00, 7 hours, 20 minutes, 44 seconds, 83 milliseconds of the bid time interval: 2021-04-1002: 39: 15.917-2021-04-1010: 00: 00.
In this embodiment, the bidding time interval includes a first bidding time interval (a safe bidding period) in which each bidder mutually explores the psychological bid of the other party, and a second bidding time interval (a random bidding period) in which each bidder generally gives its own highest psychological bid.
Preferably, the first auction initiating transaction may also be configured according to actual requirements, for example, configured to further include an auction starting price, an auction incremental price, and the like, and the same technical effects can be achieved.
Fig. 2 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
As shown in fig. 2, as another aspect, the present application also provides a computer apparatus including one or more Central Processing Units (CPUs) 201 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)202 or a program loaded from a storage section 208 into a Random Access Memory (RAM) 203. In the RAM203, various programs and data necessary for the operation of the computer apparatus are also stored. The CPU201, ROM202, and RAM203 are connected to each other via a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.
The following components are connected to the I/O interface 205: an input portion 206 including a keyboard, a mouse, and the like; an output section 207 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 208 including a hard disk and the like; and a communication section 209 including a network interface card such as a LAN card, a modem, or the like. The communication section 209 performs communication processing via a network such as the internet. A drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 210 as necessary, so that a computer program read out therefrom is mounted into the storage section 208 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 209 and/or installed from the removable medium 211.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a computer-readable storage medium that exists separately and is not assembled into a computer device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (7)
1. An auction method applicable to a blockchain node, the method comprising:
receiving a first auction-initiated transaction for a first item generated by a first terminal of a first merchant;
recording a bid time interval for the first item onto a blockchain upon successful execution of the first auction-initiating transaction;
receiving a first auction transaction for auctioning the first commodity generated by a second terminal of a first auctioneer; wherein the first auction transaction comprises the first auction;
recording the first auction on a blockchain when the first auction transaction is successfully executed;
determining an auction time interval of the first commodity according to a pre-configured auction time interval selection rule; wherein the auction time interval is contained within the bid time interval;
searching the highest auction price of the first commodity from the auction time interval, and determining a second auctioneer with the highest auction price as an auctioneer for obtaining the first commodity;
and within the first payment block height interval, if the payment transaction of the first commodity generated by the third terminal of the second auction player is received and successfully executed, ending the auction.
2. The method of claim 1, wherein recording the first bid on a blockchain comprises:
freezing a plurality of certificates of a first account of the first auction player, and recording the first auction price on a block chain;
after the determining the second bidder at the highest bid as the bidder for the first commodity, the method further includes:
unfreezing the deposit frozen by the account of the other auction participants of the second auction participant not auction the first commodity;
the method further comprises the following steps:
penalizing a deposit blocked by a second account of the second auctioneer if the payment transaction is not received or if the payment transaction is not successfully executed.
3. The method of claim 1, wherein the first auction initiation transaction comprises a bid time interval for a first item being auctioned.
4. The method of claim 1, wherein recording the bid time interval for the first commodity on a block chain comprises:
and determining the bidding time interval of the first commodity according to a pre-configured bidding time interval selection rule, and recording the bidding time interval to a block chain.
5. The method of claims 1-4, wherein the bidding time interval comprises a first bidding time interval and a second bidding time interval, the first bidding time interval being [ t1, t2 ], the second bidding time interval being [ t2, t3], t1 being a start time of the bidding time interval, t3 being an end time of the bidding time interval, and t2 being a first time; the determining an auction time interval for the first commodity according to a preconfigured auction time interval selection rule comprises:
calculating a first value according to a first formula; wherein the first formula is: m is a 60 1000, m is the first value, a is the difference between t3 and t 2;
calculating a first duration according to a second formula; wherein the second formula is: c is blockhash (x) mod m, c is the first duration, blockhash (x) is the block hash of the next block after the bidding time interval is ended, and the unit of c is millisecond;
and determining the auction time interval of the first commodity according to the ending time of the bidding time interval and the first time length.
6. A computer device, the device comprising:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited in any of claims 1-5.
7. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488594.5A CN113191861B (en) | 2021-05-06 | 2021-05-06 | Auction method, computer device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110488594.5A CN113191861B (en) | 2021-05-06 | 2021-05-06 | Auction method, computer device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113191861A true CN113191861A (en) | 2021-07-30 |
| CN113191861B CN113191861B (en) | 2023-04-14 |
Family
ID=76983532
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110488594.5A Active CN113191861B (en) | 2021-05-06 | 2021-05-06 | Auction method, computer device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113191861B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116579286A (en) * | 2023-05-29 | 2023-08-11 | 深圳亿方联创科技有限公司 | Incremental layout method based on auction algorithm |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005076180A1 (en) * | 2004-02-03 | 2005-08-18 | Tae Wan Kim | Method and system of auction make use real-time auction information situation |
| KR20170037765A (en) * | 2015-09-25 | 2017-04-05 | 주식회사 에코마케팅 | System and method for bidding automatically based on situation of competition in keyword advertisement, and bidding management server |
| CN107679976A (en) * | 2017-09-28 | 2018-02-09 | 电子科技大学 | A kind of auction system based on block chain |
| CN109118343A (en) * | 2018-07-26 | 2019-01-01 | 上海交通大学 | The auction system and system and medium of fixed quantity subject matter based on block chain |
| US20190392511A1 (en) * | 2018-06-21 | 2019-12-26 | Rare Bits, Inc. | Bid matching for blockchain-based goods/assets systems and methods |
| CN111522826A (en) * | 2020-04-10 | 2020-08-11 | 上海黄金交易所 | Bidding transaction processing method and system based on block chain and related nodes |
| CN111553746A (en) * | 2020-05-08 | 2020-08-18 | 北京深演智能科技股份有限公司 | Bidding flow processing method and device |
| CN111583002A (en) * | 2020-04-30 | 2020-08-25 | 财付通支付科技有限公司 | Data processing method, data processing device, electronic equipment and storage medium |
-
2021
- 2021-05-06 CN CN202110488594.5A patent/CN113191861B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005076180A1 (en) * | 2004-02-03 | 2005-08-18 | Tae Wan Kim | Method and system of auction make use real-time auction information situation |
| KR20170037765A (en) * | 2015-09-25 | 2017-04-05 | 주식회사 에코마케팅 | System and method for bidding automatically based on situation of competition in keyword advertisement, and bidding management server |
| CN107679976A (en) * | 2017-09-28 | 2018-02-09 | 电子科技大学 | A kind of auction system based on block chain |
| US20190392511A1 (en) * | 2018-06-21 | 2019-12-26 | Rare Bits, Inc. | Bid matching for blockchain-based goods/assets systems and methods |
| CN109118343A (en) * | 2018-07-26 | 2019-01-01 | 上海交通大学 | The auction system and system and medium of fixed quantity subject matter based on block chain |
| CN111522826A (en) * | 2020-04-10 | 2020-08-11 | 上海黄金交易所 | Bidding transaction processing method and system based on block chain and related nodes |
| CN111583002A (en) * | 2020-04-30 | 2020-08-25 | 财付通支付科技有限公司 | Data processing method, data processing device, electronic equipment and storage medium |
| CN111553746A (en) * | 2020-05-08 | 2020-08-18 | 北京深演智能科技股份有限公司 | Bidding flow processing method and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116579286A (en) * | 2023-05-29 | 2023-08-11 | 深圳亿方联创科技有限公司 | Incremental layout method based on auction algorithm |
| CN116579286B (en) * | 2023-05-29 | 2024-04-30 | 深圳亿方联创科技有限公司 | Incremental layout method based on auction algorithm |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113191861B (en) | 2023-04-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10592977B2 (en) | Dynamically updating bidding parameters for online auctions | |
| CN109087082B (en) | Financial transaction execution method and device based on block chain and electronic equipment | |
| US20140324611A1 (en) | Real-time product delivery during customer-driven point of sale retail transactions | |
| CN113191861B (en) | Auction method, computer device and storage medium | |
| CN107493514B (en) | Live broadcast room data processing method and device and computer storage medium | |
| CN112465609A (en) | Initiating method and device for group-piecing order and electronic equipment | |
| CN111612453A (en) | Decentralized transaction method and device based on block chain and electronic equipment | |
| US11438401B2 (en) | Service processing method and device | |
| CN105096122A (en) | Fragmented transaction matching method and fragmented transaction matching device | |
| CN115641180A (en) | Request processing method, related device and equipment | |
| CN113516460A (en) | Prepaid order processing method, client, server and system | |
| WO2003027806A3 (en) | Hybrid auctions and methods and systems for conducting same over a computer network | |
| CN110096352A (en) | Process management method, device and computer readable storage medium | |
| US20180165685A1 (en) | Method, Terminal, and Related Server for Providing Transaction Object | |
| CN115147194A (en) | On-line live broadcast auction method, device and storage medium | |
| CN110443674B (en) | Order data pulling method and device, storage medium and computer equipment | |
| CN114331425A (en) | Block chain based digital asset calling method, system, electronic device and readable storage medium | |
| CN112200675B (en) | Block chain-based transaction method, seller node system, equipment and medium | |
| CN111985954A (en) | Service information processing method, device, storage medium and computer equipment | |
| TWI785303B (en) | Bidding platform management method and system | |
| WO2024098820A1 (en) | Order processing method and apparatus, and electronic device and storage medium | |
| CN112910757B (en) | Picture interaction method and equipment | |
| US20140297444A1 (en) | Lot bidding optimization and communication | |
| CN114997971A (en) | Auction processing method and system, electronic device and storage medium | |
| CN115170104A (en) | Donation processing method and system based on block chain |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |