We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
Andrea Giovannucci, Meritxell Vinyals, Juan A. Rod...
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids. We are interested in b...
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
Marco Alberti, Federico Chesani, Alessio Guerri, M...