77 search results - page 3 / 16 » A Framework of Winner Determination Algorithms for Internet ... |
AUSAI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
ACMICEC
2003
ACM
13 years 11 months ago
2003
ACM
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...
ATAL
2007
Springer
14 years 7 days ago
2007
Springer
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...
INFOCOM
2009
IEEE
14 years 21 days ago
2009
IEEE
— We design truthful double spectrum auctions where multiple parties can trade spectrum based on their individual needs. Open, market-based spectrum trading motivates existing sp...
JAL
2008
13 years 6 months ago
2008
Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application...