Patents by Inventor Robert L. Shields, Jr.

Robert L. Shields, Jr. 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: 20130311304
    Abstract: In a computer-implemented method of determining an abstraction of a plurality of differentiated goods available for exchange, data regarding each differentiated good is stored in a computer storage, wherein the data regarding each differentiated good includes an attribute value assigned to at least one attribute of the differentiated good. A processor of a computer determines a first abstraction of the plurality of differentiated goods based on the stored data. The first abstraction includes at least one abstract good. Each abstract good includes one or more differentiated goods. At least one abstract good of the first abstraction includes at least two distinct differentiated goods. The processor determines for each abstract good a specification for the abstract good based on the data regarding one or more differentiated goods forming the abstract good. The processor stores in the computer storage the specification determined for each abstract good.
    Type: Application
    Filed: July 24, 2013
    Publication date: November 21, 2013
    Applicant: CombineNet, Inc.
    Inventors: Craig E. Boutilier, George L. Nemhauser, David C. Parkes, Tuomas Sandholm, Robert L. Shields, JR., William E. Walsh
  • Patent number: 8515814
    Abstract: In a computer-implemented method of determining an abstraction of a plurality of differentiated goods available for exchange, data regarding each differentiated good is stored in a computer storage, wherein the data regarding each differentiated good includes an attribute value assigned to at least one attribute of the differentiated good. A processor of a computer determines a first abstraction of the plurality of differentiated goods based on the stored data. The first abstraction includes at least one abstract good. Each abstract good includes one or more differentiated goods. At least one abstract good of the first abstraction includes at least two distinct differentiated goods. The processor determines for each abstract good a specification for the abstract good based on the data regarding one or more differentiated goods forming the abstract good. The processor stores in the computer storage the specification determined for each abstract good.
    Type: Grant
    Filed: November 11, 2009
    Date of Patent: August 20, 2013
    Assignee: CombineNet, Inc.
    Inventors: Craig E. Boutilier, George L. Nemhauser, David C. Parkes, Tuomas Sandholm, Robert L. Shields, Jr., William E. Walsh
  • Publication number: 20100121671
    Abstract: In a computer-implemented method of determining an abstraction of a plurality of differentiated goods available for exchange, data regarding each differentiated good is stored in a computer storage, wherein the data regarding each differentiated good includes an attribute value assigned to at least one attribute of the differentiated good. A processor of a computer determines a first abstraction of the plurality of differentiated goods based on the stored data. The first abstraction includes at least one abstract good. Each abstract good includes one or more differentiated goods. At least one abstract good of the first abstraction includes at least two distinct differentiated goods. The processor determines for each abstract good a specification for the abstract good based on the data regarding one or more differentiated goods forming the abstract good. The processor stores in the computer storage the specification determined for each abstract good.
    Type: Application
    Filed: November 11, 2009
    Publication date: May 13, 2010
    Applicant: COMBINENET, INC.
    Inventors: Craig E. Boutilier, George L. Nemhauser, David C. Parkes, Tuomas Sandholm, Robert L. Shields, JR., William E. Walsh
  • Patent number: 7353191
    Abstract: A desirable allocation of bids in a combinatorial exchange can be selected by determining a first candidate allocation of the bids and a first value of a minimax regret, related to the difference in utility between the adversarial allocation and the candidate allocation, as a function of a first adversarial allocation of the bids. Based on the first candidate allocation, a second adversarial allocation of the bids and a first value of a maximum regret related to the difference in utility between the new adversarial allocation and the utility of the candidate allocation can be determined. When the value of the maximum regret is greater than the value of the minimax regret, the candidate allocation can be designated as the desirable allocation.
    Type: Grant
    Filed: February 24, 2005
    Date of Patent: April 1, 2008
    Assignee: CombineNet,Inc.
    Inventors: Craig E. Boutilier, Tuomas Sandholm, Robert L. Shields, Jr.