Graph based solutions to certain determination problems in auctions

摘要

An automatic system for determining outcomes to an auction process represents the auction by a directed graph and uses a K best solutions algorithm (KSP) to determine the K best solutions. The system uses a particular graphical representation. Constraints may be included directly into the graph.