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
Book ChapterDOI
Rescue System with Sensor Network for Vital Sign Monitoring and Rescue Simulations by Taking into Account Triage with Measured Vital Signs
TL;DR: In this paper, a rescue system with sensor network for vital sign (Body Temperature, Heart Rate, Blood Pressure, Bless Rate and Consciousness) monitoring is proposed together with rescue simulations with consideration of triage by using the measured vital sign.
Book ChapterDOI
Introduction to Combinatorial Auctions
Asuncion Mochon,Yago Saez +1 more
TL;DR: In this chapter, the concept of combinatorial auction (CA), or package auction, is introduced, in this model, the seller offers multiple items in a single auction, in which the bidders are allowed to bid for the items or combinations of items that they want.
Variable Periodic/Fixed Matching Algorithms for Internet-Based Logistics Brokerage Agents
TL;DR: In this article, the authors proposed variable type algorithms for the logistics brokerage agent, in which the matching periods and amounts are changed continuously by considering the balance status between the freights and vehicles.
Journal ArticleDOI
Effiziente, operative Torbelegung mittels kombinatorischer Auktionen
TL;DR: In this paper, a Vickrey-Clarke-Groves mechanism is proposed to solve the operational dock door assignment problem (DDAP), where freight carriers compete for bundles of consecutive time intervals at the dock doors.
Dissertation
Learning and Exploiting Relational Structure for Efficient Inference
TL;DR: A method for learning multiple hierarchical relational clusterings, unifying several previous approaches to relational clustering, and a tractable high-treewidth statistical relational representation based on Sum-Product Networks is described and a learning algorithm for this language is proposed.
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.