Sciweavers

76 search results - page 6 / 16
» Parameterizing the winner determination problem for combinat...
Sort
View
CEC
2008
IEEE
15 years 4 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
ATAL
2009
Springer
15 years 4 months ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...
CP
2003
Springer
15 years 2 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
152views ECommerce» more  ACMICEC 2003»
15 years 2 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
ECAI
2008
Springer
14 years 11 months ago
BIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions
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...
Madalina Croitoru, Cornelius Croitoru, Paul H. Lew...