×

Optimization technique using heap sort

  • US 8,095,491 B1
  • Filed: 12/08/2008
  • Issued: 01/10/2012
  • Est. Priority Date: 12/08/2008
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method for optimizing a decision assignment based on a sought benefit, said method comprising:

  • mapping a plurality of agents to a plurality of actions into a plurality of agent-action pairs;

    designating a benefit to each pair of said plurality of pairs to generate a corresponding plurality of benefits in a set of nodes;

    arranging said set of nodes into a plurality of heaps corresponding to said plurality of agents, such that for each heap in said plurality of heaps, a node having the sought benefit is disposed as a head of said each heap to establish a plurality of heads corresponding to said plurality of heaps, with a tail of said each heap containing any remaining node in said each heap;

    assigning a first head among said plurality of heads as an initial head, said initial head corresponding to an initial action and an initial benefit;

    comparing a second head among said plurality of heads to said initial head, such that said second head corresponds to a second benefit;

    removing, from said each heap, each tail node that includes a tail action corresponding to said initial action; and

    repeating said comparing and removing operations for any remaining heap of said plurality of heaps;

    summing each benefit for said plurality of heads to determine a cumulative benefit.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×