Intelligent system and method for managing transport certificate allocation by means of algorithms

Abstract

An apparatus, a method, and a non-transitory computer readable medium for intelligently managing the distribution of transport certificates (COTs). In an embodiment, an application server is configured to execute an algorithm allocation application configured to manage allocation of available COTs based on a plurality of bid requests received from a bidder. The algorithm allocation application program not only can determine the bid winning person of online auction by determining the bidder with the highest bid, but also can intelligently determine whether all available COTs are within the request range, adjust the allocation of the available COTs for the request bidder according to the available condition of the COTs, and dynamically determine the price of the allocated COTs, thereby improving the efficiency of the algorithm allocation application program. The price may not always be the highest bid-winning bid, but may be adjusted according to the situation where an available COT is allocated to the requested bid.

Description

Technical Field

[0001] The present disclosure generally relates to railway operations, and more particularly to intelligent systems and methods for managing the allocation of transportation certificates with the aid of algorithms. Background Art

[0002] Managing asset allocation can be a very challenging task because a large number of different factors need to be considered when determining where, how, and to whom the assets are allocated. Although some management solutions have been developed, these solutions are not sufficient to meet all situations. For example, in the field of railway operations, managing asset allocation is particularly important because railways may rely on the allocation details to formulate train schedules, and customers may rely on the assets to transport goods.

[0003] Specifically, in railway operations, a Certificate of Transport (COT) is used to achieve a certain form of asset allocation. A COT can be used to represent a commodity. Generally, a COT may represent one or more commodity cars allocated by the railway to a customer (e.g., one or more grain cars). Depending on the commodity, exchange period, price, number of vehicles, etc., COTs are divided into seven different types. In a typical implementation, COTs can be sold to customers through an online auction, thereby providing a convenient and fair allocation method. Generally speaking, the type of COT determines how many cars the COT is worth. The available time of the COT may also be restricted (a specific month / year and a time period within the month, such as the beginning, middle, or end of the period).

[0004] However, online auctions, especially managing online auctions for allocating COTs, may pose at least two major challenges. The first challenge may include determining the winning quantity of COTs required for the auction bid. For example, each COT can be processed individually rather than in a group, and each bidder can only win the specific quantity of COTs requested, or each bidder can win less than the quantity of COTs required for the auction bid. The second challenge may include determining the amount each bidder pays for the COT. For example, it must be determined when to determine the price increase range, when to determine the bidding time, how to determine the priority order of the price increase range and the bidding time, and how to handle proxy bids.

[0005] Current systems for managing COT allocation through auctions may be too simple to handle the above challenges. Due to the lack of intelligence, current systems may allow bids and even determine the winning bidders, but when the available and / or requested quantity of COTs may be different and inconsistent, they cannot make intelligent decisions on COT allocation and / or cannot intelligently determine the pricing of COTs. Summary of the Invention

[0006] The present disclosure realizes technical advantages as a system, method, and computer-readable storage medium for providing intelligent management functions for the allocation of Certificate of Transportation (COT). The present disclosure provides a system integrated into practical applications with meaningful limitations, which can realize algorithmic management of the allocation of available COT through online auctions. In a specific embodiment, the system includes multiple user terminals, a network, and an application server serving as a COT processing system. Each of the multiple user terminals includes a display screen for presenting a graphical user interface and outputting information. The network can be configured to provide communication functions to other components of the system, such as between multiple user terminals and the application server. The application server serving as a COT processing system can execute an algorithmic allocation application, which is configured to manage the allocation of available COT based on multiple bid requests received from multiple bidders. The functions of the algorithmic allocation application can not only include determining the winning bidder of the online auction by identifying the bidder with the highest bid, but also include intelligently determining whether all available COTs are within the requested range, adjusting the allocation of available COTs to the requesting bidders according to the availability of COT, and dynamically determining the price of the allocated COT, which may not always be the highest winning bid price (e.g., in a typical auction system), but can be adjusted according to the situation of allocating available COTs to the requested bids. In this way, the technology disclosed herein is not merely about storing, organizing, and comparing data, but about solving network- and computer-centric challenges in COT allocation through online auctions when the available offer assets do not exactly match the requested assets. Therefore, the technology disclosed herein is not limited to simply implementing abstract ideas in a computer, but is an improvement to the current COT allocation management system and / or online auction system.

[0007] OT. In a specific embodiment, the system includes multiple user terminals, a network, and an application server serving as a COT processing system. Each of the multiple user terminals includes a display screen for presenting a graphical user interface and outputting information. The network can be configured to provide communication functions to other components of the system, such as between multiple user terminals and the application server. The application server serving as a COT processing system can execute an algorithmic allocation application, which is configured to manage the allocation of available COT based on multiple bid requests received from multiple bidders. The functions of the algorithmic allocation application can not only include determining the winning bidder of the online auction by identifying the bidder with the highest bid, but also include intelligently determining whether all available COTs are within the requested range, adjusting the allocation of available COTs to the requesting bidders according to the availability of COT, and dynamically determining the price of the allocated COT, which may not always be the highest winning bid price (e.g., in a typical auction system), but can be adjusted according to the situation of allocating available COTs to the requested bids. In this way, the technology disclosed herein is not merely about storing, organizing, and comparing data, but about solving network- and computer-centric challenges in COT allocation through online auctions when the available offer assets do not exactly match the requested assets. Therefore, the technology disclosed herein is not limited to simply implementing abstract ideas in a computer, but is an improvement to the current COT allocation management system and / or online auction system.

[0008] Therefore, the concept of the present disclosure is inseparable from computer and network technologies, and thus the present disclosure brings technical advantages, that is, providing a mechanism for intelligent management of COT allocation through online auctions. The present disclosure is not merely about implementing manual processes in a computer, but also provides a technology-based mechanism for managing all aspects of online auctions, including allocating available COTs to the requested COTs and dynamically adjusting prices according to the allocation. The present disclosure can solve the challenges currently faced by the COT allocation system (i.e., the current COT online auction system), such as by providing a mechanism to allocate available COTs to bid requests according to the quantity of available COTs, and dynamically adjusting the price of COT according to whether all requested COTs are allocated to winning bids, so as to determine how many available and / or winning COTs are requested for the online auction bids, and determine the amount that each bidder needs to pay for the winning COT.

[0009] The present disclosure addresses the technical problem of the lack of technical functionality to intelligently manage COT allocation through online auctions. The technical solution provided herein and missing in traditional systems is not merely the simple application of manual processes to a computerized environment, but also includes the functionality of implementing technical processes, thereby supplementing the currently implemented COT allocation system (especially the COT online auction system). Thus, the present disclosure goes far beyond the simple application of manual processes to a computer.

[0010] The objective of the present disclosure is to provide a system for intelligently managing COT allocation through online auctions. Another objective of the present disclosure is to provide a method for intelligently managing COT allocation through online auctions. Another objective of the present disclosure is to provide a computer-based tool for intelligently managing the allocation of COT through online auctions. The present disclosure provides the above and other objectives, including at least the following embodiments.

[0011] In a particular embodiment, a method for intelligently managing COT allocation through online auctions is provided. The method includes receiving multiple bid requests from multiple bidders, where each bid request requests the allocation of one or more of multiple available COTs. In an embodiment, one or more COTs each represent a subject commodity, and each bid in the multiple bid requests includes a minimum bid amount and a maximum bid amount respectively corresponding to one or more COTs. The method further includes executing an algorithm allocation application configured to manage the allocation of multiple available COTs based on the multiple bid requests. In an embodiment, executing the algorithm allocation application includes aggregating the multiple bid requests from multiple bidders into a bid request list respectively, and determining whether the total number of COTs requested in the multiple bid requests is more than the total number of COTs in the multiple available COTs. In an embodiment, executing the algorithm allocation application includes: when the total number of COTs requested in the multiple bid requests does not exceed the total number of COTs in the multiple available COTs, allocating the COTs in the multiple available COTs to each bidder among the multiple bidders based on the one or more COTs requested in the bid requests received from each bidder among the multiple bidders, and determining the price of each allocated COT based on the minimum bid amount in the bid request corresponding to the allocated COT. In an embodiment, executing the algorithm allocation application includes: when the total number of COTs requested in the multiple bid requests is greater than the total number of COTs in the multiple available COTs, sorting the bid request list based on the maximum bid amount of each bid request in the bid request list, and then sorting the bid request list based on the submission time of each bid request in the bid request list, such that the first bid request with the maximum bid amount equal to the maximum bid amount of the second bid request and the submission time earlier than the second bid request is sorted higher than the second bid request, so as to allocate the COTs in the multiple available COTs to each bid request in the bid request list based on the sorting order of each bid request, and determining the price of each COT allocated to each bid request in the bid request list, where determining the price includes: when all the COTs requested in the multiple bid requests have corresponding winning bids in the bid request list, determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the first non-winning bidder, and when all the COTs requested in the multiple bid requests do not have corresponding winning bids in the bid request list, determining the price of each COT allocated to each bid request in the bid request list according to the bid amount of the last winning bidder. In an embodiment, executing the algorithm allocation application includes allocating the COTs allocated in the bid request list to each bidder associated with each bid request in the bid request list of the allocated COTs.

[0012] In another embodiment, a computer-based tool is provided for intelligently managing COT allocations through an online auction. The computer-based tool may include a non-transitory computer-readable medium having computer code stored thereon, which when executed by a processor causes a computing device to perform operations. The operations include receiving multiple bid requests from multiple bidders, each of the bid requests respectively requesting the allocation of one or more of a plurality of available COTs. In an embodiment, one or more COTs each represent a subject commodity, and each bid in the multiple bid requests includes a minimum bid amount and a maximum bid amount respectively corresponding to one or more COTs. The operations further include executing an algorithm allocation application configured to manage the allocation of the plurality of available COTs based on the multiple bid requests. In an embodiment, executing the algorithm allocation application includes aggregating the multiple bid requests from the multiple bidders into a bid request list respectively, and determining whether the total number of COTs requested in the multiple bid requests is more than the total number of COTs in the plurality of available COTs. In an embodiment, executing the algorithm allocation application includes: when the total number of COTs requested in the multiple bid requests does not exceed the total number of COTs in the plurality of available COTs, allocating the COTs in the plurality of available COTs to each of the multiple bidders based on the one or more COTs requested in the bid requests received from each of the multiple bidders, and determining the price of each allocated COT based on the minimum bid amount in the bid request corresponding to the allocated COT. In an embodiment, executing the algorithm allocation application includes: when the total number of COTs requested in the multiple bid requests is greater than the total number of COTs in the plurality of available COTs, sorting the bid request list based on the maximum bid amount of each bid request in the bid request list, and then sorting the bid request list based on the submission time of each bid request in the bid request list, such that the first bid request with the maximum bid amount equal to that of the second bid request and the submission time earlier than that of the second bid request is sorted higher than the second bid request, so as to allocate the COTs in the plurality of available COTs to each bid request in the bid request list based on the sorting order of each bid request, determining the price of each COT allocated to each bid request in the bid request list, wherein determining the price includes: when there are corresponding winning bids for all COTs requested in the multiple bid requests in the bid request list, determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the first non-winning bidder, and when there are no corresponding winning bids for all COTs requested in the multiple bid requests in the bid request list, determining the price of each COT allocated to each bid request in the bid request list according to the bid amount of the last winning bidder. In an embodiment, executing the algorithm allocation application includes allocating the COTs allocated in the bid request list to each bidder associated with each bid request in the bid request list of the allocated COTs.

[0013] In another embodiment, a system for intelligently managing COT allocation through online auctions is provided. The system includes at least one processor, and a memory operably coupled to the at least one processor and storing processor-readable code, which is configured to perform operations when executed by the at least one processor. The operations include receiving a plurality of bid requests from a plurality of bidders, where each bid request requests the allocation of one or more of a plurality of available COTs. In an embodiment, one or more COTs each represent a subject commodity, and each bid in the plurality of bid requests includes a minimum bid amount and a maximum bid amount respectively corresponding to one or more COTs. The operations further include executing an algorithm allocation application configured to manage the allocation of the plurality of available COTs based on the plurality of bid requests. In an embodiment, executing the algorithm allocation application includes aggregating the plurality of bid requests from the plurality of bidders into a bid request list respectively, and determining whether the total number of COTs requested in the plurality of bid requests is more than the total number of COTs in the plurality of available COTs. In an embodiment, executing the algorithm allocation application includes: when the total number of COTs requested in the plurality of bid requests does not exceed the total number of COTs in the plurality of available COTs, allocating the COTs in the plurality of available COTs to each of the plurality of bidders based on the one or more COTs requested in the bid requests received from each of the plurality of bidders, and determining the price of each allocated COT based on the minimum bid amount in the bid request corresponding to the allocated COT. In an embodiment, executing the algorithm allocation application includes: when the total number of COTs requested in the plurality of bid requests is greater than the total number of COTs in the plurality of available COTs, sorting the bid request list based on the maximum bid amount of each bid request in the bid request list, and then sorting the bid request list based on the submission time of each bid request in the bid request list, such that the first bid request with a maximum bid amount equal to that of the second bid request and a submission time earlier than that of the second bid request is ranked higher than the second bid request, so as to allocate the COTs in the plurality of available COTs to each bid request in the bid request list based on the sorting order of each bid request, and determining the price of each COT allocated to each bid request in the bid request list, where determining the price includes: when all the COTs requested in the plurality of bid requests have corresponding winning bids in the bid request list, determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the first non-winning bidder, and when all the COTs requested in the plurality of bid requests do not have corresponding winning bids in the bid request list, determining the price of each COT allocated to each bid request in the bid request list according to the bid amount of the last winning bidder.In an embodiment, performing the algorithm to allocate application programs includes allocating the COTs allocated in the bid request list to each bidder associated with each bid request in the bid request list with the allocated COTs.

[0014] The features and technical advantages of the present disclosure have been outlined above rather extensively so as to enable a better understanding of the detailed description of the present disclosure hereinafter. Additional features and advantages of the present disclosure will be described hereinafter, which form the subject matter of the claims of the present disclosure. Those skilled in the art should understand that the concepts and specific embodiments disclosed herein can be readily used as a basis for modifying or designing other structures to achieve the same purposes of the present disclosure. Those skilled in the art should also recognize that such equivalent structures do not depart from the spirit and scope of the present disclosure as set forth in the appended claims. The novel features regarding its organization and method of operation, as well as further purposes and advantages, which are regarded as features of the present disclosure, can be better understood from the following description in conjunction with the accompanying drawings. It should be clearly understood, however, that each drawing is for the purpose of illustration and description only and is not intended to delimit the scope of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] To more fully understand the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like components:

[0016] Figure 1A The high-level block diagram is a representative system for intelligently managing the allocation of Certificate of Transportation (COT) through online auctions according to an embodiment of the present disclosure;

[0017] Figure 1B The block diagram shows the functions of an exemplary algorithm allocation application 120 implemented according to an embodiment of the present disclosure;

[0018] Figure 2A The block diagram shows an exemplary operation of a system having the function of intelligently managing COT allocation through online auctions implemented according to an embodiment of the present disclosure;

[0019] Figure 2B The block diagram shows an exemplary operation of a system having the function of intelligently managing COT allocation through online auctions implemented according to an embodiment of the present disclosure;

[0020] Figure 3 The flowchart is a representative method 300 for intelligently managing COT allocation through online auctions implemented according to an embodiment of the present disclosure; and

[0021] Figure 4An exemplary high - level functional block diagram is shown, which shows a representative computer network operating environment for intelligently managing COT allocation implemented according to an embodiment of the present disclosure.

[0022] It should be understood that the drawings are not necessarily drawn to scale, and the disclosed embodiments are sometimes shown in diagrammatic and partial view forms. In some cases, details unnecessary for understanding the disclosed methods and apparatuses or details that make other details difficult to understand may be omitted. Of course, it should be understood that the present disclosure is not limited to the specific embodiments shown herein. Detailed Description

[0023] The disclosure presented in the following written description and its various features and advantageous details will be more fully explained with reference to the non - restrictive examples included in the drawings and the content detailed in the specification. Descriptions of well - known components are omitted herein so as not to unnecessarily obscure the main features described herein. The following examples are intended to facilitate an understanding of how the present disclosure is implemented and practiced. Those of ordinary skill in the art will understand the present disclosure to mean that any suitable combination of the following functions or exemplary embodiments can be combined to implement the claimed subject matter. The present disclosure includes a representative number of species within the genus or structural features common to the members of the genus so that those of ordinary skill in the art can identify the members of the genus. Therefore, these examples should not be construed as limiting the scope of the claims.

[0024] Those of ordinary skill in the art will understand that any system claim presented herein encompasses all of the elements and limitations disclosed therein, and thus each system claim is to be considered as a whole. Any reasonably foreseeable item having a functional relationship with the claim also falls within the relevant scope. After thoroughly understanding the disclosure and claims in the presented application, the examiner searched for prior art disclosed in patents and other published documents (i.e., non - patent literature). Thus, as evidenced by the issuance of this patent, the prior art failed to disclose or teach the elements and limitations set forth in the claims supported by the specification and drawings, and thus the claimed subject matter is patentable under the applicable laws and rules of this jurisdiction.

[0025] Various embodiments of the present disclosure are directed to systems and techniques that can provide functionality for intelligently managing the allocation of Certificate of Transportation (COT). The present disclosure provides a system integrated into a practical application and having meaningful limitations, and can implement available C through online auctions.

[0026] Algorithm management for OT allocation. In certain embodiments, an application server may execute an algorithm to allocate applications. The algorithm for allocating applications is configured to manage the allocation of available COTs based on multiple bid requests received from multiple bidders. The functions of the algorithm for allocating applications may not only include determining the winning bidder in an online auction by identifying the bidder with the highest bid, but may also include intelligently determining whether all available COTs are within the requested range, adjusting the allocation of available COTs to the requesting bidders according to the availability of COTs, and dynamically determining the price of the allocated COTs, which may not always be the highest winning bid price (e.g., in a typical online auction system), but may be adjusted according to the allocation of available COTs to the requested bids.

[0027] FIGS. 1 to Figure 4 The various embodiments discussed below in FIGS. 1 to and the various embodiments used in this patent document to describe the principles of the present disclosure are for illustrative purposes only and should not be construed in any way as limiting the scope of the present disclosure. Those skilled in the art will appreciate that the principles of the present disclosure may be implemented in any type of suitably arranged device or system.

[0028] Figure 1A FIG. 100 illustrates an example system 100 for intelligently managing COT allocation through an online auction implemented in accordance with an embodiment of the present disclosure. The embodiments of system 100 are for illustrative purposes only and should not be construed as limiting in any way or form. Figure 1A The scope of the present disclosure is not limited to any particular implementation of the COT allocation management system.

[0029] As Figure 1A shown, system 100 includes a platform 105, a user web server 110, and a communication network 115. Platform 105 may include an algorithm allocation application 120, a database 160, a web server 165, and a firewall 167. In an embodiment, the functions of platform 105 may be implemented by the various components of application platform 105 operating in cooperation as described herein. In some embodiments, platform 105 may be provided to include multiple WAR files (modules) that can be deployed to a container (e.g., implemented as a Tomcat container). For example, platform 105 may include an algorithm allocation application 120, which may include one or more containers.

[0030] The algorithm allocation application 120 may include a customer container 130 and a client container 135. The customer container 130 may include a customer user interface (UI) module 140. In an embodiment, the customer container 130 may be configured to enable a user to access the functions of the algorithm allocation application 120 to allocate COTs, such as providing functions to generate, construct, render, and present a UI (e.g., via the UI module 140) to a user (e.g., a customer who wishes to bid on one or more auction lists of one or more available COTs).

[0031] The client container 135 may include a winning bidder determination manager 145 and a data service module 150. In an embodiment, the client container 135 may be configured to enable an administrative user to access the functions of the algorithm allocation application 120 to allocate COTs, such as providing functions to generate, construct, render, and present a UI (e.g., via the UI module 140) to the administrative user to manage various aspects of the algorithm allocation application 120 (e.g., creating, editing, managing, etc., auctions of available COTs).

[0032] In an embodiment, the winning bidder determination manager 145 may include and / or may be configured to execute or apply algorithms, machine learning models, mathematical models, rule models, and / or other models that can be used to intelligently determine whether all available COTs are within the request scope, intelligently adjust the allocation of available COTs to the requesting bidders based on the availability of COTs, and intelligently and dynamically determine the price of the allocated COTs, which may not always be the highest winning bid price (e.g., in a typical online auction system), but can be adjusted according to the allocation of available COTs to the requested bids.

[0033] In an embodiment, the winning bidder determination manager 145 may be implemented in a web service application. The results of the winning bidder determination manager 145 may be used to configure and / or manage the allocation of available COTs. In some embodiments, the results of the winning bidder determination manager 145 may be stored in a data service application (e.g., the data service module 150), which may include a database (e.g., database 160), such as a middle-tier DB2 database.

[0034] In an embodiment, the functions of the algorithm allocation application 120 may be implemented through the cooperative operation of the various components of the algorithm allocation application 120, as described in detail below. As Figure 1AAs shown, the algorithm allocation application 120 may be implemented in a server. Although the algorithm allocation application 120 is shown as a component, it can be understood that the server 110 and its various functional blocks may be implemented as a single device, or may be distributed among multiple devices with their own processing resources, and its overall function may be configured to perform operations in accordance with the present disclosure. In addition, those skilled in the art will recognize that although Figure 1A the components of the algorithm allocation application 120 are shown as single and independent blocks, each of the various components of the algorithm allocation application 120 may be a single component (e.g., a single application, a server module, etc.), may be a functional component of the same component, or the function may be distributed across multiple devices / components. In such an embodiment, the function of each corresponding component may be aggregated from the functions of multiple modules located in a single or multiple devices. In addition, the specific functions described for a particular component of the algorithm allocation application 120 may actually be part of different components of the algorithm allocation application 120. Therefore, the description of the specific functions for a particular component of the algorithm allocation application 120 is for illustrative purposes only and is not limiting in any way. In some specific embodiments, the algorithm allocation application 120 may include a Linux-based server with a processor. In some embodiments, two matching application servers 120 may be used in a production environment, configured to perform load balancing for all requests (e.g., bid requests). In some embodiments, each algorithm allocation application 120 may include one or more containers 130 and 135, namely, a customer container 130 for the customer UI and a client container 135 for other applications (including the winning bidder determination manager 145).

[0035] In an embodiment, the algorithm allocation application 120 may be implemented using a processor. The processor of the algorithm allocation application 120 may include a processor, a microprocessor, a controller, a microcontroller, multiple microprocessors, an application specific integrated circuit (ASIC), an application specific standard product (ASSP), or any combination thereof, and may be configured to execute instructions to perform operations in accordance with the content disclosed herein. In some embodiments, the processor implementation of the algorithm allocation application 120 may include code segments (e.g., software, firmware, and / or hardware logic) executable in hardware (e.g., a processor) to perform the tasks and functions described herein. In other embodiments, the processor of the algorithm allocation application 120 may be implemented as a combination of hardware and software.

[0036] In an embodiment, the network 115 may include a wired network, a wireless communication network, a cellular network, a cable transmission system, a local area network (LAN), a wireless local area network (WLAN), a metropolitan area network (MAN), a wide area network (WAN), the Internet, a public switched telephone network (PSTN), etc.

[0037] Figure 1B The block diagram shows the functions of the exemplary algorithm allocation application program 120 implemented according to an embodiment of the present disclosure. In an embodiment, the implementation of the algorithm allocation application program 120 can be achieved by the cooperative operation of various functional components of the algorithm allocation application program 120, as described in detail below. For example, in an embodiment, the algorithm allocation application program 120 can be configured to intelligently manage the COT allocation through online auctions by providing functions for managing online auctions (for example, providing various mechanisms to create and / or edit the auction list of available COTs, providing an interface for users to bid on the auction list, determining how to allocate available COTs to bidders, and providing the results of COT allocation operations).

[0038] The algorithm allocation application program 120 can be configured to enable users to access the functions of the algorithm allocation application program 120, such as customers who wish to bid on one or more auction lists of one or more available COTs in an online auction. In an embodiment, enabling users to access the functions of the algorithm allocation application program 120 can be achieved by the cooperative operation of the customer front end 170 and the customer front-end business service 172.

[0039] In an embodiment, the customer front end 170 can be configured to provide a UI for users (such as customers who wish to bid on one or more auction lists of one or more COTs) to obtain the auction list of available COTs, select the auction list, bid on the auction list, monitor the status of the auction list, view the results of the auction list, etc.

[0040] In an embodiment, the customer front-end business service 172 can be configured to provide functions that facilitate the operation of the customer front-end 170. In an embodiment, the functions of the customer front-end business service 172 can be implemented as one or more services running in the algorithm allocation application 120. The customer front-end business service 172 can be configured to interact with the data service module 150, the winning bidder determination manager 145, and other components of the algorithm allocation application 120. In an embodiment, various objects can be used to implement the customer front-end business service 172. For example, the customer front-end business service 172 can include an auction controller object that can implement various functions for controlling auctions, such as a function for obtaining a data model, an auction acquisition function for retrieving an available auction list, and so on. In some embodiments, the customer front-end business service 172 can include an auction service object that can implement various functions, such as a function for constructing a data model that can use the results of the function for obtaining a data model to construct a data model for an online auction. In some embodiments, the customer front-end business service 172 can include a UI layout controller object that can implement various functions for managing the layout of the user UI presented to the customer. For example, a function for obtaining a screen layout for obtaining a user UI layout configuration can be used. In some embodiments, the customer front-end business service 172 can include an offer business object that can implement various functions and structures that can be used to define an auction list. For example, the offer business object can include structures related to the auction list, including an offer ID, the term of the auction list, the number of COTs in the offer in the auction list, the duration of the auction list, the starting amount (representing the minimum initial amount of the first bid received in the auction list), the start time of the auction list, the end time of the auction list, the auction price increment (representing the minimum amount by which a new bid must be increased from the current bid to exceed the current winning bid), and so on. The offer business object may include functions for defining an auction list, including a list bid function that can be used to obtain an auction list of available COTs. In some embodiments, the customer front-end business service 172 can include a bid business object that can implement various functions and structures that can be used to define an auction list bid. In an embodiment, the bid business object can be used to define a user bid in a format compatible with the algorithm allocation application 120. For example, the bid business object can include structures related to the bid, including a bid ID, the minimum bid amount of the bid, the maximum bid amount, the number of COTs requested in the bid, the number of COTs currently winning the bid, the current bid amount representing the current bid amount of the bid, the user ID, the bid time (e.g., the time / date when the bid was submitted), and so on. In some embodiments, the customer front-end business service 172 can include a COT business object that can implement various functions and structures that can be used to define a COT. The COT business object can be used to define a COT that can be displayed in the bid business object, the offer business object, and / or other components of the algorithm allocation application 120.For example, the COT business object may include structures related to the COT, including the COT type for indicating the COT type, the COT number, the delivery period during which the COT can be allocated to the COT winner after the auction end time, the order number associated with the COT, etc.

[0041] In an embodiment, the algorithm allocation application 120 may be configured to enable a management user to access the functions of the algorithm allocation application 120 to manage various aspects of the functions of the algorithm allocation application 120, thereby intelligently managing the allocation of available COTs. In an embodiment, enabling the user to access the functions of the algorithm allocation application 120 can be achieved through the collaborative operation of the management front end 174 and the management front-end business service 176.

[0042] In an embodiment, the management front end 174 may be configured to provide a UI available for management users to manage various aspects of the online auction, such as creating an auction list, editing an auction list, managing an auction list, issuing COTs to the winners, etc.

[0043] In an embodiment, the management front-end business service 176 may be configured to provide functions facilitating the operation of the management front-end 174. In an embodiment, the functions of the management front-end business service 225 may be implemented as one or more services running in the algorithm allocation application 120. The management front-end business service 176 may be configured to interact with the data service module 150, the winning bidder determination manager 145, and other components of the algorithm allocation application 120. In an embodiment, the management front-end business service 176 may be implemented using various objects. For example, the management front-end business service 176 may include a management auction controller object, which may implement various functions to control an auction, such as a function to obtain a data model, an upload offer function to implement uploading an auction list (e.g., defining the configuration of the auction list), a manual winning bidder determination function allowing a management user to manually select a winning bidder for the auction list, a manual COT release function allowing a management user to manually release or allocate COT, a manual bid creation function allowing a management user to manually create a bid for the auction list, etc. In some embodiments, the management front-end business service 176 may include a management auction service object, which may implement various functions, such as a function to build a data model (which may use the result of the function to obtain a data model to build a data model for an online auction), an Excel parsing function (parsing the uploaded auction list spreadsheet for publication in an online auction), an offer creation function (creating an auction list (e.g., in the spreadsheet of the auction list or a single auction list specified by a management user)), a COT issuance function (allowing a management user to issue or allocate COT to a customer (e.g., a winning bidder)), a bid creation function (allowing a management user to manually create a bid), and so on. In some embodiments, the management front-end business service 176 may include an offer business object, which may implement various functions and structures available for defining an auction list. For example, the offer business object may include structures related to the auction list, including an offer ID, the term of the auction list, the number of offer COTs in the auction list, the duration of the auction list, the starting amount (representing the minimum initial amount of the first bid received in the auction list), the start time of the auction list, the end time of the auction list, the bid increment (representing the minimum amount by which a new bid must be increased from the current bid to exceed the current bid and win), etc. The offer business object may include functions for defining the auction list, including a list bid function for the auction list that may be used to obtain available COT. In some embodiments, the management front-end business service 176 may include a bid business object, which may implement various functions and structures available for defining a bid for an auction list. In an embodiment, the bid business object may be used to define a user bid in a format compatible with the algorithm allocation application 120.For example, a bid business object may include structures related to a bid, including a bid ID, a minimum bid amount of the bid, a maximum bid amount, the number of COTs requested in the bid, the number of COTs currently won in the bid, a current bid amount representing the current bid amount of the bid, a user ID, a bid time (e.g., the time / date when the bid is submitted), and so on. In some embodiments, the management front-end business service 176 may include a COT business object, which may implement various functions and structures available for defining a COT. The COT business object can be used to define the COTs that can be displayed in the bid business object, the offer business object, and / or other components of the algorithm allocation application 120. For example, the COT business object may include structures related to a COT, including a COT type for indicating the COT type, a COT number, a delivery period during which the COT can be allocated to the COT winning bidder after the auction end time, an order number associated with the COT, and so on.

[0044] In an embodiment, the algorithm allocation application 120 can be configured to provide functions to offer common services related to online auctions and various listings in the online auction. For example, in an embodiment, the function of the algorithm allocation application 120 to provide common services related to online auctions and various listings in the online auction can be implemented through the operation of the auction common service 180. In an embodiment, the auction common service 180 can be implemented as one or more services running in the algorithm allocation application 120. The auction common service 180 can be configured to interact with the customer front-end business service 172, the management front-end business service 176, the bid submission manager (BPM) 178, and / or other components of the algorithm allocation application 120. In an embodiment, the auction common service 180 can be implemented using various objects. For example, the auction common service 180 can include an auction common controller object, which can implement various functions related to online auctions and / or auction listings, such as the issue COT function that allows the issuance or allocation of COT to a customer (e.g., the winning bidder). In some embodiments, the auction common service 180 can include an offer business object, which can implement various functions and structures that can be used to define an auction listing. For example, the offer business object can include structures related to the auction listing, including the offer ID, the term of the auction listing, the number of COTs in the offer in the auction listing, the duration of the auction listing, the starting amount (representing the minimum initial amount of the first bid received in the auction listing), the start time of the auction listing, the end time of the auction listing, the bid increment amount (representing the minimum amount by which a new bid must be increased from the current bid to exceed the current winning bid), etc. The offer business object may include functions for defining an auction listing, including a list bid function for the auction listing that can be used to obtain available COTs. In some embodiments, the auction common service 180 can include a bid business object, which can implement various functions and structures that can be used to define an auction listing bid. In an embodiment, the bid business object can be used to define a user bid in a format compatible with the algorithm allocation application 120. For example, the bid business object can include structures related to the bid, including the bid ID, the minimum bid amount of the bid, the maximum bid amount, the number of COTs requested in the bid, the number of COTs currently winning the bid, the current bid amount representing the current bid amount of the bid, the user ID, the bid time (e.g., the time / date when the bid is submitted), etc. In some embodiments, the auction common service 180 can include a COT business object, which can implement various functions and structures that can be used to define COTs. The COT business object can be used to define COTs that can be displayed in the bid business object, the offer business object, and / or other components of the algorithm allocation application 120.For example, a COT business object may include structures related to COT, including a COT type for indicating the COT type, a COT number, a delivery period during which the COT can be allocated to the winning bidder of the COT after the auction end time, an order number associated with the COT, and so on.

[0045] In an embodiment, the algorithm allocation application 120 may include a BPM 178. The BPM 178 may be configured to provide functions to provide an interface for managing bids in an auction and to provide the results of the auction list to the data service module 150. In an embodiment, the algorithm allocation application 120 may include a winning bidder determination manager 145. The winning bidder determination manager 145 may be configured to execute or apply algorithms, machine learning models, mathematical models, rule models, and / or other models that can be used to intelligently determine whether all available COTs are within the request scope, intelligently adjust the allocation of available COTs to the requesting bidders based on the availability of COTs, and intelligently and dynamically determine the price of the allocated COTs. Some functions of the winning bidder determination manager 145 may be described in further detail below. In an embodiment, the winning bidder determination manager 145 may be configured to interact with the customer front-end business service 172, the management front-end business service 176, the BPM 178, and / or other components of the algorithm allocation application 120. In an embodiment, the winning bidder determination manager 145 may be implemented using various objects. For example, the winning bidder determination manager 145 may include a winning bidder determination controller object that may implement various functions related to determining the winning bidder in the auction list, such as the function of determining the winning bidder for on-site auctions to release COTs (to determine the winning bidder in on-site auctions), the function of determining the winning bidder for blind auctions to release COTs (to determine the winning bidder in blind auctions), etc. In some embodiments, the winning bidder determination manager 145 may include a winning bidder determination service object that may implement various functions, such as the function of determining the winning bidder for on-site auctions to release COTs (to determine the winning bidder in on-site auctions), the function of determining the winning bidder for blind auctions to release COTs (to determine the winning bidder in blind auctions), etc. In some embodiments, the winning bidder determination manager 145 may include an offer business object that may implement various functions and structures that can be used to define the auction list. For example, the offer business object may include structures related to the auction list, including the offer ID, the duration of the auction list, the number of offer COTs in the auction list, the duration of the auction list, the starting amount (representing the minimum initial amount of the first bid received in the auction list), the start time of the auction list, the end time of the auction list, the bid increment (representing the minimum amount by which a new bid must be increased from the current bid to exceed the current winning bid), etc. The offer business object may include functions for defining the auction list, including the list bid function for the auction list that can be used to obtain available COTs. In some embodiments, the winning bidder determination manager 145 may include a bid business object that may implement various functions and structures that can be used to define the bids in the auction list. In an embodiment, the bid business object may be used to define user bids in a format compatible with the algorithm allocation application 120.For example, a bid business object may include structures related to a bid, including a bid ID, a minimum bid amount of the bid, a maximum bid amount, the number of COTs requested in the bid, the number of COTs currently won in the bid, a current bid amount representing the current bid amount of the bid, a user ID, a bid time (e.g., the time / date when the bid is submitted), and so on.

[0046] In an embodiment, the algorithm allocation application 120 may include a data service module 150. As described above, the data service module 150 may be configured to receive results from an auction list and store the results of the auction list in a database 160 to perform an allocation for the winning bidder. In an embodiment, the data service module 150 may be implemented using various components. For example, the data service module 150 may include an auction data service 182, a certificate data service 184, and a customer data service 186.

[0047] In an embodiment, the auction data service 182 can be configured to provide functionality to manage multiple aspects related to auction listing management. In an embodiment, the auction data service 182 can be implemented as one or more services running in the algorithm allocation application 120. In an embodiment, the auction data service 182 can be implemented using various objects. For example, the auction data service 182 can include a bid object that defines bids in an auction listing, an offer object that defines the offer of the auction listing, a bid controller object that can be used to implement various functions related to controlling bids in the auction listing, such as a get bid function for obtaining a bid object related to a bid (e.g., a bid being submitted or a previously submitted bid), a new bid function for defining a new bid that has been or is about to be submitted in the auction listing, an update bid function for updating a submitted bid, a delete bid function that allows deleting a previously submitted bid, and so on. In some embodiments, the auction data service 182 can include a bid service object that can implement various functions, such as a get bid function for obtaining a bid object related to a bid (e.g., a bid being submitted or a previously submitted bid), a new bid function for defining a new bid that has been or is about to be submitted in the auction listing, an update bid function for updating a submitted bid, a delete bid function that allows deleting a previously submitted bid, and so on. In an embodiment, the auction data service 182 can include an offer controller that can be used to implement various functions related to controlling the COT offer in the auction listing, such as a get offer function for obtaining an offer object related to the COT offer in the auction listing, a new offer function for defining a new COT offer for the auction listing, an update offer function for updating the COT offer in the auction listing, a delete offer function that allows deleting a previous COT offer in the auction listing, and so on. In some embodiments, the auction data service 182 can include an offer service object that can implement various functions, such as a get offer function for obtaining an offer object related to the COT offer in the auction listing, a new offer function for defining a new COT offer for the auction listing, an update offer function for updating the COT offer in the auction listing, a delete offer function that allows deleting a previous COT offer in the auction listing.

[0048] In an embodiment, the certificate data service 184 may be configured to provide functions for managing multiple aspects related to COT management. In an embodiment, the certificate data service 184 may be implemented as one or more services running in the algorithm allocation application 120. In an embodiment, the certificate data service 184 may be implemented using various objects. For example, the certificate data service 184 may include a COT object that defines the COT provided or won in the auction list, a channel object that defines the channel associated with the COT in the auction list, and a COT controller object that can be used to implement various functions associated with the management of the COT object in the auction list. For example, a get COT function for obtaining the COT object, a new COT function for defining a new COT to be provided in the auction list, an update COT function for updating a previously created COT object, a delete COT function that allows deleting a previously created COT object, etc. In some embodiments, the certificate data service 184 may include a COT service object that can be used to implement various functions, such as a get COT function for obtaining the COT object, a new COT function for defining a new COT to be provided in the auction list, an update COT function for updating a previously created COT object, a delete COT function that allows deleting a previously created COT object, etc. In an embodiment, the certificate data service 184 may include a channel controller object that can be used to implement various functions related to the management of the channel associated with the COT object in the auction list. For example, a get channel function for obtaining the channel object, a new channel function for defining a new channel associated with the COT in the auction list, an update channel function for updating a previously created channel object, a delete channel function that allows deleting a previously created channel object, etc. In some embodiments, the certificate data service 184 may include a channel service object that can be used to implement various functions, such as a get channel function for obtaining the channel object, a new channel function for defining a new channel associated with the COT in the auction list, an update channel function for updating a previously created channel object, a delete channel function that allows deleting a previously created channel object.

[0049] In an embodiment, the customer data service 186 may be configured to provide functionality to manage multiple aspects related to customer data management. In an embodiment, the certificate data service 184 may be implemented as one or more services running in the algorithm allocation application 120. In an embodiment, the customer data service 186 may be implemented using various objects. For example, the customer data service 186 may include a customer object that defines a customer (e.g., a customer who bids in an auction list), and a customer controller object that can be used to implement various functions related to the management of the customer object, such as a get customer function for obtaining the customer object, a new customer function for defining a new customer to be added to the system or a new customer in an auction list, an update customer function for updating a previously created customer object, a delete customer function that allows the deletion of a previously created customer object, etc. In some embodiments, the customer data service 186 may include a customer service object that can be used to implement various functions, such as a get customer function for obtaining the customer object, a new customer function for defining a new customer to be added to the system or a new customer in an auction list, an update customer function for updating a previously created customer object, a delete customer function that allows the deletion of a previously created customer object.

[0050] Figure 2A The block diagram shows an exemplary operation of a system implemented according to an embodiment of the present disclosure that intelligently manages the COT allocation function through an online auction. Figure 2AAn exemplary operation implemented according to an embodiment of the present disclosure is shown, which may include a series of steps performed by user 305 to utilize the functions of an algorithm allocation application (e.g., algorithm allocation application 120). In step 212, user 202 may perform a user operation to request the auction page 203. In response to user 202's request for the auction page 203, in step 214, a function to obtain the available auction list (e.g., getAuctions()) may be executed, with the execution object being the auction controller 204 (e.g., the auction controller object of the customer front-end business server component of the algorithm allocation application 120, as shown in FIG. 2 above, or the management auction controller object of the management front-end business server component of the algorithm allocation application 120, as shown in FIG. 2 above). In step 216, the auction controller 204 may request the components of the auction page to be displayed from the screen service 206, i.e., use a function (e.g., getScreenComponent()) for the screen service 206 to specify type = Auction and provide the user ID. In step 218, the screen service 206 may, in response to the getScreenComponent() function call, return the screen components of the auction page to the auction controller 204 based on the type = auctions and the user ID provided by the auction controller in step 216. In step 220, the auction controller 204 may request a list of available auctions, with the request object being the auction service 208 (e.g., the auction service object of the customer front-end business server component of the algorithm allocation application 120, as shown in FIG. 2 above, or the management auction service object of the management front-end business server component of the algorithm allocation application 120, as shown in FIG. 2 above). The auction service 208 may return a list of available auctions to the auction controller 204 in step 222. In step 224, the auction controller 204 may return the auction page (e.g., auction page 203) to be presented to user 202 based on the screen components received from the screen service 206 and the auction list received from the auction service 208.

[0051] In step 230, user 202 may perform an administrative operation to create one or more auctions or auction listings. Specifically, in this example, user 202 may be an administrative user, and the operation in step 230 may involve creating one or more auction listings based on a configuration file (e.g., a spreadsheet including the configuration of one or more auction listings to be created). Thus, in step 230, user 202 may use a page (e.g., a page of auction page 203 or another administrative page configured to allow user 202 to upload an auction configuration file) to upload an auction configuration file (e.g., a spreadsheet including the configuration of one or more auction listings, such as an Excel spreadsheet). In step 232, a function may be executed on auction controller 204 to upload the auction listings (e.g., uploadAuctions()). In step 234, auction controller 204 may execute a function (e.g., UploadAuctions()) on BPM 178 to upload the auction listings. In response to executing the function to upload the auction listings, BPM 178 may parse the auction configuration file in step 236 and may instantiate auction objects. In some embodiments, the auction objects may include a list of one or more auction listings to be listed according to the configuration in the auction configuration file. In step 238, a function (e.g., createAuctions) may be executed on auction service 208 to create auction listings for each of the auction listings in the auction objects created by BPM 178. The result of the function to create the auction listings may be returned from auction service 208 to BPM 178. In step 240, BPM 178 may send a notification of the creation of the auction listings to notification adapter 210. In some embodiments, the notification may include an alert that may be sent to user 178 or other users (e.g., administrative users). In an embodiment, the result may also be returned to BPM 178 in step 242, to auction controller 204 in step 244, and to auction page 203 in step 246 for presentation to user 202.

[0052] Figure 2B The block diagram shows an exemplary operation of a system implemented according to an embodiment of the present disclosure with a function of intelligently managing COT allocation through an online auction. Figure 2B The exemplary operation implemented according to an embodiment of the present disclosure is shown and may include a series of steps to utilize the function of an algorithm allocation application (e.g., algorithm allocation application 120). Specifically, Figure 2BThe exemplary operations shown may include a series of steps to be performed for creating an offer for an available COT. At step 260, the planning team may create or generate an auction profile (e.g., a spreadsheet (such as an Excel spreadsheet) including a configuration of one or more auction lists (including offers for one or more available COTs)), and / or may upload the auction profile to the auction controller 254 (e.g., the managed auction controller object of the management front-end business server component of the algorithm allocation application 120, as shown in FIG. 2 above). In response to the uploaded auction profile, the auction controller may parse (e.g., by executing a parsing function or logic) the auction profile at step 262. At step 264, the administrator 202 may perform an operation on the auction controller 254, which may include a request to create a new offer (e.g., by executing a function to create a new offer for each COT provided in the auction list). In response to the request to create a new offer, the auction controller 254 may create an offer business object for each COT offer at step 266, and may update the database using the created offer business objects (e.g., the database 160) at step 268. At step 270, the auction controller 254 may request the module 256 to start a workflow, which may be a component of the BPM 178 (e.g., by executing the launchWorflow() function). At step 272, the module 256 may request the integration service 258 to provide a notification service associated with the started workflow for creating a new COT offer.

[0053] At step 274, the administrator 202 may perform other user operations, which may include confirming the COT offers created by the auction controller 254. At step 276, the auction controller 254 may execute a function to move a token to the module 256. At step 278, the module 256 may request the integration service 258 to provide a notification service associated with the token moved by the module 256. At step 280, the module 256 may request the auction controller 254 to update the dashboard (e.g., by updating the list of offer business objects). The auction controller 254 may send a success message to the module 256 at step 282, and the module 256 may request the integration service 258 to provide a notification service associated with the dashboard update at step 284. At step 286, the module 256 may start the offer workflow.

[0054] In step 288, the administrator 202 may perform other user operations, which may include updating the COT offer to the auction controller 254. In step 290, in response to receiving a request to update the COT offer from the administrator 202, the auction controller 254 may execute a function to update the offer to the module 256. In this case, the function may include a list of offer business objects related to the updated COT offer. In step 292, the auction controller 254 may execute the function to update the COT offer.

[0055] Figure 3 The flowchart of is a representative method 300 for intelligently managing COT allocation through an online auction implemented according to an embodiment of the present disclosure. In an embodiment, the steps of method 300 may be implemented by the functions of the various components of system 100. For example, specifically, the function of the winning bidder determination manager 145 may allow system 100 to execute the steps of method 300 to intelligently manage the allocation of COT through an online auction implemented according to an embodiment of the present disclosure, such as by managing the allocation of available COT based on bid requests received in the online auction. Similarly as described above, the winning bidder determination manager 145 may include algorithms, machine learning models, mathematical models, rule models, and / or other models configured to provide functions for system 100. In an embodiment, the steps of method 300 may be implemented as steps of the algorithms, machine learning models, mathematical models, rule models, and / or other models of the winning bidder determination manager 145.

[0056] In step 305, during operation, system 100 receives one or more bid requests from one or more bidders in the online auction for one or more available COTs. For example, one or more bidders may submit one or more bid requests, such as using a user terminal, and may provide one or more bid requests to network 105 (e.g., via communication network 115). In an embodiment, each bid request may include a request for one or more COTs among the available COTs being allocated. In an embodiment, each available COT may represent a basic commodity. In an embodiment, the bid request may include a new bid (e.g., a bid request), or may include a bid edit (e.g., an edit to a previously submitted bid request). In an embodiment, each bid request may include the minimum bid amount that the bidder is willing to pay for the COT requested in the bid request, and the maximum bid amount that the bidder is willing to pay for the COT requested in the bid request. In an embodiment, potential bidders may discover the available COTs being auctioned and submit auction requests for one or more available COTs.

[0057] In an embodiment, during operation, the system 100 executes an algorithmic allocation application (a winning bidder determination manager 145, as shown in FIG. 1 ) configured to manage the allocation of available COTs based on bid requests received from bidders. For example, at step 310, the algorithmic allocation application aggregates each bid request received from a bidder into a bid request list by executing or applying an algorithm, a machine learning model, a mathematical model, a rule model, etc. In an embodiment, the bid request list may include all bid requests (e.g., new bids and edited bids) from all bidders. In an embodiment, the bid request list may also include all winning bidders of at least one auction list, and the first unsuccessful bidder (e.g., the bidder next to the last winning bidder, such as by bid amount or by time). Once a bid request is submitted or received, or the COT auction list time ends or expires, the bid request list may be created. The bid request list may also be updated after a new bid or edited bid is entered. The list may include all new bids or edited bids, all winning bidder bids, and the bid of the first unsuccessful bidder.

[0058] At step 315, the algorithm distributes all COTs requested by all bid requests included in the bid request list. In an embodiment, each bidder may request one or more COTs through the online auction process by submitting a bid request for one or more COTs during the online auction.

[0059] At step 320, the algorithmic allocation application determines whether the total number of COTs requested in the bid request received from the bidder is more than the total number of available COTs. When it is determined that the total number of COTs requested in the bid request received from the bidder is less than or equal to the total number of available COTs provided or available for allocation in the online auction, the algorithmic allocation application will execute step 325. When it is determined that the total number of COTs requested in the bid request received from the bidder is more than the total number of available COTs provided or available for allocation in the online auction, the algorithmic allocation application will execute step 330.

[0060] In step 325, since it is determined that the total number of COTs requested in the bid requests received from the bidders is less than or equal to the total number of available COTs offered or available for allocation in the online auction, the algorithm allocation application allocates the COTs in the available COTs to each bidder according to the COTs requested in the corresponding bid requests (e.g., allocates the requested COTs to each bidder). In an embodiment, the algorithm allocation application also determines the price of each COT allocated to the bidder according to the lowest bid amount in the bid request requesting the allocation of COTs. In this way, the price of the COTs allocated to each bidder depends on the lowest bid amount in the bid request requesting the allocation of COTs. Therefore, for all bid requests, the lowest bid amount in a certain bid request is determined as the winning bid amount for that bid request. In an embodiment, a notice can be sent to all winning bidders, and the corresponding COTs can be allocated accordingly. The algorithm allocation application can execute step 360.

[0061] In step 330, since it is determined that the total number of COTs requested in the bid requests received from the bidders is more than the total number of available COTs offered or available for allocation in the online auction, the algorithm allocation application sorts the bid request list based on the highest bid amount in each bid request in the bid request list. In an embodiment, sorting the bidders according to the highest bid amount can enable the algorithm allocation application to determine the first non-winning bidder. For example, the algorithm allocation application can determine the bidder with the highest bid amount second only to the last winning bid request in the sorted bid request list as the first non-winning bidder in the order of the sorted bid request list.

[0062] In step 335, the algorithm allocation application performs a secondary or further sorting of the bid request list according to the submission time of the bid requests in the bid request list. For example, if the highest auction amount is equal to the highest auction amount of the second auction request, but the submission time of the first auction request is earlier than that of the second auction request, the first auction request can be sorted higher than the second auction request. In this way, the bid requests are further sorted according to the bid time to determine the winning bidder between two possibly equal but different submission-time highest bids, and the earlier-submitted bid is determined as the winning bid.

[0063] In step 340, the algorithm allocation application allocates the COTs in the available COTs to each bid request in the bid request list according to the sorting order of each bid request in the bid request list. In an embodiment, the winning bidder of the COTs can be determined before setting the specific price of the allocated COTs. In some embodiments, a lowest bid amount threshold can be used to filter out the bid requests with the highest bid amount lower than the lowest bid amount threshold of the requested COTs.

[0064] In an embodiment, the algorithm allocation application determines the price of each COT assigned to each bid request in the bid request list. Determining the price may include determining the price of each COT assigned to each bid request in the bid request list based on whether all the COTs requested in the bid requests received from bidders have corresponding winning bids in the bid request list.

[0065] For example, in step 345, the algorithm allocation application determines whether all the COTs requested in the bid requests received from bidders have corresponding winning bids in the bid request list. Since it is determined that all the COTs requested in the bid requests received from bidders have corresponding winning bids in the bid request list, the algorithm allocation application performs step 350. Since it is determined that not all the COTs requested in the bid requests received from bidders have corresponding winning bids in the bid request list, the algorithm allocation application performs step 355.

[0066] In step 350, when all the COTs requested in multiple bid requests have corresponding winning bids in the bid request list, the algorithm allocation application determines the price of each COT assigned to each bid request in the bid request list based on the bid amount of the first non-winning bidder. For example, in an embodiment, the price of each winning bidder may be set to be equal to the bid ranked higher than the first non-winning bid. In these embodiments, the next winning bid may be set to be equal to the highest bid amount of the first non-winning bidder or the overall lowest bid amount (whichever is higher). In some embodiments, the winning bid may be equal to the highest bid amount of the first non-winning bidder, but the winning bid may be submitted earlier than the bid of the first non-winning bidder. When the bid of the first non-winning bidder is determined to be submitted earlier than the winning bid, the winning bid amount may be set to the highest value of the first non-winning bid plus the bid increment or the lowest bid threshold. When using the bid increment, the winning price shall not be higher than the highest winning bid amount.

[0067] In step 355, when not all the COTs requested in multiple bid requests have corresponding winning bids in the bid request list, the algorithm allocation application determines the price of each COT assigned to each bid request in the bid request list based on the bid amount of the last winning bidder. In an embodiment, for all the winning bids submitted before the last winning bid, the price of the winning bid is set to be equal to the highest bid amount of the last winning bidder or the total bid amount (whichever is higher). For all the winning bids submitted after the last winning bid, the price of the winning bid is set to be equal to the highest bid amount of the last winning bidder plus the bid increment or the total lowest bid (whichever is higher). When using the bid increment, the winning price shall not be higher than the highest winning bid amount.

[0068] In step 360, the algorithm assigns the allocated COTs in the bid request list to each bidder associated with each bid request in the bid list according to the price determined by the steps of method 300.

[0069] Table 1-3 below provides a specific example of an available COT management and allocation process implemented according to an embodiment of the present disclosure. Specifically, Table 1-3 shows the results of an online auction process, which can be used to illustrate the application of the functions disclosed herein.

[0070] It should be understood that the examples provided below are not limiting in any way, but are for illustrative purposes only.

[0071]

[0072] Table 1 shows an example where two COTs are available for allocation. In this example, the two available COTs are offered through an online auction. Companies A - F submit bid requests and bids for the two available COTs. Since Company A submitted the bid request first, Company A is the first bidder, and its bid amount only matches subsequent bid amounts until the bid amount of a later bidder exceeds the highest bid amount of Company A. In this example, the highest bid of Company A for the two available COTs is $100,000. If a subsequent bidder wishes to win the available COT, their bid must exceed $100,000.

[0073] After the first bidder (e.g., Company A), the highest bid amount of the fifth bidder is $6,000 each time. After the bid of the fifth bidder is submitted and received, the winning bidder before this bid must match the highest bid amount of $6,000. In other words, the highest winning bid amount of Company A is $6,000. The highest bid amounts submitted by all other companies are lower than $6,000, so they will no longer be considered during the bidding process. Company B submitted a bid after Company C, but the highest bid amount is only $5,000. Since the highest bid amount of Company B is lower than the winning bid amount, the bid of Company B is not competitive.

[0074] Finally, Company A wins the requested COT with a bid amount of $6,000

[0075]

[0076] Table #2

[0077] Table 2 shows an example of five COTs available for allocation. In this example, the five available COTs are offered through an online auction offer. Companies A - C bid on the five COTs available for allocation. In this case, Company B is the first bidder. Company B submitted a starting price of $20,800 and a maximum bid amount of $21,000 for four of the available COTs. Company C is the second bidder, submitting a starting price of $20,800 and a maximum bid amount of $21,000 for four of the available COTs. The maximum bid amounts of Company B and Company C are equal, but Company B's bid request was submitted earlier than Company C's bid request. Company A's bid request ranks third, with a starting price of $21,000 and a maximum bid amount of $21,500 for four of the available COTs.

[0078] For Company A to win one or more of the available COTs, the maximum bid amount in Company A's bid request must be at least $1 higher than the maximum bid amounts of other bidders because Company A's bid request was submitted last. In this case, Company A may win the COTs for these four requests because the maximum bid amount in Company A's bid request exceeds the maximum bid amounts in the bid requests of Company B and C. When the third bid amount was submitted, Company B's bid request was increased to the maximum bid amount in the bid request. Although the maximum bid amounts of Company B and Company C may be the same, Company B won the remaining COTs because Company B submitted its bid first. Company C's bid was raised to the maximum bid amount by Company A.

[0079] The earlier bid time constitutes a tie, meaning Company B won the remaining COTs not bid on by Company A.

[0080]

[0081]

[0082] Table #3

[0083] Table 3 shows an example of one COT available for allocation. In this example, the available COT is offered through an online auction list. In this example, Company A is the first bidder, submitting a starting price of $20,800 and a maximum bid amount of $20,800. Company B is the second bidder, submitting a starting price of $20,800 and a maximum bid amount of $20,800. Since the maximum bid amounts of Company A and Company B are the same, the winning bidder is determined by the bid time. Company A is the first bidder, so Company A won the available COT.

[0084] Figure 4An exemplary high-level functional block diagram is shown, which shows a representative computer network operating environment for intelligently managing COT allocation implemented in accordance with an embodiment of the present disclosure. In the illustrated embodiment, system 400 is based on a host data processing and control system (server) 401 and a global network 402 (such as the Internet). The global network 402 can also be a private, organizational, or government-based computer network known in the art, such as a wide area network (WAN) or a local area network (LAN). Figure 4 The interconnections between the operation blocks shown in the illustrated system 400 can be implemented through hardwired connections, wireless connections, or a combination of both.

[0085] Generally speaking, the principles of the present disclosure are applicable regardless of the high-level architecture and high-level hardware-software implementation of system 400. System 400 allows users (such as railway customers or railways) to monitor and manage transportation certificates using end-user terminals 403, a railway main server 401, and related databases 405, communication interconnections 404, and network 402. The end-user terminal 403 can be a desktop computer, laptop, tablet, mobile phone, or similar traditional computing and communication device that supports standard network connections through a browser or application. In a typical operating environment, system 400 will have multiple users, including users employed by the railway and users employed by customers, in addition to a corresponding number of end-user terminals 403, but Figure 4 only 3 end-user terminals 403 and a corresponding number of communication interconnections 404 are shown for reference.

[0086] The subsystems of system 400 include a railway main server 401, a database 405, and a communication interconnection 404, preferably based on hardware and software systems known in the art, including computers, servers, processors, displays, and communication systems. Depending on the specific configuration of system 400 employed, the underlying hardware and software can be all or part local (e.g., centralized in a data center somewhere) or distributed (e.g., dispersed processing nodes in multiple locations).

[0087] Those skilled in the art will readily understand that the above advantages and objectives would not be achievable without the specific combination of computer hardware and other structural components and mechanisms assembled in the system of the present invention and described herein. In addition, the algorithms, methods, and processes disclosed herein improve and transform any general-purpose computer or processor disclosed in this specification and the accompanying drawings into a special-purpose computer that is programmed to execute the disclosed algorithms, methods, and processes to achieve the above functions, advantages, and objectives. It should also be understood that for those proficient in the art, there are various programming tools available for generating and implementing the functions and operations described above. In addition, the selection of a specific programming tool may be determined by the specific objectives and constraints for implementing these concepts, which are selected to implement the concepts set forth in this document and the appended claims.

[0088] The description in this patent document should not be construed as implying that any particular element, step, or function is an essential or critical element that must be included within the scope of the claims. Moreover, unless the exact words "means for" or "step for" are expressly used in a particular claim and followed by a participle phrase identifying the function, no claim is intended to invoke 35 U.S.C. § 112(f) for any additional claim or claim element. Terms used in the claims (such as, but not limited to, "mechanism", "module", "device", "unit", "component", "element", "member", "means", "machine", "system", "processor", "processing device", or "controller") should be understood to and intended to refer to structures known to those of ordinary skill in the relevant art and further modified or enhanced by the characteristics of the claim itself, and are not intended to invoke 35 U.S.C. § 112(f). For example, the terms "processor" and "controller" may be a class of structures rather than a specific structure and may be defined in functional terms, but this does not mean that it is a means-plus-function. Even under the broadest reasonable interpretation, claims are not intended to invoke 35 U.S.C. § 112(f) in the absence of the above specific language according to this paragraph of the specification.

[0089] The present disclosure may be embodied in other specific forms without departing from its spirit or essential characteristics. For example, each new structure described herein can be modified to accommodate specific local variations or requirements while retaining their basic configuration or the structural relationship between each other, or while performing the same or similar functions described herein. Therefore, the current embodiments should be considered illustrative rather than restrictive in all respects. Thus, the scope of the present disclosure can be determined by the appended claims rather than the above description. Accordingly, all changes within the meaning and scope of equivalence of the claims should be included in the claims. In addition, the individual elements in the claims are not well-known, conventional, or traditional. Instead, the claims are directed to non-conventional inventive concepts described in the specification

[0090] Those skilled in the art should also understand that the various illustrative logical blocks, modules, circuits, and algorithmic steps described in connection with the present disclosure may be implemented as electronic hardware, computer software, or a combination of both. To clearly illustrate this interchangeability of hardware and software, the various illustrative components, blocks, modules, circuits, and steps have been described above in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and the design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be construed as causing a departure from the scope of the present disclosure. Those skilled in the art will also readily recognize that the order or combination of the components, methods, or interactions described herein are merely examples, and that the components, methods, or interactions of the various embodiments of the present disclosure may be combined or performed in ways other than those shown and described herein

[0091] The functional blocks and modules in FIGS. 1-4 may include a processor, an electronic device, a hardware device, an electronic component, a logic circuit, a memory, software code, firmware code, etc., or any combination thereof. Consistent with the foregoing, the various illustrative logical blocks, modules, and circuits described in connection with the present disclosure may be implemented or performed using a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. The general-purpose processor may be a microprocessor, but, alternatively, the processor may be any conventional processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration

[0092] The steps of a method or algorithm described in connection with the content disclosed herein can be embodied directly in hardware, in a software module executed by a processor, or in a combination of both. The software module can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium can be integral to the processor. The processor and the storage medium can reside in an ASIC. The ASIC can reside in a user terminal, a base station, a sensor, or any other communication device. In the alternative, the processor and the storage medium can reside as discrete components in a user terminal.

[0093] In one or more exemplary designs, the functions described can be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions can be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A computer-readable storage medium can be any available medium that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a general purpose or special purpose computer or a general purpose or special purpose processor. Also, a connection can be properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, or digital subscriber line (DSL), then the coaxial cable, fiber optic cable, twisted pair, or DSL are included in the definition of medium. The term "disk" and "disc" can include CD's, laser disks, optical disks, DVD's, floppy disks, and Blu-ray disks where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.

[0094] Although the present disclosure has been described in detail along with its advantages, it should be understood that various modifications, substitutions, and alterations can be made to the disclosure without departing from the spirit and scope of the disclosure as defined by the appended claims. Additionally, the scope of the present application is not limited to the specific embodiments of the processes, machines, manufactures, compositions of matter, devices, methods, and steps described in the specification. As will be readily understood by one of ordinary skill in the art from the present disclosure, processes, machines, manufactures, compositions of matter, devices, methods, or steps that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein can be utilized, based on the present disclosure, using existing or later-developed ones. Accordingly, the appended claims are intended to embrace such processes, machines, manufactures, compositions of matter, devices, methods, or steps within their scope.

Claims

1. Intelligent Management System for Allocating Certificate of Transportation (COT), comprising: at least one processor; and a memory operably coupled to the at least one processor and storing processor-readable code which, when executed by the at least one processor, is configured to perform operations including: receiving multiple bid requests from multiple bidders, each bid request in the multiple bid requests making an allocation request for one or more of the multiple available COTs, where one or more of the COTs respectively represent basic commodities, and each bid request in the multiple bid requests includes a minimum bid amount and a maximum bid amount corresponding to each of the one or more COTs; executing an algorithm allocation application configured to manage the allocation of the multiple available COTs based on the multiple bid requests, where executing the algorithm allocation application includes: aggregating each bid request in the multiple bid requests from the multiple bidders into a bid request list; determining whether the total number of COTs requested in the multiple bid requests is more than the total number of COTs in the multiple available COTs; when the total number of COTs requested in the multiple bid requests does not exceed the total number of COTs in the multiple available COTs: allocating the COTs in the multiple available COTs to each corresponding bidder among the multiple bidders according to the one or more COTs requested in the bid requests received from each bidder among the multiple bidders; and determining the price of each allocated COT according to the minimum bid amount in the bid request corresponding to the COT allocated to the bid request; when the total number of COTs requested in the multiple bid requests exceeds the total number of COTs in the multiple available COTs: sorting the bid request list according to the maximum bid amount of each bid request in the bid request list; further sorting the bid request list according to the submission time of each bid request in the bid request list, such that the first bid request with a maximum bid amount equal to that of the second bid request and a submission time earlier than that of the second bid request is ranked higher than the second bid request; allocating the COTs in the multiple available COTs to each bid request in the bid request list according to the sorting order of each bid request; and determining the price of each COT allocated to each bid request in the bid request list, where determining the price includes: when all the COTs requested in the multiple bid requests have corresponding winning bids in the bid request list, determining the price of each COT allocated to each bid request in the bid request list according to the bid amount of the first non-winning bidder; and when all the COTs requested in the multiple bid requests do not have corresponding winning bids in the bid request list, determining the price of each COT allocated to each bid request in the bid request list according to the bid amount of the last winning bidder; and allocating the COTs allocated in the bid request list to each bidder associated with each bid request in the bid request list to which the COTs have been allocated.

2. The COT Allocation Management System according to Claim 1, wherein, Each bid request among multiple bid requests includes one or more new bid requests and edits to previously submitted bid requests.

3. The COT allocation management system according to claim 1, further comprising filtering bid requests with a highest bid amount less than a lowest bid amount threshold through an algorithm allocation application.

4. The COT allocation management system according to claim 1, wherein, Determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the first non-winning bidder includes, according to the order of the bid requests in the bid request list, determining the price of each COT allocated to each bid request in the bid request list to be equal to the highest bid amount among the bids requested before the bid amount of the first non-winning bidder.

5. The COT allocation management system according to claim 4, wherein the next winning bid amount is equal to the bid amount of the first non-winning bidder or the lowest bid amount threshold.

6. The COT allocation management system according to claim 5, wherein the next winning bid amount is the higher of the bid amount of the first non-winning bidder or the lowest bid amount threshold.

7. The COT allocation management system according to claim 1, wherein, Determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the last winning bidder includes, based on the first winning bidder instantiating the price, setting the price of each COT allocated to each bid request in the bid request list to be equal to the highest bid amount of the last winning bidder or the lowest bid amount threshold.

8. The COT allocation management system according to claim 7, wherein, The price of each COT allocated to each bid request in the bid request list is set to the higher of the bid amount of the last winning bidder or the lowest bid amount threshold.

9. The COT allocation management system according to claim 1, wherein instantiating the price based on the first winning bidder includes setting the price of each COT allocated to each bid request in the bid request list submitted later than the last winning bidder to be equal to the highest bid amount of the last winning bidder plus the bid markup or the lowest bid amount threshold.

10. The COT allocation management system according to claim 8, wherein, The price of each COT allocated to each bid request in the bid request list is restricted to not exceed the highest bid amount in each corresponding bid request.

11. The COT allocation management system according to claim 1, further comprising a management terminal configured to: When the transaction is waiting for review, display a first operation list, which includes a clickable edit operation link, a clickable cancel operation link, and a clickable time plan operation link; and When the transaction is being executed, display a second operation list, which includes a clickable extension plan operation link and a clickable create bid operation link.

12. A method for intelligently managing the allocation of a Certificate of Transportation (COT), comprising: Receive multiple bid requests from multiple bidders, each bid request among the multiple bid requests making an allocation request for one or more of a plurality of available COTs, where each of the one or more COTs represents a base commodity respectively, and each bid request among the multiple bid requests includes a minimum bid amount and a maximum bid amount corresponding to each of the one or more COTs; Execute an algorithm allocation application configured to manage the allocation of the plurality of available COTs based on the multiple bid requests, where executing the algorithm allocation application includes: Aggregate each bid request among the multiple bid requests from the multiple bidders into a bid request list; Determine whether the total number of COTs requested in the multiple bid requests is more than the total number of COTs among the plurality of available COTs; When the total number of COTs requested in the multiple bid requests does not exceed the total number of COTs among the plurality of available COTs: Allocate the COTs among the plurality of available COTs to each corresponding bidder among the multiple bidders according to the one or more COTs requested in the bid requests received from each bidder among the multiple bidders; and Determine the price of each allocated COT according to the minimum bid amount in the bid request corresponding to the COT allocated to the bid request; When the total number of COTs requested in the multiple bid requests exceeds the total number of COTs among the plurality of available COTs: Sort the bid request list according to the maximum bid amount of each bid request in the bid request list; Further sort the bid request list according to the submission time of each bid request in the bid request list, such that the first bid request with the maximum bid amount equal to that of the second bid request and with a submission time earlier than that of the second bid request is ranked higher than the second bid request; Allocate the COTs among the plurality of available COTs to each bid request in the bid request list according to the sorting order of each bid request; Determine the price of each COT allocated to each bid request in the bid request list, where determining the price includes: When there are corresponding winning bids for all COTs requested in the multiple bid requests in the bid request list, determine the price of each COT allocated to each bid request in the bid request list according to the bid amount of the first non-winning bidder; and When there are no corresponding winning bids for all COTs requested in the multiple bid requests in the bid request list, determine the price of each COT allocated to each bid request in the bid request list according to the bid amount of the last winning bidder; and Allocate the COTs allocated in the bid request list to each bidder associated with each bid request for which a COT has been allocated in the bid request list.

13. The method according to claim 12, further comprising filtering, by the algorithm allocation application, bid requests with a maximum bid amount less than a minimum bid amount threshold.

14. The method according to claim 12, wherein, Determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the first non-winning bidder includes, according to the order of the bid requests in the bid request list, determining the price of each COT allocated to each bid request in the bid request list to be equal to the highest bid amount among the bids requested before the bid amount of the first non-winning bidder.

15. The method according to claim 14, wherein the next winning bid amount is equal to the bid amount of the first non-winning bidder or the minimum bid amount threshold.

16. The method according to claim 15, wherein the next winning bid amount is higher than the bid amount of the first non-winning bidder or the minimum bid amount threshold.

17. The method according to claim 12, wherein, Determining the price of each COT allocated to each bid request in the bid request list based on the bid amount of the last winning bidder includes, based on the first winning bidder instantiation price, by setting the price of each COT allocated to each bid request in the bid request list to be equal to the highest bid amount of the last winning bidder or the minimum bid amount threshold.

18. The method according to claim 17, wherein, The price of each COT allocated to each bid request in the bid request list is set to the higher of the bid amount of the last winning bidder or the minimum bid amount threshold.

19. The method according to claim 12, wherein based on the first winning bidder instantiation price includes setting the price of each COT allocated to each bid request in the bid request list that submits a bid later than the last winning bidder to be equal to the highest bid amount of the last winning bidder plus the bid markup or the minimum bid amount threshold.

20. A computer-based tool for screening trigger signals from an encoder to trigger an image acquisition device, the computer-based tool includes a non-transitory computer-readable medium storing computer code that, when executed by a processor, causes the computing device to perform operations including, including: Receiving multiple bid requests from multiple bidders, each bid request among the multiple bid requests requests an allocation for one or more of multiple available COTs, where one or more of the COTs respectively represent underlying commodities, and each bid request among the multiple bid requests includes a minimum bid amount and a maximum bid amount corresponding to each of the one or more COTs; Executing an algorithm allocation application configured to manage the allocation of multiple available COTs according to the multiple bid requests, wherein executing the algorithm allocation application includes: Aggregating each bid request among the multiple bid requests from multiple bidders into a bid request list; Determining whether the total number of COTs requested in the multiple bid requests is more than the total number of COTs among the multiple available COTs; When the total number of COTs requested in the multiple bid requests does not exceed the total number of COTs among the multiple available COTs: Allocating the COTs among the multiple available COTs to each corresponding bidder among the multiple bidders according to the one or more COTs requested in the bid requests received from each bidder among the multiple bidders; and Determine the price of each allocated COT according to the lowest bid amount in the auction request corresponding to the COT allocated for the bid request; When the total number of COTs requested in multiple bid requests exceeds the total number of COTs in multiple available COTs: Sort the bid request list according to the highest bid amount of each bid request in the bid request list; Further sort the bid request list according to the submission time of each bid request in the bid request list, so that the highest bid amount is equal to the highest bid amount of the second bid request, and the first bid request with a submission time earlier than the second bid request is ranked higher than the second bid request; Allocate the COTs in the multiple available COTs to each auction request in the bid request list according to the sorting order of each bid request; Determine the price of each COT allocated to each bid request in the bid request list, where determining the price includes: When there are corresponding winning bids for all the COTs requested in multiple bid requests in the bid request list, determine the price of each COT allocated to each bid request in the bid request list according to the bid amount of the first non-winning bidder; and When there are no corresponding winning bids for all the COTs requested in multiple bid requests in the bid request list, determine the price of each COT allocated to each bid request in the bid request list according to the bid amount of the last winning bidder; and Allocate the allocated COTs in the bid request list to each bidder associated with each bid request for which the COT has been allocated in the bid request list.

Images