Algorithm for optimal winner determination in combinatorial auctions
Reads0
Chats0
TLDR
The algorithm allows combinatorial auctions to scale up to significantly larger numbers of items and bids than prior approaches to optimal winner determination by capitalizing on the fact that the space of bids is sparsely populated in practice.About:
This article is published in Artificial Intelligence.The article was published on 2002-02-01 and is currently open access. It has received 1045 citations till now. The article focuses on the topics: Combinatorial auction & Common value auction.read more
Citations
More filters
Proceedings ArticleDOI
Truthful Market-Based Trading of Cloud Services with Reservation Price
TL;DR: This work designs a single-sided market mechanism for trading virtual machine instances in the cloud, where the cloud provider can express the reservation prices for traded services and proves that the proposed mechanism is truthful, i.e. the buyers do not have an incentive to lie about their true valuation of the services.
Journal ArticleDOI
Due-Date Management Through Iterative Bidding
TL;DR: This paper presents an iterative bidding framework as a decentralized decision support tool which enables the integration of key DDM decisions and provides analytical results on the application of the proposed framework to two special cases of the integrated DDM.
Proceedings ArticleDOI
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
TL;DR: A simulated annealing heuristic with hybrid local moves is applied to solve a combinatorial auction brokering problem as a set packing problem and shows that the method is competitive with CPLEX 8.0 and obtains near optimal solutions for the CATS cases.
Journal ArticleDOI
A Framework for Certified Boolean Branch-and-Bound Optimization
TL;DR: An abstract DPLL-based branch-and-bound algorithm that can model optimization concepts such as cost- based propagation and cost-based backjumping is introduced and its uniform method for generating independently verifiable optimality proofs is introduced.
Proceedings ArticleDOI
Combinatorial Auction-Based Fog Service Allocation Mechanism for IoT Applications
TL;DR: This article proposes two types of truthful mechanisms for resource allocation and pricing in fog computing, and investigates that the combinatorial auction based mechanism can essentially enhance the allocation of the resources with high proficiency and creating higher income for the fog providers.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Book
Integer programming
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Journal ArticleDOI
Incentives in Teams
TL;DR: This paper analyzes the problem of inducing the members of an organization to behave as if they formed a team and exhibits a particular set of compensation rules, an optimal incentive structure, that leads to team behavior.