A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
In this paper we address the problem of (1) representing bids for combinatorial auctions and (2) employing those structures for "reasoning". We propose a graph-based language who's novelty lies (1) in the use of generalized network flows to represent the bids and (2) in the interpretation of winner determination as an adequate aggregation of individual preferences. We motivate the language both from representational and reasoning points of view and show how our language represents the samedoi:10.1109/wi-iat.2011.201 dblp:conf/iat/CroitoruC11 fatcat:v4jc2sqfzfejjpz3lghpa2ei5u