Combinenet, Inc.

Optimized Markets, Inc.

Other

Sciquest, Inc.

Tuomas Sandholm

Subhash Suri

David Christopher Parkes

Robert L Shields, Jr

David L Levine

Vincent Conitzer

John Paul Dickerson

Fei Peng

Craig Edgar Boutilier

Yuri V Smirnov

Richard James McKenzie

Andrew G Gilpin

Luc H Mercier

Christopher Cole

Benjamin Schmaus

Jason J Brown

William E Walsh

John Heitmann

George L Nemhauser

Wolfram Conen

A method and system for identifying a treatment plan identifies a description of a sequential game. The game is associated with treatment of a medical condition by a course of treatment or drug design. The description may include one or more possible treatment actions that a treater can take to treat the medical condition, and one or more possible medical condition actions that the medical condition can take. The system will identify a model for the sequential game, wherein the model is a large game associated with a large state space. The system may solve the model to generate a treatment plan for the medical condition, wherein the treatment plan includes a set of possible treatment actions. To accommodate the large state space, the system may divide processing steps so that at least some of the model solving is done by a graphics processing unit, while performing other functions via a central processing unit.

Medical treatment planning via sequential games

A system for automatically managing the delivery of media assets allocates the media assets to delivery slots of a media delivery servers so that consumers will receive the media assets when they consume digital media programming at times that correspond to the delivery slots. An example is the automated allocation of sponsored videos to television programs airing on a particular afternoon. The system includes data stores and a campaign manager system. The campaign manager system will automatically allocate digital media assets to delivery slots in a campaign to generate scheduling files that media servers will use to present the allocated media assets to consumers during the assigned delivery slots via media consumption devices.

Automated allocation of media campaign assets to time and program in digital media delivery systems

An embodiment provides a system including, but not necessarily limited to: a processor; a memory in communication with the processor; and computer readable program executable by the processor and configured to: receive, for one or more edges, testing data; store, for the one or more edges, testing data; create, by preferring successful edges over untested edges, an exchange plan, wherein, the exchange plan comprises one or more edges. Other aspects are described and claimed.

Edge tests in barter exchanges

A method and system for managing digital media campaigns accesses a set of programming data that contains various attributes of media assets that a media service provider will present to users. A media advertising campaign manager receives various criteria for the inclusion of advertisements in a particular entity's advertising campaign. The system uses the attributes in the data set to develop an advertising campaign that satisfies the entity's criteria. In various embodiments, the method system may consider the entity's preferences, seller criteria, and campaign requests for other entities.

Digital media campaign management in digital media delivery systems

A system for automatically managing the delivery of digital media assets allocates the digital media assets to programs so that consumers will receive the digital media assets when they consume the programs. An example is the automated allocation of sponsored videos to television programs. The system includes data stores, a digital media server, and a campaign manager system. The campaign manager system will automatically allocate digital media assets to digital programs in a campaign.

A system for automatically managing the delivery of digital media assets allocates the digital media assets to programs so that consumers will receive the digital media assets when they consume the programs. An example is the automated allocation of sponsored videos to television programs. The system includes data stores, a digital media server, and a campaign manager system. The campaign manager system receives consumption data corresponding to digital assets and programs that the consumers have consumed, along with an allocation value or impression delivery value. It then uses that information to automatically allocate digital media assets to digital programs in a campaign.

A system for automatically managing the delivery of digital media assets allocates media assets to video programs so that audience members will receive the digital media assets when they view the video programs. An example is the automated allocation of sponsored videos to television programs. The system includes data stores, a digital media server, and a campaign manager system. The campaign manager system receives consumption data corresponding to a first campaign, along with an allocation value and other parameters, and uses that information to automatically allocate digital media assets to additional digital programming files and their corresponding video programs for a second campaign.

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.

System and method for contract execution against expressive contracts

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.

Automated channel abstraction for advertising auctions

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.

System and method for payment reconciliation against expressive contracts

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 Qof a first item; a price associated with a quantity Qof a second item; and a rule that causes said discount to be applied to an average price of Qand an average price of Qfor each instance of the allocated quantity Qover the allocated quantity Qthat equals the reference ratio.

Items ratio based price/discount adjustment in a combinatorial auction

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.

Bid modification based on logical connections between trigger groups in a combinatorial exchange

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.

Overconstraint detection, rule relaxation and demand reduction in a combinatorial exchange

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.

Growing community of inventors

Pittsburgh, PA, United States of America

Tuomas Sandholm