Hypertree Decompositions for Optimal Winner Determination in Combinatorial Auctions
نویسندگان
چکیده
vii
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
Abstract Combinatorial auctions address the sale of materials where there exist complementarities between items. A major stumbling block to the widespread use of combinatorial auctions is the complexity of winner determination known to be NP-complete. We consider a rich version of combinatorial auctions, rule-based combinatorial auctions, where bids consist of rules that describe acceptable bun...
متن کاملEffects of Approximation on an Iterative Combinatorial Auction
HARISH G KAMMANAHALLI. Effects of Approximation on an Iterative Combinatorial Auction. (Under the direction of Dr Ṗeter Wurman.) Combinatorial auctions are a promising way of solving the complicated heterogeneous resource allocation problem. However combinatorial auctions present inherently hard computational problems for agents and auctioneers. In particular (1) the auction must solve the winn...
متن کاملAn Algorithm for Optimal Winner Determination in Combinatorial Auctions
Combinatorial auctions, i.e. auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, existing approaches for tackling this problem are reviewed: exhaustive enumer...
متن کاملAlgorithms for Distributed Winner Determination in Combinatorial Auctions
The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distribute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008