An efficient approximate algorithm for winner determination in combinatorial auctions

DOI10.1007/3-540-45349-0_47MaRDI QIDQ4473059zbMATH OpenFDO

Authors Yuko Sakurai, Makoto Yokoo, Koji Kamei

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1894/18940549.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• An Efficient Winner Approximation for a Series of Combinatorial Auctions
• Algorithm for optimal winner determination in combinatorial auctions
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• BOB: Improved winner determination in combinatorial auctions and generalizations
• Combinatorial auctions

Cited in

(22)

• A computational analysis of the auction algorithm
• Winner determination in geometrical combinatorial auctions
• Auctions with bidder-determined allowable combinations
• A speedy auction using approximated bidders' preferences
• The cross-entropy method for the winner determination problem in combinatorial auctions
• Combinatorial auctions
• Combinatorial auctions for electronic business
• Approximation algorithms for a winner determination problem of single-item multi-unit auctions
• A heuristic for winner determination in rule-based combinatorial auctions
• A multiple-choice secretary algorithm with applications to online auctions
• On bidding algorithms for a distributed combinatorial auction
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders
• A framework of winner determination algorithms for internet auctions
• An Efficient Winner Approximation for a Series of Combinatorial Auctions
• scientific article; zbMATH DE number 6311405 (Why is no real title available?)
• Greedy Heuristics and Weight-Coded EAs for Multidimensional Knapsack Problems and Multi-Unit Combinatorial Auctions
• Algorithm for optimal winner determination in combinatorial auctions
• Beyond the worst case: semi-random complexity analysis of winner determination
• BOB: Improved winner determination in combinatorial auctions and generalizations
• Exact algorithms for the matrix bid auction

This page was built for publication: An efficient approximate algorithm for winner determination in combinatorial auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473059)