Method, apparatus, and embodied data structures for optimal anytime winner determination in combinatorial auction-type problems
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 7, 2001
Grant Date -
N/A
app pub date -
Oct 27, 1998
filing date -
Oct 27, 1998
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
Disclosed is a method and data structures for solution of problems of the class equivalent to optimal allocation determination in a combinatorial auction. The method stores bids in a binary tree which is searched in conjunction with a stopmask data structure which allows, in effect, parts of the binary tree to be instantly pruned during search and in place. Depth-first search in this tree can be done in place without an open list or recursive calls. The main search method operates via recursive call and generates each allocation of positive value once but does not generate others.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully