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
Designing a successful trading agent:A fuzzy set approach
Minghua He,Nicholas R. Jennings +1 more
TL;DR: SouthamptonTAC uses fuzzy techniques at the heart of its decision making: to make bidding decisions in the face of uncertainty, to make predictions about the likely outcomes of auctions, and to alter the agent's bidding strategy in response to the prevailing market conditions.
Group decision making and temporal reasoning
Barbara J. Grosz,Luke Hunsberger +1 more
TL;DR: This thesis provides an abstract framework for the specification of group decision-making mechanisms that computer agents can use to coordinate their planning activity when collaborating with other agents and specifies a combinatorial auction-based mechanism to help them decide whether to engage in a collaborative activity.
Constructing and Clearing Combinatorial Exchanges Using Preference Elicitation
TL;DR: This work presents a design for an auctioneer agent that can construct and clear a combinatorial exchange using preference elicitation and introduces the concept of item discovery that uses elicitation to construct the exchange when there is uncertainty about which items should be considered in the market.
Journal ArticleDOI
The effect of network structure on dynamic team formation in multi‐agent systems
TL;DR: This work has shown that real‐world networks have a rich and purposeful structure, with common properties being observed in many different types of networks.
Proceedings ArticleDOI
An Auction-Based Resource Allocation Model for Green Cloud Computing
Tram Truong Huu,Chen-Khong Tham +1 more
TL;DR: A novel resource allocation model using combinatorial auction mechanisms and taking into account the energy parameter is presented and three monotone and truthful algorithms used for winners determination and payments computation are proposed, namely exhaustive search algorithm (ESA), linear relaxation based randomized algorithm (LRRA) and green greedy algorithm (GGA).
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.