Quotables
"The idea that cavalry will be replaced by these iron coaches is absurd. It is little short of treasonous."
Aide-de-camp to Field Marshal Haig ; At a tank demonstration, 1916
PatentStorm News
Make the Most of Our Site
See this month's Top Inventors and Most Cited Patents.
Stay on top of the latest innovations by subscribing to an RSS feed.
Registered users: Manage your profile.
| Number | Title | Issue Date |
| 8165921 | Dynamic exchange method and apparatus 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 ... | 04/24/2012 |
| 8060433 | Method of determining an exchange allocation that promotes truthful bidding and improves the obtainment of exchange objectives In an apparatus and method of solving a combinatorial exchange, a plurality of candidate allocations of input bids is determined from input bids and a set of bid vectors is formed from the input bids. A probability value, representing how likely the bids of a bid ve... | 11/15/2011 |
| 7844540 | Concisely expressed combinatorial auction problem solving method In a method of determining an optimal allocation in a combinatorial auction, a plurality of bids is received. Each bid includes a plurality of sub bids. Each sub bid includes either one good and a price associated with the good or a logical operator logically connec... | 11/30/2010 |
| 7835980 | Bidding language for combinatorial auctions and method of use thereof In a computer-implemented method for finding a high quality allocation of one or more bids in a combinatorial auction, a number of bids is electronically received. Each bid includes a number of sub bids and a Boolean operator logically connecting each pair of sub bi... | 11/16/2010 |
| 7783529 | 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 uti... | 08/24/2010 |
| 7742971 | Preference elicitation in combinatorial auctions In determining a winning allocation in a forward auction, reverse auction or an exchange, a plurality of allocations are defined wherein each allocation defines a trade between one or more potential buyers and one or more potential sellers. At least one potential bu... | 06/22/2010 |
| 7716110 | Branch on bid searching method and apparatus In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can... | 05/11/2010 |
| 7640189 | Combinatorial auction branch on bid searching method and apparatus In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can... | 12/29/2009 |
| 7610236 | Method and apparatus for forming expressive combinatorial auctions and exchanges A method of processing an exchange includes providing a solver/analyzer for determining a solution that includes at least one of a winning allocation and feasible allocations. At least one bid is received at the solver/analyzer, with each bid including at least one ... | 10/27/2009 |
| 7577589 | Method and apparatus for conducting a dynamic 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 determinat... | 08/18/2009 |
| 7499880 | Dynamic exchange method and apparatus 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 alloca... | 03/03/2009 |
| 7487124 | Method and apparatus for solving concisely expressed combinatorial auction problems A method for enabling optimizing software to determine an optimal allocation in a combinatorial auction includes (a) receiving a plurality of bids each of which includes a plurality of sub bids, wherein each sub bid is comprised of one of (1) one good and an associa... | 02/03/2009 |
| 7475035 | Bidding language for combinatorial auctions and method of use thereof In a combinatorial auction, a plurality of bids is received each having a plurality of sub bids and Boolean operators logically connecting each pair of sub bids. A current allocation is determined by allocating goods to at least one of the bids and a best allocation... | 01/06/2009 |
| 7353191 | Method and apparatus for selecting a desirable allocation of bids in a combinatorial exchange setting 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 alloca... | 04/01/2008 |
| 7305363 | Method for optimal winner determination in combinatorial auctions In a multi-unit combinatorial auction, reverse auction, or exchange, a number of bids can be received, with each bid including one or more items and for each item a desired quantity thereof. Each bid also includes a price. A number of unique combinations of bids can... | 12/04/2007 |
| 7010505 | Method of selecting one or more bids in a combinatorial auction A method of selecting a winning allocation of bids in a combinatorial auction includes receiving a plurality of bids and designating a subset of the received bids as a current allocation having no overlap in the items of its bids. For each bid not part of the curren... | 03/07/2006 |
