Cornelius Croitoru

Learn More
— Constraint satisfaction arises in many domains in different forms. Search and inference compete for solving constraint satisfaction problems (CSPs) but the most successful approaches are those which benefit from both techniques. Based on this idea, this article introduces a new scheme for solving the general Max-CSP problem. The new approach exploits the(More)
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid) representing her bids. The interpretation of the winner determination problem as an aggre-gation of individual preferences represented as flowbids allows building an aggregate(More)
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(More)