Patents by Inventor Robert L. Shields
Robert L. Shields 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: 20130311304Abstract: 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: ApplicationFiled: July 24, 2013Publication date: November 21, 2013Applicant: CombineNet, Inc.Inventors: Craig E. Boutilier, George L. Nemhauser, David C. Parkes, Tuomas Sandholm, Robert L. Shields, JR., William E. Walsh
-
Patent number: 8515814Abstract: 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: GrantFiled: November 11, 2009Date of Patent: August 20, 2013Assignee: CombineNet, Inc.Inventors: Craig E. Boutilier, George L. Nemhauser, David C. Parkes, Tuomas Sandholm, Robert L. Shields, Jr., William E. Walsh
-
Patent number: 8195524Abstract: 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: GrantFiled: July 27, 2009Date of Patent: June 5, 2012Assignee: CombineNet, Inc.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Patent number: 8190489Abstract: 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: GrantFiled: July 16, 2009Date of Patent: May 29, 2012Assignee: CombineNet, Inc.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Patent number: 8190490Abstract: 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: GrantFiled: July 23, 2009Date of Patent: May 29, 2012Assignee: CombineNet, Inc.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Patent number: 8165921Abstract: 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: GrantFiled: February 10, 2009Date of Patent: April 24, 2012Assignee: 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: 20100121671Abstract: 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: ApplicationFiled: November 11, 2009Publication date: May 13, 2010Applicant: COMBINENET, INC.Inventors: Craig E. Boutilier, George L. Nemhauser, David C. Parkes, Tuomas Sandholm, Robert L. Shields, JR., William E. Walsh
-
Patent number: 7662926Abstract: The present application describes antibodies that selectively bind human Fc?RIIB, with little or no binding to other human Fc?Rs, e.g., human Fc?RIIA. The invention also provides isolated bispecific antibodies comprising an antibody that selectively binds Fc?RIIB, and a second antibody that specifically binds an activating receptor. Various uses, including therapeutic uses, for those antibodies are also described, including administration with anti-tumor antibodies and methods of inhibiting immune responses and suppressing histamine release.Type: GrantFiled: January 18, 2007Date of Patent: February 16, 2010Assignee: Genentech, Inc.Inventors: Andrew C. Chan, Robert L. Shields, Lawren Wu
-
Patent number: 7655229Abstract: The present application describes antibodies that selectively bind human Fc?RIIB, with little or no binding to other human Fc?Rs, e.g., human Fc?RIIA. The invention also provides isolated bispecific antibodies comprising an antibody that selectively binds Fc?RIIB, and a second antibody that specifically binds an activating receptor. Various uses, including therapeutic uses, for those antibodies are also described, including administration with anti-tumor antibodies and methods of inhibiting immune responses and suppressing histamine release.Type: GrantFiled: April 16, 2007Date of Patent: February 2, 2010Inventors: Andrew C. Chan, Robert L. Shields, Lawren Wu
-
Publication number: 20090287560Abstract: 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: ApplicationFiled: July 27, 2009Publication date: November 19, 2009Applicant: CombineNet, Inc.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Publication number: 20090281920Abstract: 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: ApplicationFiled: July 23, 2009Publication date: November 12, 2009Applicant: COMBINENET, INC.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Publication number: 20090276329Abstract: 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: ApplicationFiled: July 16, 2009Publication date: November 5, 2009Applicant: CombineNet,Inc.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Patent number: 7577589Abstract: 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: GrantFiled: November 24, 2004Date of Patent: August 18, 2009Assignee: CombineNet, Inc.Inventors: Tuomas Sandholm, David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Yuri Smirnov
-
Publication number: 20090087428Abstract: The present application describes antibodies that selectively bind human Fc?RIIB, with little or no binding to other human Fc?Rs, e.g., human Fc?RIIA. The invention also provides isolated bispecific antibodies comprising an antibody that selectively binds Fc?RIIB, and a second antibody that specifically binds an activating receptor. Various uses, including therapeutic uses, for those antibodies are also described, including administration with anti-tumor antibodies and methods of inhibiting immune responses and suppressing histamine release.Type: ApplicationFiled: January 18, 2007Publication date: April 2, 2009Inventors: Andrew C. Chan, Robert L. Shields, Lawren Wu
-
Patent number: 7499880Abstract: In a live, expressive combinatorial exchange, each of a plurality of 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: GrantFiled: March 18, 2004Date of Patent: March 3, 2009Assignee: CombineNet, Inc.Inventors: Tuomas Sandholm, Richard James McKenzie, Jr., David L. Levine, David C. Parkes, Subhash Suri, Vincent Conitzer, Robert L. Shields, Benjamin Schmaus, Christopher Cole
-
Patent number: 7353191Abstract: 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: GrantFiled: February 24, 2005Date of Patent: April 1, 2008Assignee: CombineNet,Inc.Inventors: Craig E. Boutilier, Tuomas Sandholm, Robert L. Shields, Jr.
-
Patent number: 5732448Abstract: A stirrup buckle for releasably connecting a stirrup strap to the saddle strap of a saddle. The buckle is a two piece assembly having a base mounting plate with side flanges and a pivoting angled tongue lever member connected thereto pivotally mounted between the side flanges. The base mounting plate securely attaches the buckle to the stirrup strap. At least one post and preferably, a pair of posts are formed on the underside of the tongue lever member. The posts are spaced apart in a side by side relationship extending inwardly from the rear underside of the tongue lever member for insertion through selected spaced holes of the saddle strap. The posts located on the tongue lever member extend through matching slots formed through the surface of the base plate flush with the exterior surface for securing the two straps together.Type: GrantFiled: December 31, 1996Date of Patent: March 31, 1998Inventors: Robert L. Shields, Ben G. Veach
-
Patent number: 5088562Abstract: A hand operated aerator for cutting a plurality of holes in turf and soil to facilitate incoporation of air, water, and plant nutrients into the soil and has an upright member attached to a pan. A plurality of tubes attached to the pan are pushed into the turf and soil to cut holes therein. A foot located below the pan is operatively connected to a lever mechanism that is manually moved to extract the tubes from the turf and soil.Type: GrantFiled: December 3, 1990Date of Patent: February 18, 1992Inventor: Robert L. Shields
-
Patent number: 4982800Abstract: A tool for cutting elongated turf strips has a cutting head secured to lateral stabilizing members. The cutting head is a rectangular box-shaped member having forward peripheral cutting edges. The stabilizing members have rollers that ride on the turf surface to ensure a uniform cutting depth of the cutting head. An upwardly and rearwardly directed handle is pivotally connected to the top wall of the cutting head to facilitate moving the cutting head through turf to cut a strip of sod therefrom.Type: GrantFiled: February 27, 1990Date of Patent: January 8, 1991Inventor: Robert L. Shields
-
Patent number: D376995Type: GrantFiled: July 17, 1995Date of Patent: December 31, 1996Inventors: Ben G. Veach, Robert L. Shields