利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

19 条记录 (耗时 0.021 秒)

    Bilateral assertion model and ledger implementation thereof
    2.
    发明授权
    Bilateral assertion model and ledger implementation thereof 有权

    公开(公告)号：US10404469B2

    公开(公告)日：2019-09-03

    申请号：US15166838

    申请日：2016-05-27

    申请人： Chicago Mercantile Exchange Inc.

    发明人： Ajay Madhavan ,  Stanislav Liberman ,  Kireeti Reddy

    IPC分类号： H04L9/32 ,  G06F21/40 ,  G06Q20/06 ,  G06Q40/00 ,  H04L29/06

    摘要： A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

    MARKET OPERATION THROUGH REGULATION OF INCOMING ORDER MATCH ALLOCATION AND/OR DYNAMIC RESTING ORDER MATCH ALLOCATION PRIORITIES
    3.
    发明申请
    MARKET OPERATION THROUGH REGULATION OF INCOMING ORDER MATCH ALLOCATION AND/OR DYNAMIC RESTING ORDER MATCH ALLOCATION PRIORITIES 审中-公开

    公开(公告)号：US20150262298A1

    公开(公告)日：2015-09-17

    申请号：US14644525

    申请日：2015-03-11

    申请人： Chicago Mercantile Exchange Inc.

    发明人： Paul Callaway ,  Sean Castette ,  Kireeti Reddy ,  Akira Yamaguchi ,  Jose Antonio Acuña-Rohter ,  Pearce Peck-Walden ,  Zachary Bonig

    IPC分类号： G06Q40/04

    CPC分类号： G06Q40/04

    摘要： The disclosed embodiments relate to systems and methods which match or otherwise allocate an incoming order to trade with “resting,” i.e. previously received but not yet matched (fully satisfied), orders, recognizing that the algorithm or rules by which the incoming order is matched/allocated may affect the operation of the market for the financial product being traded. In particular, the disclosed embodiments relate to regulation of a rate of incoming orders by buffering or otherwise batching orders together as they are received and subsequently forwarding batches of orders to a match engine for processing thereby in a manner which may equalize orders from traders having varying abilities to rapid submit orders or otherwise capitalize on market events. The disclosed embodiments further relate to prioritizing the matching of resting orders against an incoming order. In particular, the disclosed embodiments alter the priority of a given resting order to match against an incoming order, relative to other suitably matching resting orders, as a function of how long the orders have been resting on the order book.

    Bilateral assertion model and ledger implementation thereof
    4.
    发明授权
    Bilateral assertion model and ledger implementation thereof 有权

    公开(公告)号：US10346428B2

    公开(公告)日：2019-07-09

    申请号：US15166829

    申请日：2016-05-27

    申请人： Chicago Mercantile Exchange Inc.

    发明人： Ajay Madhavan ,  Stanislav Liberman ,  Kireeti Reddy

    IPC分类号： G06F16/23 ,  G06F16/27 ,  G06Q30/06 ,  G06Q40/04

    摘要： A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

    MARKET OPERATION THROUGH REGULATION OF INCOMING ORDER MATCH ALLOCATION AND/OR DYNAMIC RESTING ORDER MATCH ALLOCATION PRIORITIES
    6.
    发明申请
    MARKET OPERATION THROUGH REGULATION OF INCOMING ORDER MATCH ALLOCATION AND/OR DYNAMIC RESTING ORDER MATCH ALLOCATION PRIORITIES 审中-公开
    市场运作通过调整订单匹配分配和/或动态订单配对优先权

    公开(公告)号：US20150262297A1

    公开(公告)日：2015-09-17

    申请号：US14644460

    申请日：2015-03-11

    申请人： Chicago Mercantile Exchange Inc.

    发明人： Paul Callaway ,  Sean Castette ,  Kireeti Reddy ,  Akira Yamaguchi ,  Jose Antonio Acuña-Rohter ,  Pearce Peck-Walden ,  Zachary Bonig

    IPC分类号： G06Q40/04

    CPC分类号： G06Q40/04

    摘要： The disclosed embodiments relate to systems and methods which match or otherwise allocate an incoming order to trade with “resting,” i.e. previously received but not yet matched (fully satisfied), orders, recognizing that the algorithm or rules by which the incoming order is matched/allocated may affect the operation of the market for the financial product being traded. In particular, the disclosed embodiments relate to regulation of a rate of incoming orders by buffering or otherwise batching orders together as they are received and subsequently forwarding batches of orders to a match engine for processing thereby in a manner which may equalize orders from traders having varying abilities to rapid submit orders or otherwise capitalize on market events. The disclosed embodiments further relate to prioritizing the matching of resting orders against an incoming order. In particular, the disclosed embodiments alter the priority of a given resting order to match against an incoming order, relative to other suitably matching resting orders, as a function of how long the orders have been resting on the order book.

    摘要翻译： 所公开的实施例涉及与“休息”（即先前接收但尚未匹配（完全满足））顺序匹配或以其他方式分配进入订单进行交易的系统和方法，其认识到输入订单匹配的算法或规则 /分配可能影响正在交易的金融产品的市场运作。 特别地，所公开的实施例涉及通过在收到订单时将订单缓冲或以其他方式批量订单来调节进入订单的速率，并且随后将批次的订单转发到匹配引擎以进行处理，从而可以使来自具有不同的 快速提交订单或以其他方式利用市场活动的能力。 所公开的实施例还涉及将休息命令的匹配与输入顺序进行优先级排列。 特别地，所公开的实施例改变了给定休息次序的优先级，以便相对于其他适当匹配的休息次序与输入顺序相匹配，作为订单已经搁置在订单簿上的时间的函数。

    BILATERAL ASSERTION MODEL AND LEDGER IMPLEMENTATION THEREOF
    8.
    发明申请
    BILATERAL ASSERTION MODEL AND LEDGER IMPLEMENTATION THEREOF 有权

    公开(公告)号：US20210019332A9

    公开(公告)日：2021-01-21

    申请号：US16412878

    申请日：2019-05-15

    申请人： Chicago Mercantile Exchange Inc.

    发明人： Ajay Madhavan ,  Stanislav Liberman ,  Kireeti Reddy

    IPC分类号： G06F16/27 ,  G06F16/23 ,  G06Q40/04 ,  G06Q30/06

    摘要： A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

    BILATERAL ASSERTION MODEL AND LEDGER IMPLEMENTATION THEREOF
    9.
    发明申请
    BILATERAL ASSERTION MODEL AND LEDGER IMPLEMENTATION THEREOF 审中-公开

    公开(公告)号：US20170293669A1

    公开(公告)日：2017-10-12

    申请号：US15166829

    申请日：2016-05-27

    申请人： Chicago Mercantile Exchange Inc.

    发明人： Ajay Madhavan ,  Stanislav Liberman ,  Kireeti Reddy

    IPC分类号： G06F17/30

    CPC分类号： G06F16/273 ,  G06F16/2365 ,  G06Q30/0609 ,  G06Q40/04

    摘要： A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.