On bidding algorithms for a distributed combinatorial auction
From MaRDI portal
Recommendations
- Distributed algorithms for English auctions. (Extended abstract)
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Approximation algorithms for combinatorial auctions with complement-free bidders
- scientific article; zbMATH DE number 7703279
- The auction algorithm: A distributed relaxation method for the assignment problem
- Combinatorial auctions: a survey
- A new bidding framework for combinatorial e-auctions
- An efficient approximate algorithm for winner determination in combinatorial auctions
- Randomized algorithms for online bounded bidding
Cited in
(4)
This page was built for publication: On bidding algorithms for a distributed combinatorial auction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107969)