Sciweavers

17 search results - page 1 / 4
» Bidding Languages and Winner Determination for Mixed Multi-u...
Sort
View
EUMAS
2006
13 years 5 months ago
Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions
We introduce a new type of combinatorial auction that allows agents to bid for goods to buy, for goods to sell, and for transformations of goods. One such transformation can be se...
Jesús Cerquides, Ulle Endriss, Andrea Giova...
ATAL
2007
Springer
13 years 10 months ago
Winner determination for mixed multi-unit combinatorial auctions via petri nets
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high ...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
ATAL
2007
Springer
13 years 10 months ago
On the Empirical Evaluation of Mixed Multi-Unit Combinatorial Auctions
Abstract. Mixed Multi-Unit Combinatorial Auctions extend and generalise all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical ap...
Meritxell Vinyals, Jesús Cerquides
ATAL
2008
Springer
13 years 6 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...
ACMICEC
2003
ACM
152views ECommerce» more  ACMICEC 2003»
13 years 9 months ago
Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
Viet Dung Dang, Nicholas R. Jennings