3433 search results - page 2 / 687 » Heuristics for a bidding problem |
80
Voted
IJCAI
2001
15 years 1 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
109
Voted
AMEC
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Supply chains are a current, challenging problem for agentbased electronic commerce. Motivated by the Trading Agent Competition Supply Chain Management (TAC SCM) scenario...
AUSAI
2005
Springer
15 years 5 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...
FLAIRS
2006
15 years 1 months ago
2006
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
115
click to vote
IJCAI
2001
15 years 1 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...