Generalised Network Flows for Combinatorial Auctions

In this paper we address the problem of (1)representing bids for combinatorial auctions and (2) employing those structures for Winner Determination. We propose a graph-based language employing generalized network flows to represent the bids. The interpretation of winner determination is then seen as an aggregation of individual preferences. We motivate the language from representational, conciseness and manipulation points of view.