The following pages link to CABOB (Q29666):
Displaying 28 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- An interactive approach for bi-attribute multi-item auctions (Q342785) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- Computing optimal outcomes under an expressive representation of settings with externalities (Q414842) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- Solving the combinatorial double auction problem (Q707121) (← links)
- BOB: Improved winner determination in combinatorial auctions and generalizations (Q814442) (← links)
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction (Q947956) (← links)
- Exact algorithms for the matrix bid auction (Q958442) (← links)
- A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions (Q1001362) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- GreedEx---a scalable clearing mechanism for utility computing (Q1020573) (← links)
- Non-linear anonymous pricing combinatorial auctions (Q1042137) (← links)
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support (Q1043359) (← links)
- Market-based pricing in grids: on strategic manipulation and computational cost (Q1046122) (← links)
- Pricing combinatorial auctions. (Q1420433) (← links)
- Bundling equilibrium in combinatorial auctions (Q1885427) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Trading grid services - a multi-attribute combinatorial approach (Q2467246) (← links)
- Combinatorial auctions (Q2480257) (← links)
- Heuristics for a bidding problem (Q2489281) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- Truthful approximation mechanisms for restricted combinatorial auctions (Q2519488) (← links)
- Combinatorial auctions for electronic business (Q2571439) (← links)
- Strong activity rules for iterative combinatorial auctions (Q2655643) (← links)
- Learning Theory and Kernel Machines (Q5305838) (← links)
- Algorithm for optimal winner determination in combinatorial auctions (Q5958538) (← links)
