CABOB
From MaRDI portal
Cited in
(30)- A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions
- Solving multiple scenarios in a combinatorial auction
- GreedEx---a scalable clearing mechanism for utility computing
- Non-linear anonymous pricing combinatorial auctions
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support
- Market-based pricing in grids: on strategic manipulation and computational cost
- Pricing combinatorial auctions.
- Bundling equilibrium in combinatorial auctions
- Tycoon
- A new approach for modeling and solving set packing problems
- Trading grid services - a multi-attribute combinatorial approach
- Combinatorial auctions
- Heuristics for a bidding problem
- The communication requirements of efficient allocations and supporting prices
- Truthful approximation mechanisms for restricted combinatorial auctions
- Combinatorial auctions for electronic business
- Strong activity rules for iterative combinatorial auctions
- GreedEx
- An effective discrete dynamic convexized method for solving the winner determination problem
- An interactive approach for bi-attribute multi-item auctions
- Alternative formulations for the set packing problem and their application to the winner determination problem
- Computing optimal outcomes under an expressive representation of settings with externalities
- Information-theoretic approaches to branching in search
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Learning Theory and Kernel Machines
- Algorithm for optimal winner determination in combinatorial auctions
- Solving the combinatorial double auction problem
- BOB: Improved winner determination in combinatorial auctions and generalizations
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- Exact algorithms for the matrix bid auction
This page was built for software: CABOB
