Sciweavers

JIFS
2007
115views more  JIFS 2007»
13 years 4 months ago
Winner determination for combinatorial auctions for tasks with time and precedence constraints
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...
Güleser K. Demir, Maria L. Gini
FOCS
2008
IEEE
13 years 6 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
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...
Deeparnab Chakrabarty, Gagan Goel
CAEPIA
2009
Springer
13 years 6 months ago
Empirical Hardness for Mixed Auctions
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...
Pablo Almajano, Jesús Cerquides, Juan A. Ro...
ATAL
2010
Springer
13 years 6 months ago
Parameterizing the winner determination problem for combinatorial auctions
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...
David Loker, Kate Larson
ATAL
2008
Springer
13 years 7 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
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...
Brammert Ottens, Ulle Endriss
ATAL
2008
Springer
13 years 7 months ago
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
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...
WSC
2008
13 years 7 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
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...
Joshua C. C. Chan, Dirk P. Kroese
CP
2003
Springer
13 years 10 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
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...
Alessio Guerri, Michela Milano
ACMICEC
2003
ACM
97views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
Risk and user preferences in winner determination
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...
Güleser K. Demir, Maria L. Gini
WLP
2005
Springer
13 years 10 months ago
Expressing Interaction in Combinatorial Auction through Social Integrity Constraints
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...