Patents by Inventor Subhash Suri

Subhash Suri 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).

  • Patent number: 8732047
    Abstract: In a computer-implemented method of contract execution, data about contracts is stored in a computer storage accessible to a processor of a computer along with data about a procurement plan and data about a purchase request that includes information about a first quantity of at least one good or service. The processor determines a second quantity of the one good or service and a second contract against which to complete the purchase request based on the procurement plan, the data about the contracts, at least one purchase made against one of the contracts, a trigger condition and associated effect, and the quantity of at least one good or service. In response to the second contract and the second quantity being approved, the processor causes a purchase order for the second quantity of the one good or service to be placed to the supplier associated with the second contract.
    Type: Grant
    Filed: October 26, 2009
    Date of Patent: May 20, 2014
    Assignee: SciQuest, Inc.
    Inventors: Tuomas Sandholm, David C. Parkes, Craig E. Boutilier, Subhash Suri, Jason J. Brown, Luc H. Mercier
  • Publication number: 20130304636
    Abstract: In a computer-implemented method of conducting expressive payment reconciliation, a purchase transaction is stored in a computer storage accessible to a processor. The processor identifies a contract against which the purchase transaction is made and a first payment amount for the purchase transaction. Contract data is stored in the computer storage and the processor determines a second payment amount for the purchase transaction based on at least one good or service associated with the purchase transaction and the data about the contract. In response to a difference in the first and second payments, the processor either stores computer storage a modified invoice with a modified payment amount, stores in the computer storage a reconciliation payment equal to the payment difference; outputs over a computer network an explanation of the modified payment; or outputs over a computer network a dispute notification.
    Type: Application
    Filed: July 18, 2013
    Publication date: November 14, 2013
    Inventors: Tuomas Sandholm, David C. Parkes, Craig E. Boutilier, Subhash Suri, Jason J. Brown, Luc H. Mercier
  • Patent number: 8494935
    Abstract: In a computer-implemented method of conducting expressive payment reconciliation, a purchase transaction is stored in a computer storage accessible to a processor. The processor identifies a contract against which the purchase transaction is made and a first payment amount for the purchase transaction. Contract data is stored in the computer storage and the processor determines a second payment amount for the purchase transaction based on at least one good or service associated with the purchase transaction and the data about the contract. In response to a difference in the first and second payments, the processor either stores computer storage a modified invoice with a modified payment amount, stores in the computer storage a reconciliation payment equal to the payment difference; outputs over a computer network an explanation of the modified payment; or outputs over a computer network a dispute notification.
    Type: Grant
    Filed: October 26, 2009
    Date of Patent: July 23, 2013
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David C. Parkes, Craig E. Boutilier, Subhash Suri, Jason J. Brown, Luc H. Mercier
  • Patent number: 8195524
    Abstract: In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. At least one of the bids can include a reference ratio; a discount; a price associated with a quantity Q1 of a first item; a price associated with a quantity Q2 of a second item; and a rule that causes said discount to be applied to an average price of Q1 and an average price of Q2 for each instance of the allocated quantity Q1 over the allocated quantity Q2 that equals the reference ratio.
    Type: Grant
    Filed: July 27, 2009
    Date of Patent: June 5, 2012
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
  • Patent number: 8190490
    Abstract: In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied. It can be determined if the exchange is overconstrained and, if so, rules can be relaxed. Also or alternatively, the demand for a quantity of an item can be increased or decreased based on the average cost of the item.
    Type: Grant
    Filed: July 23, 2009
    Date of Patent: May 29, 2012
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
  • Patent number: 8190489
    Abstract: In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. Trigger bid groups and/or rules associated with trigger values can be used to determine whether to apply modification or discounts to bids. Item and bid groups can be partitioned into groups for the purpose of smoothing requirements. Trigger bid groups, rules associated with trigger values, item groups, and bid groups can be used for adjusting or constraining bids based on triggers, logical connectives, and adjustments.
    Type: Grant
    Filed: July 16, 2009
    Date of Patent: May 29, 2012
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
  • Patent number: 8165921
    Abstract: In a live, expressive combinatorial exchange, each of plural bidders can submit a bid. Based on the submitted bids, an allocation of the bids is determined that is optimal for the type of exchange being conducted. At least a portion of each bid of the allocation is displayed to each bidder of a first subset of the bidders that has at least one bid that is not included in the allocation. Each bidder of a subset of the first subset of bidders can then amend one or more of their existing bids or submit a new bid that is considered the next time the allocation is determined. The process of feeding back at least a portion of each bid of the allocation, submitting new bids or amendments to existing bids, and determining a new allocation based on all of the submitted bids continues until a predetermined condition is satisfied.
    Type: Grant
    Filed: February 10, 2009
    Date of Patent: April 24, 2012
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David L. Levine, Subhash Suri, Robert L. Shields, Christopher Cole, Richard James McKenzie, Jr., David C. Parkes, Vincent Conitzer, Benjamin Schmaus
  • Publication number: 20100312663
    Abstract: A method of determining a winning allocation in an auction or exchange includes receiving at least one buy bid that includes a price-quantity demand curve and/or receiving at least one sell bid that includes a price-quantity supply curve. The received curves are utilized to determine clearing prices therefor that maximize a clearing surplus. A winning allocation is determined based on the clearing prices.
    Type: Application
    Filed: July 29, 2010
    Publication date: December 9, 2010
    Applicant: COMBINENET, INC.
    Inventors: Tuomas Sandholm, Subhash Suri
  • Patent number: 7783529
    Abstract: A method of determining a winning allocation in an auction or exchange includes receiving at least one buy bid that includes a price-quantity demand curve and/or receiving at least one sell bid that includes a price-quantity supply curve. The received curves are utilized to determine clearing prices therefor that maximize a clearing surplus. A winning allocation is determined based on the clearing prices.
    Type: Grant
    Filed: April 10, 2003
    Date of Patent: August 24, 2010
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, Subhash Suri
  • Patent number: 7716110
    Abstract: In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can be formed from the received bids, and the one combination of bids which represents the best value in terms of an auction setting, a reverse auction setting and/or an exchange setting can be determined. Thereafter, the bids forming this combination can be declared the winning bids of the auction, reverse auction or exchange.
    Type: Grant
    Filed: April 10, 2003
    Date of Patent: May 11, 2010
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, Subhash Suri
  • Patent number: 7716101
    Abstract: In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can be formed from the received bids, and the one combination of bids which represents the best value in terms of an auction setting, a reverse auction setting and/or an exchange setting can be determined. Thereafter, the bids forming this combination can be declared the winning bids of the auction, reverse auction or exchange.
    Type: Grant
    Filed: February 28, 2007
    Date of Patent: May 11, 2010
    Assignee: CombineNet, Inc,
    Inventors: Tuomas Sandholm, Subhash Suri
  • Publication number: 20100114784
    Abstract: In a computer-implemented method of conducting expressive payment reconciliation, a purchase transaction is stored in a computer storage accessible to a processor. The processor identifies a contract against which the purchase transaction is made and a first payment amount for the purchase transaction. Contract data is stored in the computer storage and the processor determines a second payment amount for the purchase transaction based on at least one good or service associated with the purchase transaction and the data about the contract. In response to a difference in the first and second payments, the processor either stores computer storage a modified invoice with a modified payment amount, stores in the computer storage a reconciliation payment equal to the payment difference; outputs over a computer network an explanation of the modified payment; or outputs over a computer network a dispute notification.
    Type: Application
    Filed: October 26, 2009
    Publication date: May 6, 2010
    Applicant: COMBINENET, INC.
    Inventors: Tuomas Sandholm, David C. Parkes, Craig E. Boutilier, Subhash Suri, Jason J. Brown, Luc H. Mercier
  • Publication number: 20100106653
    Abstract: In a computer-implemented method of contract execution, data about contracts is stored in a computer storage accessible to a processor of a computer along with data about a procurement plan and data about a purchase request that includes information about a first quantity of at least one good or service. The processor determines a second quantity of the one good or service and a second contract against which to complete the purchase request based on the procurement plan, the data about the contracts, at least one purchase made against one of the contracts, a trigger condition and associated effect, and the quantity of at least one good or service. In response to the second contract and the second quantity being approved, the processor causes a purchase order for the second quantity of the one good or service to be placed to the supplier associated with the second contract.
    Type: Application
    Filed: October 26, 2009
    Publication date: April 29, 2010
    Applicant: COMBINENET, INC.
    Inventors: Tuomas Sandholm, David C. Parkes, Craig E. Boutilier, Subhash Suri, Jason J. Brown, Luc H. Mercier
  • Publication number: 20100106652
    Abstract: In a computer-implemented method of procurement strategy optimization, data about a number of contracts is stored in a computer storage accessible to a processor of a computer along with a forecast of a future quantity of at least one good or service to be purchased. The processor of the computer determines a first plan for future procurement against at least one of the stored contracts based on the forecast and the following data specified by the one contract: a good or service, a payment rule, a trigger condition, and an associated effect of the trigger condition. In response to the processor automatically approving the first plan subject to one or more predetermined rules or the processor receiving an approval of the first plan, the processor causes the first plan to be adopted for future procurement.
    Type: Application
    Filed: October 26, 2009
    Publication date: April 29, 2010
    Applicant: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David C. Parkes, Craig E. Boutilier, Subhash Suri, Jason J. Brown, Luc H. Mercier
  • Patent number: 7640189
    Abstract: In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can be formed from the received bids, and the one combination of bids which represents the best value in terms of an auction setting, a reverse auction setting and/or an exchange setting can be determined. Thereafter, the bids forming this combination can be declared the winning bids of the auction, reverse auction or exchange.
    Type: Grant
    Filed: April 10, 2003
    Date of Patent: December 29, 2009
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, Subhash Suri, David L. Levine, Andrew G. Gilpin
  • Publication number: 20090287560
    Abstract: In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. At least one of the bids can include a reference ratio; a discount; a price associated with a quantity Q1 of a first item; a price associated with a quantity Q2 of a second item; and a rule that causes said discount to be applied to an average price of Q1 and an average price of Q2 for each instance of the allocated quantity Q1 over the allocated quantity Q2 that equals the reference ratio.
    Type: Application
    Filed: July 27, 2009
    Publication date: November 19, 2009
    Applicant: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
  • Publication number: 20090281920
    Abstract: In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied. It can be determined if the exchange is overconstrained and, if so, rules can be relaxed. Also or alternatively, the demand for a quantity of an item can be increased or decreased based on the average cost of the item.
    Type: Application
    Filed: July 23, 2009
    Publication date: November 12, 2009
    Applicant: COMBINENET, INC.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
  • Publication number: 20090276329
    Abstract: In a combinatorial exchange, rules can be input for processing bids and a desired exchange objective can be defined. A subset of the rules can be used to determine if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, new allocations can be determined using different subsets of rules each time until the desired exchange objective is satisfied. Trigger bid groups and/or rules associated with trigger values can be used to determine whether to apply modification or discounts to bids. Item and bid groups can be partitioned into groups for the purpose of smoothing requirements. Trigger bid groups, rules associated with trigger values, item groups, and bid groups can be used for adjusting or constraining bids based on triggers, logical connectives, and adjustments.
    Type: Application
    Filed: July 16, 2009
    Publication date: November 5, 2009
    Applicant: CombineNet,Inc.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
  • Patent number: 7610236
    Abstract: A method of processing an exchange includes providing a solver/analyzer for determining a solution that includes at least one of a winning allocation and feasible allocations. At least one bid is received at the solver/analyzer, with each bid including at least one item and an associated price. Exchange description data (EDD) is associated with the at least one bid. The EDD is also received at the solver/analyzer. The processing of the at least one bid is modified in accordance with the at least one feature included in the EDD.
    Type: Grant
    Filed: September 25, 2002
    Date of Patent: October 27, 2009
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, Subhash Suri, David L. Levine, Andrew G. Gilpin, John Heitmann, Robert Lawrence Shields, Jr.
  • Patent number: 7577589
    Abstract: In a combinatorial exchange, a set of rules can be input for processing of bids received in connection with the exchange. At least one bid can be received from each of a plurality of exchange participants and a desired exchange objective can be defined. A determination can be made as a function of a subset of the rules if an allocation of the bids exists that is optimal for the type of exchange being conducted. If the desired exchange objective is not satisfied, the step of determining an allocation is repeated utilizing a different subset of rules each time until the desired exchange objective is satisfied.
    Type: Grant
    Filed: November 24, 2004
    Date of Patent: August 18, 2009
    Assignee: CombineNet, Inc.
    Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov