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
DissertationDOI
Seleção de fornecedores de serviço de transporte utilizando leilão combinatório de compras: adaptação e aplicação do algoritmo Iterative Deepening Search A* (IDA*).
Posted Content
Continuous set packing and near-Boolean functions
TL;DR: This work proposes a novel near-Boolean optimization method relying on a polynomial multilinear form with variables ranging each in a high-dimensional unit simplex, rather than in the unit interval as usual.
Journal ArticleDOI
A novel multi-robot coordination method using capability category
Liu Lin,Zhiqiang Zheng +1 more
TL;DR: A novel combinatorial bids method followed with some discussions is proposed to solve the multi-robot task allocation problem mainly focusing on the capability category aspect.
On effectiveness of two reverse auction procurement models for multiple buyers
TL;DR: In this paper, the authors compared the performance of two different combinatorial reverse auction models for multiple buyers and found that the group-buying model outperformed multiple independent combinatorially reverse auctions not only in efficiency but also in performance.
Book ChapterDOI
A Demand-Based Allocation Mechanism for Virtual Machine
TL;DR: This work presents an auction framework for VM allocation based on multi-time period, then proves the mechanism satisfies individual rationality and incentive compatibility, and tries to use the real workload file to perform simulation experiments to verify the effectiveness of the improved online mechanism.
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.