Patents by Inventor Michael Kurish

Michael Kurish has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20260170544
    Abstract: An online system receives, from a computing device associated with a servicing user, an indication that items are collected for an order. The system identifies a runover by determining that a total value of the items collected for the order is greater than an expected value of the order. The system performs runover verification by: identifying features from the order, the items collected, and the runover, applying a remediation time prediction model to the features to predict an amount of time to remediate the runover, applying an uplift model to the features to predict a differential loss between a loss associated with rejecting the runover and a loss associated with verifying the runover, and verifying or rejecting the runover based on the predicted amount of time to remediate and the predicted differential loss. The online system transmits a notification indicating the verification results.
    Type: Application
    Filed: December 13, 2024
    Publication date: June 18, 2026
    Inventors: Shengwen Fang, Michael Kurish, Mengyu Zhang, Ying Li, Benjamin Knight, Rohit Turumella, Rebecca Riso
  • Publication number: 20260056963
    Abstract: An online system displays items to a user in search results based on appeasement scores for the items, adjusted according to how specific the search query is. The online system receives a search query from a user of an online system. The online system computes a query specificity score, a measure of the specificity of the search query. The online system accesses candidate items from a database that potentially match the search query. For each candidate item, the online system may compute or predict an appeasement score. The online system adjusts the appeasement score based on the query specificity score such that a more specific query weights the appeasement score lower than a less specific query. The online system may then compute a ranking score based on the adjusted appeasement score and display the candidate items to the user based on their ranking scores.
    Type: Application
    Filed: November 4, 2025
    Publication date: February 26, 2026
    Inventors: Levi Boxell, Vinesh Reddy Gudla, Michael Kurish, Raochuan Fan, Tilman Drerup, Tejaswi Tenneti
  • Patent number: 12536571
    Abstract: An online system, such as a concierge service, provides services to users using a set of limited resources. To allocate the limited resources of the system among the users, the system uses a model to predict each user's sensitivity to different levels of service. An allocation module then allocates the limited resources among a set of users based in part on the estimated sensitivities and the supply of available resources.
    Type: Grant
    Filed: May 31, 2023
    Date of Patent: January 27, 2026
    Assignee: Maplebear Inc.
    Inventors: Tilman Drerup, Zhida Gui, Michael Kurish
  • Patent number: 12488009
    Abstract: An online system displays items to a user in search results based on appeasement scores for the items, adjusted according to how specific the search query is. The online system receives a search query from a user of an online system. The online system computes a query specificity score, a measure of the specificity of the search query. The online system accesses candidate items from a database that potentially match the search query. For each candidate item, the online system may compute or predict an appeasement score. The online system adjusts the appeasement score based on the query specificity score such that a more specific query weights the appeasement score lower than a less specific query. The online system may then compute a ranking score based on the adjusted appeasement score and display the candidate items to the user based on their ranking scores.
    Type: Grant
    Filed: August 31, 2023
    Date of Patent: December 2, 2025
    Assignee: Maplebear Inc.
    Inventors: Levi Boxell, Vinesh Reddy Gudla, Michael Kurish, Raochuan Fan, Tilman Drerup, Tejaswi Tenneti
  • Publication number: 20250077529
    Abstract: An online system displays items to a user in search results based on appeasement scores for the items, adjusted according to how specific the search query is. The online system receives a search query from a user of an online system. The online system computes a query specificity score, a measure of the specificity of the search query. The online system accesses candidate items from a database that potentially match the search query. For each candidate item, the online system may compute or predict an appeasement score. The online system adjusts the appeasement score based on the query specificity score such that a more specific query weights the appeasement score lower than a less specific query. The online system may then compute a ranking score based on the adjusted appeasement score and display the candidate items to the user based on their ranking scores.
    Type: Application
    Filed: August 31, 2023
    Publication date: March 6, 2025
    Inventors: Levi Boxell, Vinesh Reddy Gudla, Michael Kurish, Raochuan Fan, Tilman Drerup, Tejaswi Tenneti
  • Publication number: 20240403929
    Abstract: An online system, such as a concierge service, provides services to users using a set of limited resources. To allocate the limited resources of the system among the users, the system uses a model to predict each user's sensitivity to different levels of service. An allocation module then allocates the limited resources among a set of users based in part on the estimated sensitivities and the supply of available resources.
    Type: Application
    Filed: May 31, 2023
    Publication date: December 5, 2024
    Inventors: Tilman Drerup, Zhida Gui, Michael Kurish