ROBERT L SHIELDS
Engineers in Pittsburgh, PA
License number
Pennsylvania PE006246E
Category
Engineers
Type
Professional Engineer
Address
Address
Pittsburgh, PA 15227
Professional information
Robert Shields - Pittsburgh, PA
Work:
Fort Stewart NCO Academy - Fort Stewart, GA
Information Systems Analyst / Leadership Instructor 3ID, Tikrit, Iraq
Installation Telecommunications Supervisor 3rd Signal Company, 3ID - Fort Stewart, GA
Radio Retransmission Operator United States Army - Baghdad
Contractor Security Staff
Information Systems Analyst / Leadership Instructor 3ID, Tikrit, Iraq
Installation Telecommunications Supervisor 3rd Signal Company, 3ID - Fort Stewart, GA
Radio Retransmission Operator United States Army - Baghdad
Contractor Security Staff
Education:
American Military University
Bachelor of Arts in Management Central Texas College - Killeen, TX
Associate of Arts in General Studies
Bachelor of Arts in Management Central Texas College - Killeen, TX
Associate of Arts in General Studies
Skills:
CompTIA A+ Certified, Information Management Officer, Security Manager
Robert Shields
Location:
Greater Pittsburgh Area
Industry:
Human Resources
Languages:
Korean
Items Ratio Based Price/Discount Adjustment In A Combinatorial Auction
US Patent:
8195524, Jun 5, 2012
Filed:
Jul 27, 2009
Appl. No.:
12/509715
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06Q 30/00
US Classification:
705 263, 705 37
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 Q of a first item; a price associated with a quantity Q of a second item; and a rule that causes said discount to be applied to an average price of Q and an average price of Q for each instance of the allocated quantity Q over the allocated quantity Q that equals the reference ratio.
Optimal Selection Of Communications Common Carrier Plans
US Patent:
2007028, Dec 6, 2007
Filed:
May 22, 2007
Appl. No.:
11/805087
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
Robert Shields - Pittsburgh PA, US
Bryan Bailey - Pittsburgh PA, US
Richard James McKenzie - Butler PA, US
Michael Pete Rose - Pittsburgh PA, US
Nick Kuyakanon - Chicago IL, US
David L. Levine - Chesterfield MO, US
Subhash Suri - Santa Barbara CA, US
Robert Shields - Pittsburgh PA, US
Bryan Bailey - Pittsburgh PA, US
Richard James McKenzie - Butler PA, US
Michael Pete Rose - Pittsburgh PA, US
Nick Kuyakanon - Chicago IL, US
David L. Levine - Chesterfield MO, US
Subhash Suri - Santa Barbara CA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
H04M 11/00
US Classification:
455406
Abstract:
In an allocation of subscribers to one or more wireless carrier rate plans, a number of wireless voice and/or data carrier rate plans is selected and each subscriber's historical wireless time usage for each of a number of foregone time intervals is determined. For each combination of subscriber and rate plan a first expression is defined that includes a unique variable and a cost associated with assigning the subscriber to the rate plan for at least one of the time intervals. Constraints that collectively ensure that subscribers are allocated to a specified minimum or maximum number of rate plans, or restrict a subscriber to be allocated to just one rate plan are determined. The expressions and constraints are processed by an optimal solution solver running on a computer to determine an optimal assignment of subscribers to at least one rate plan.
Overconstraint Detection, Rule Relaxation And Demand Reduction In A Combinatorial Exchange
US Patent:
8190490, May 29, 2012
Filed:
Jul 23, 2009
Appl. No.:
12/508129
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06Q 30/00
US Classification:
705 263, 705 37
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.
Bid Modification Based On Logical Connections Between Trigger Groups In A Combinatorial Exchange
US Patent:
8190489, May 29, 2012
Filed:
Jul 16, 2009
Appl. No.:
12/504262
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06Q 30/00
US Classification:
705 263, 705 37
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.
Automated Scenario Navigation In Combinatorial Exchanges
US Patent:
2005019, Sep 1, 2005
Filed:
Feb 24, 2005
Appl. No.:
11/065333
Inventors:
Craig Boutilier - Toronto, CA
Tuomas Sandholm - Pittsburgh PA, US
Robert Shields - Pittsburgh PA, US
Tuomas Sandholm - Pittsburgh PA, US
Robert Shields - Pittsburgh PA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06F017/60
US Classification:
705014000, 705037000
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.
Method And Apparatus For Conducting A Dynamic Exchange
US Patent:
7577589, Aug 18, 2009
Filed:
Nov 24, 2004
Appl. No.:
10/997765
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Yuri Smirnov - Palo Alto CA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06Q 30/00
US Classification:
705 26, 705 27, 705 37
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.
Dynamic Exchange Method And Apparatus
US Patent:
7499880, Mar 3, 2009
Filed:
Mar 18, 2004
Appl. No.:
10/803549
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Benjamin Schmaus - Pittsburgh PA, US
Christopher Cole - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
David C. Parkes - Cambridge MA, US
Subhash Suri - Santa Barbara CA, US
Vincent Conitzer - Pittsburgh PA, US
Robert L. Shields - Pittsburgh PA, US
Benjamin Schmaus - Pittsburgh PA, US
Christopher Cole - Pittsburgh PA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06Q 30/00
US Classification:
705 26, 705 37
Abstract:
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.
Dynamic Exchange Method And Apparatus
US Patent:
8165921, Apr 24, 2012
Filed:
Feb 10, 2009
Appl. No.:
12/368354
Inventors:
Tuomas Sandholm - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
Subhash Suri - Santa Barbara CA, US
Robert L. Shields - Pittsburgh PA, US
Christopher Cole - Pittsburgh PA, US
David C. Parkes - Cambridge MA, US
Vincent Conitzer - Pittsburgh PA, US
Benjamin Schmaus - Pittsburgh PA, US
David L. Levine - Chesterfield MO, US
Subhash Suri - Santa Barbara CA, US
Robert L. Shields - Pittsburgh PA, US
Christopher Cole - Pittsburgh PA, US
David C. Parkes - Cambridge MA, US
Vincent Conitzer - Pittsburgh PA, US
Benjamin Schmaus - Pittsburgh PA, US
Assignee:
CombineNet, Inc. - Pittsburgh PA
International Classification:
G06Q 30/00
US Classification:
705 263, 705 35, 705 37, 705 39
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.