Patent application number | Description | Published |
20090276329 | Bid Modification Based on Logical Connections Between Trigger Groups in a Combinatorial Exchange - 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. | 11-05-2009 |
20090281920 | Overconstraint Detection, Rule Relaxation and Demand Reduction 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. | 11-12-2009 |
20090287560 | 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. At least one of the bids can include a reference ratio; a discount; a price associated with a quantity Q | 11-19-2009 |
20100106652 | System and Method for Procurement Strategy Optimization Against Expressive Contracts - 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. | 04-29-2010 |
20100106653 | System and Method for Contract Execution Against Expressive Contracts - 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. | 04-29-2010 |
20100114784 | System and Method for Payment Reconciliation Against Expressive Contracts - 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. | 05-06-2010 |
20100121671 | Automated Channel Abstraction for Advertising Auctions - 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. | 05-13-2010 |
20100312663 | Market Clearability in Combinatorial Auctions and Exchanges - 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. | 12-09-2010 |
20130024309 | BARTER CHAINS - Provided is a system, method and program product for facilitating multiple barter transactions between users. Embodiments provide barter chains that begin and end with different participants. Embodiments provide a participant in the barter chain may an altruistic donation expecting nothing in return. Embodiments provide that multiple items of varying value comprise a barter transaction. Embodiments provide that the barter market operator can be a participant and seed the barter chain with one or more items. Embodiments provide that a participant can sell items received or donate them altruistically to start a new barter chain. | 01-24-2013 |
20130304636 | System and Method for Payment Reconciliation Against Expressive Contracts - 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. | 11-14-2013 |
20130311304 | Automated Channel Abstraction for Advertising Auctions - 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. | 11-21-2013 |
20140058872 | AUTOMATED BUNDLING AND PRICING BASED ON PURCHASE DATA - A computer-implemented method includes, in one aspect, accessing historical purchase data that is indicative of items that have been purchased and prices at which each of the items are purchased; for each of the items specified in the historical purchase data, fitting a customer valuation model to a portion of the historical purchase data that pertains to the item, with the customer valuation model specifying purchase preferences, and with a purchase preference specifying a probability a customer will purchase a specific item at a specific price; based on fitted customer valuation models for the items in the historical purchase data, identifying a priceable bundle, with the priceable bundle including at least two of the items specified in the historical purchase data; and applying updated prices to one or more of (i) the priceable bundle, and (ii) the items included in the priceable bundle. | 02-27-2014 |
20140278509 | EDGE TESTS IN BARTER EXCHANGES - 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. | 09-18-2014 |