94 search results - page 9 / 19 » An Algorithm for Multi-Unit Combinatorial Auctions |
IJCAI
2001
13 years 8 months ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
Bidding for multiple items or bundles on online auctions raises challenging problems. We assume that an agent has a valuation function that returns its valuation for an arbitrary ...
ICTAI
2005
IEEE
14 years 9 days ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
CP
2003
Springer
13 years 12 months ago
2003
Springer
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...
GECCO
2005
Springer
14 years 7 days ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...