Sciweavers

189 search results - page 12 / 38
» Auctioning Substitutable Goods
Sort
View
ATAL
2008
Springer
13 years 10 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...
IAT
2010
IEEE
13 years 6 months ago
Continuous Double Auction in Grid Computing: An Agent Based Approach to Maximize Profit for Providers
Economic models are found efficient in managing heterogeneous computer resources such as storage, CPU and memory for grid computing. Commodity market, double auction and contract-n...
S. M. Aminul Haque, Saadat M. Alhashmi, Rajendran ...
ATAL
2004
Springer
14 years 1 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 8 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
MANSCI
2007
100views more  MANSCI 2007»
13 years 8 months ago
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Companies such as Zara and World Co. have recently implemented novel product development processes and supply chain architectures enabling them to make more product design and ass...
Felipe Caro, Jérémie Gallien