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
eMediator: a next generation electronic commerce server
TL;DR: eMediator, a next generation electronic commerce server, demonstrates ways in which AI, algorithmic support, game theoretic incentive engineering, and GUI design can jointly improve the efficiency of ecommerce.
Journal Article
Learning the empirical hardness of optimization problems: The case of combinatorial auctions
TL;DR: This work focuses on the empirical hardness of the winner determination problem--an optimization problem arising in combinatorial auctions--when solved by ILOG's CPLEX software.
Journal ArticleDOI
Virtualization of 5G Cellular Networks as a Hierarchical Combinatorial Auction
Kun Zhu,Ekram Hossain +1 more
TL;DR: In this paper, a hierarchical combinatorial auction mechanism is proposed to solve the resource allocation problem in 5G cellular networks, which satisfies the requirements of efficient resource allocation, strict inter-slice isolation and the ability of intra-slice customization.
Proceedings Article
An Algorithm for Multi-Unit Combinatorial Auctions
TL;DR: This work presents a novel algorithm for computing the optimal winning bids in a combinatorial auction, that is, an auction in which bidders bid for bundles of goods, and proves the correctness of the branch-and-bound algorithm, which incorporates a specialized dynamic programming procedure.
Journal ArticleDOI
A Combinatorial Auction-Based Mechanism for Dynamic VM Provisioning and Allocation in Clouds
Sharrukh Zaman,Daniel Grosu +1 more
TL;DR: This work designs an auction-based mechanism for dynamic VM provisioning and allocation that takes into account the user demand, when making provisioning decisions, and proves that the mechanism is truthful.
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.