Constraint satisfaction for solutions to an auction winner-determination problem

摘要

A set of solutions satisfying a constraint for an auction winner-determination problem are computed by generating a graph of paths, wherein each path represents a solution to the auction winner-determination problem that satisfies the constraint.