Network bidding method based on depreciation auction

Abstract

The invention discloses a deduction auction-based network bidding method, which comprises the following steps of: 1, initializing an auction rule, and generating a reference time axis; step 2, accessing a user, and carrying out synchronous clock calibration; step 3, when the high-precision timer reaches a preset interval time, starting to execute periodic price reduction until a user bids or an auction state is ended; 4, when a user bidding event is monitored, processing a user bidding request; 5, verifying the atomization state, adding an exclusive lock to the auction instance, and generating a transaction snapshot; 6, feeding back and pushing an auction transaction result; and 7, auction is terminated. According to the method, millisecond-level periodic price reduction is realized based on a high-precision timer and a time slot mechanism, a dynamic update packet is pushed in combination with MQTT, price synchronization zero delay is ensured, and real-time accurate price reduction is realized; and through an exclusive lock, an idempotent token and a fund freezing mechanism, over-selling and repeated transaction risks are thoroughly avoided.

Description

Technical Field

[0001] This invention relates to the field of auction technology, and more specifically to an online bidding method based on descending price auctions. Background Technology

[0002] Current online price-drop auction systems have several applications and can effectively supplement auction methods to improve auction success rates. However, existing online price-drop auctions suffer from insufficient real-time performance; traditional polling mechanisms cause delays in price updates, making it difficult for users to accurately identify price drop points.

[0003] In high-concurrency scenarios, when multiple users bid simultaneously, the system is prone to overselling or inconsistent states (such as duplicate transactions); service interruptions may lead to the loss of auction data, making it impossible to recover to the state before the interruption; and the process for handling failed auctions is cumbersome. Existing methods rely on basic scheduled tasks and database transactions, which are insufficient to support the high real-time and high-concurrency bidding requirements. There is an urgent need for a solution that balances reliability, real-time performance, and user experience. Summary of the Invention

[0004] Therefore, the present invention provides a network bidding method based on descending price auction to solve the problems in the prior art.

[0005] To achieve the above objectives, the present invention provides the following technical solution:

[0006] A method for online bidding based on descending price auctions includes the following steps:

[0007] Step 1: Initialize the auction rules and generate the baseline timeline;

[0008] Step 2: User access and clock synchronization calibration;

[0009] Step 3: When the high-precision timer reaches the preset interval, start periodic price reduction until a user bids or the price cannot be reduced;

[0010] Step 4: When a user bid event is detected, process the user bid request;

[0011] Step 5: Verify the atomic state, add an exclusive lock to the auction instance, and generate a transaction snapshot;

[0012] Step 6: Send out feedback on the auction results;

[0013] Step 7: Auction terminated.

[0014] Furthermore, the specific implementation of step 1 is as follows: the administrator inputs the basic auction parameters through the backend interface, the auction system automatically verifies the legality of the parameters, generates a unique auction ID and a benchmark timeline, and stores them in the database; and outputs the creation of an auction instance object and the initialization of the memory state machine; the basic parameters include: starting price, reserve price, price reduction strategy type, price reduction interval period, and maximum duration.

[0015] Furthermore: In step 2, when a user accesses the auction page, an MQTT long connection is established; the auction system pushes a complete status packet to the user for the first time; the complete status packet includes: the current price, the countdown to the next price drop, the historical price sequence, and the auction status indicator; the auction system's page displays dynamic price figures, a countdown progress bar, and status indicator lights.

[0016] Furthermore: the periodic price reduction in step 3 requires determining whether the time slot event has arrived; if it is determined that the current time slot has not yet arrived, then wait for the next time slot; if it is determined that the current time slot has arrived, then start calculating the new price.

[0017] Furthermore: when calculating the new price, if the new price is less than or equal to the reserve price, then the price reduction will stop;

[0018] Simultaneously, the current price of the memory state machine is modified, and the price change log is recorded; an update package is pushed to all online users, which includes: the new price, the remaining time before the next price reduction, the expected price for the next period, and the cumulative price reduction.

[0019] Furthermore: In step 4, when the auction system receives a user's "bid now" request, it attaches a unique idempotent token; at this time, it is necessary to check the auction status; at the same time verify whether the user's account balance is sufficient; and verify the uniqueness of the token.

[0020] Furthermore, the specific details of verifying the atomized state are as follows:

[0021] (1) Secondary verification of auction validity;

[0022] (2) Freeze user funds and generate temporary orders;

[0023] (3) Mark the auction as "sold" and record the timestamp of the transaction;

[0024] (4) Release the lock pre-synchronization state to the database.

[0025] Furthermore, the specific content of the feedback push is as follows: for users who complete a transaction, a pop-up window, sound effect, and vibration notification will be provided, and they will be redirected to the payment page; for other users, a transaction announcement will be broadcast, and the status indicator light will be updated to red.

[0026] Furthermore: the conditions for terminating the auction are as follows:

[0027] When the timer runs out naturally, the auction is considered unsuccessful and the status changes to "Ended - Unsuccessful". After the auction fails, a notification is sent to the followers, providing an entry point for relisting.

[0028] When a valid bid is received, the price reduction is immediately terminated, and the status changes to "Completed - Transaction Completed". After the transaction is completed, an electronic contract is generated, a payment callback is triggered, and excess frozen funds are unfrozen. The complete auction log is then transferred to the historical database, temporary resources are cleared, and data is archived.

[0029] Furthermore: the auction system is equipped with fault tolerance and recovery measures;

[0030] Each time the price drops, a state snapshot is forcibly written to Redis, so when the service crashes, recovers, and restarts, the latest state is restored from Redis and the timer is resumed;

[0031] The bidding interface requires the client to include an If-Match header, and the server will reject duplicate requests if the comparison is inconsistent.

[0032] This invention has the following advantages: It achieves millisecond-level periodic price reduction based on a high-precision timer and time slot mechanism, combined with MQTT push dynamic update packets to ensure zero-latency price synchronization and achieve real-time and accurate price reduction; atomic transactions ensure security, and completely avoid the risks of overselling and duplicate transactions through exclusive locks, idempotent tokens, and fund freezing mechanisms; it adopts multimodal feedback (pop-up window + sound effect + vibration), visualized price curves, and intelligent auction failure processing to improve user engagement and system efficiency.

[0033] Other features and advantages of the invention will be set forth in the description which follows, and will be apparent in part from the description, or may be learned by practicing the invention. Attached Figure Description

[0034] To more intuitively illustrate the prior art and this application, exemplary drawings are provided below. It should be understood that the specific shapes and structures shown in the drawings should not generally be regarded as limiting conditions for implementing this application; for example, based on the technical concept disclosed in this application and the exemplary drawings, those skilled in the art are able to easily make conventional adjustments or further optimizations to the addition / reduction / classification, specific shapes, positional relationships, connection methods, size ratios, etc. of certain units (components).

[0035] Figure 1 This is a flowchart illustrating the implementation of a network bidding method based on descending price auction according to this application. Detailed Implementation

[0036] The following specific embodiments illustrate the implementation of the present invention. Those skilled in the art can easily understand other advantages and effects of the present invention from the content disclosed in this specification. Obviously, the described embodiments are only some embodiments of the present invention, not all embodiments. It should be understood that these embodiments are merely for further explanation of the present invention and should not be construed as limiting the scope of protection of the present invention. Technical engineers in the field can make some non-essential improvements and adjustments to the present invention based on the above-described content. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0037] Please see Figure 1 A network bidding method based on descending price auction includes the following steps:

[0038] Step 1: Initialize the auction rules and generate the baseline timeline;

[0039] Administrators input basic auction parameters through the backend interface. The auction system automatically verifies the validity of the parameters (e.g., starting price > reserve price, price reduction is not negative), generates a unique auction ID and a benchmark timeline, and stores them in the database.

[0040] Basic parameters include: starting price, reserve price, price reduction strategy type, price reduction interval, and maximum duration.

[0041] It also outputs the creation of an auction instance object and the initialization of the memory state machine, namely: current price = starting price, remaining time = total duration, and state = in progress.

[0042] Step 2: User access and initial synchronization clock calibration;

[0043] When a user visits the auction page, an MQTT long connection is established and the user subscribes to the auction channel; the auction system then pushes a complete status packet to the user for the first time.

[0044] The complete status package includes: current price, countdown to the next price drop, historical price sequence, and auction status indicator.

[0045] The auction system's page displays dynamic price figures (large font + color gradient), a countdown progress bar, and status indicator lights (green = in progress).

[0046] Step 3: When the high-precision timer reaches the preset interval, start the periodic price reduction until a user bids or the price cannot be reduced.

[0047] If it is determined that the current time slot has not yet been reached, then wait for the next time slot; if it is determined that the current time slot has been reached, then start calculating the new price.

[0048] When calculating the new price, the next stage price is calculated based on the configuration strategy, which is the current price minus a fixed value / percentage. If the new price is less than or equal to the reserve price, the price reduction will stop.

[0049] Simultaneously, the current price of the memory state machine is modified, and the price change log is recorded for state updates.

[0050] The update package is pushed to all online users via the MQTT IoT protocol. The update package includes: the new price, the remaining time before the next price reduction, the expected price in the next period, and the cumulative price reduction.

[0051] In addition, the system's front-end page displays a scrolling animation of price numbers with color changes, a refreshed countdown progress bar, and a new price node in the right-hand mini-chart.

[0052] Step 4: When a user bid event is detected, process the user bid request;

[0053] Receive user requests to click "bid now" with a unique idempotent token (to prevent duplicate submissions).

[0054] At this point, it is necessary to check the auction status (not ended / not failed to sell); at the same time verify that the user's account balance is greater than or equal to the current price plus the service fee; and verify the uniqueness of the token (by recording the processed tokens in the Redis cache).

[0055] Step 5: Verify the atomization state

[0056] It then performs atomic operations, namely, acquiring an exclusive lock on the auction instance and generating a transaction snapshot; the specific execution steps are as follows:

[0057] (1) Secondary verification of auction validity;

[0058] (2) Freeze user funds and generate temporary orders;

[0059] (3) Mark the auction as "sold" and record the timestamp of the transaction;

[0060] (4) Release the lock pre-synchronization state to the database.

[0061] For example:

[0062] Scenario 1: Normal bidding process

[0063] When user A sees the current price of 100 yuan, generate V_client (the version number generated by the client, which can be UUID + timestamp) = V1 and send a request;

[0064] Server-side checks: S_status = 0, Bid_amount (bid amount) = 120 ≥ 100, V1 == V_server (latest version number stored on the server); S_status represents the auction status switch, 0 indicates in progress, 1 indicates completed.

[0065] After acquiring the distributed lock, update the price to 120 and mark the auction as over; return a success response and broadcast a transaction notification.

[0066] Scenario 2: Protection against duplicate submissions;

[0067] User B clicked the bid button twice due to network latency; the first request was successfully submitted using V_client=V2; the second request still carried V_client=V2, but the server had updated V_server=V3; a version inconsistency error was triggered, and the second request was rejected directly.

[0068] Scenario 3: Interception after the auction ends;

[0069] The auction was already completed in the previous step by user C for 150 yuan; when user D tried to bid 160 yuan, the verification failed due to S_status=1; the auction immediately returned the error "auction has ended".

[0070] Step 6: Real-time results push;

[0071] The auction results will be pushed to the winning bidder. The winning bidder will receive a pop-up message with sound effects and vibration indicating "Congratulations on winning the bid of ￥X" and will be redirected to the payment page. Other bidders will receive a broadcast announcement of the winning bid (the winning bid price and the buyer's nickname) and their status indicator will be updated to red (the auction has ended).

[0072] Step 7: Auction Termination Determination

[0073] Normal termination conditions: When the timer runs out naturally, the auction is considered a failed auction and the status changes to "Ended - Failed Auction"; when a valid bid is received, the price reduction is immediately terminated and the status changes to "Ended - Sold".

[0074] After an item fails to sell at auction, a push notification (including the reason for the failure) will be sent to those who are interested, providing an entry point for the item to be relisted.

[0075] After the transaction is completed, an electronic contract is generated, triggering a payment callback and unfreezing excess funds.

[0076] The complete auction log (price curve, operation record) is then transferred to the historical database, temporary resources (Redis / ZooKeeper) are cleaned up, and the data is archived.

[0077] In addition, to prevent server crashes and network fluctuations from affecting the auction, this invention also includes fault tolerance and recovery measures.

[0078] Each time the price drops, a state snapshot is forcibly written to Redis (with TTL), so when the service crashes, recovers, and restarts, the latest state is restored from Redis and the timer is resumed.

[0079] The network jitter protection measures are as follows: the bidding interface requires the client to carry the If-Match header (the version number seen last time), and the server rejects duplicate requests if the comparison is inconsistent.

[0080] Degradation strategy: When MQTT push fails, switch to polling mode (pull the latest status every 2 seconds), and enable rate limiting and circuit breaking in high-concurrency scenarios.

[0081] Furthermore, the price-reducing auction method in this embodiment can also enhance visualization and user notifications.

[0082] The main interface can display LED-style price numbers in the center, with a zoom animation accompanying the refresh every second, and a floating label below displays "Price will drop to ¥XX in XX seconds until the next price reduction".

[0083] The price line chart is displayed in a floating window on the right side of the main interface, with nodes labeled with time and magnitude, and mouse hover is supported to view details.

[0084] The top status bar uses a traffic light style (green indicates in progress, yellow indicates imminent end, and red indicates completion), and vibration feedback is added on mobile devices.

[0085] After the auction ends, users who did not win a bid but were following the auction will be sent an in-app message / push notification informing them of the final result (sold price / unsold item).

[0086] In addition, the auction system has added emergency control measures. The administrator panel provides an emergency stop button, which can be used to manually pause / terminate abnormal auctions.

[0087] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A network bidding method based on descending price auction, characterized in that, Includes the following steps: Step 1: Initialize the auction rules and generate the baseline timeline; Step 2: User access and clock synchronization calibration; Step 3: When the high-precision timer reaches the preset interval, start periodic price reduction until a user bids or the price cannot be reduced; Step 4: When a user bid event is detected, process the user bid request; Step 5: Verify the atomic state, add an exclusive lock to the auction instance, and generate a transaction snapshot; Step 6: Send out feedback on the auction results; Step 7: Auction terminated.

2. The online bidding method based on descending price auction according to claim 1, characterized in that, The specific implementation method of step 1 is as follows: the administrator inputs the basic auction parameters through the backend interface, the auction system automatically verifies the legality of the parameters, generates a unique auction ID and a benchmark timeline, and stores them in the database; It also outputs the creation of the auction instance object and the initialization of the memory state machine; The basic parameters include: starting price, reserve price, price reduction strategy type, price reduction interval, and maximum duration.

3. The online bidding method based on descending price auction according to claim 1, characterized in that, In step 2, when a user visits the auction page, an MQTT long connection is established; the auction system pushes a complete status packet to the user for the first time; the complete status packet includes: the current price, the countdown to the next price drop, the historical price sequence, and the auction status indicator; the auction system's page displays dynamic price figures, a countdown progress bar, and status indicator lights.

4. The online bidding method based on descending price auction according to claim 1, characterized in that, The periodic price reduction in step 3 requires determining whether the time slot event has arrived; If it is determined that the current time slot has not yet been reached, then wait for the next time slot; if it is determined that the current time slot has been reached, then start calculating the new price.

5. The online bidding method based on descending price auction according to claim 4, characterized in that, When calculating the new price, if the new price is less than or equal to the reserve price, the price reduction will stop. Simultaneously, the current price of the memory state machine is modified, and the price change log is recorded; an update package is pushed to all online users, which includes: the new price, the remaining time before the next price reduction, the expected price for the next period, and the cumulative price reduction.

6. The online bidding method based on descending price auction according to claim 1, characterized in that, In step 4, when the auction system receives a user's "bid now" request, it attaches a unique idempotent token. At this time, it is necessary to check the auction status, verify whether the user's account balance is sufficient, and check the uniqueness of the token.

7. The online bidding method based on descending price auction according to claim 1, characterized in that, The specific details of verifying the atomized state are as follows: (1) Secondary verification of auction validity; (2) Freeze user funds and generate temporary orders; (3) Mark the auction as "sold" and record the timestamp of the transaction; (4) Release the lock pre-synchronization state to the database.

8. The online bidding method based on descending price auction according to claim 1, characterized in that, The specific content of the feedback push is as follows: for users who complete a transaction, a pop-up window, sound effect, and vibration notification will be provided, and they will be redirected to the payment page; for other users, a transaction announcement will be broadcast, and the status indicator light will be updated to red.

9. The online bidding method based on descending price auction according to claim 1, characterized in that, The conditions for terminating the auction are as follows: When the timer runs out naturally, the auction is considered unsuccessful and the status changes to "Ended - Unsuccessful". After the auction fails, a notification is sent to the followers, providing an entry point for relisting. When a valid bid is received, the price reduction will be terminated immediately, and the status will change to "Completed - Transaction Completed". After the transaction is completed, an electronic contract will be generated, triggering a payment callback and unfreezing excess frozen funds. The complete auction log will be transferred to the historical database, temporary resources will be cleaned up, and data will be archived.

10. A network bidding method based on descending price auction according to any one of claims 1-9, characterized in that, The auction system is equipped with fault tolerance and recovery measures. Each time the price drops, a state snapshot is forcibly written to Redis, so when the service crashes, recovers, and restarts, the latest state is restored from Redis and the timer is resumed; The bidding interface requires the client to include an If-Match header, and the server will reject duplicate requests if the comparison is inconsistent.

Images