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
Journal ArticleDOI
Towards real-time dynamic spectrum auctions
TL;DR: This paper proposes a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic with a compact and highly expressive bidding format, and develops analytical bounds on algorithm performance and complexity to verify the efficiency.
Journal ArticleDOI
Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions
Gediminas Adomavicius,Alok Gupta +1 more
TL;DR: This paper addresses various computational problems that are relevant from the bidder's perspective and introduces two bid evaluation metrics that can be used by bidders to determine whether any given bid can be a part of the winning allocation and explores their theoretical properties.
Journal ArticleDOI
Auction-Based Mechanisms for Electronic Procurement
T. S. Chandrashekar,Yadati Narahari,Charles H. Rosa,Devadatta M. Kulkarni,Jeffrey D. Tew,Dayama Pankaj S +5 more
TL;DR: The survey delineates different representative scenarios in e-procurement where auctions can be deployed and describes the conceptual and mathematical aspects of different categories of procurement auctions, and presents the mathematical formulations under each of the above categories.
Journal ArticleDOI
Auctions for multi-robot task allocation in communication limited environments
TL;DR: It is found that G-Prim and its repeated variant perform relatively well when communication is poor, and that re-sending winner data in later rounds is an easy way to improve the performance of multi-round auctions, in general.
Journal ArticleDOI
Quality-Aware Service Selection for Service-Based Systems Based on Iterative Multi-Attribute Combinatorial Auction
TL;DR: Experimental results show that by exploiting the complementarities between services and the competition among service providers, CASS significantly outperforms existing quality-aware service selection approaches in finding optimal solutions and guaranteeing system optimality.
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.