An Efficient Winner Approximation for a Series of Combinatorial Auctions
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2080339
- Algorithm for optimal winner determination in combinatorial auctions
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Efficient constrained combinatorial auctions
- AI 2005: Advances in Artificial Intelligence
- A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions
Cited in
(11)- Winner determination in geometrical combinatorial auctions
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- A speedy auction using approximated bidders' preferences
- The cross-entropy method for the winner determination problem in combinatorial auctions
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions
- A heuristic for winner determination in rule-based combinatorial auctions
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- Approximation algorithms for combinatorial auctions with complement-free bidders
- scientific article; zbMATH DE number 2080339 (Why is no real title available?)
- On the Economic Efficiency of the Combinatorial Clock Auction
- scientific article; zbMATH DE number 6311405 (Why is no real title available?)
This page was built for publication: An Efficient Winner Approximation for a Series of Combinatorial Auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932630)