Decomposing combinatorial auctions and set packing problems
From MaRDI portal
Recommendations
- Tractable combinatorial auctions and \(b\)-matching
- Optimization issues in combinatorial auctions
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
- On heuristics for solving winner determination problem in combinatorial auctions
- Algorithm for optimal winner determination in combinatorial auctions
Cited in
(12)- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Characteristic function games with restricted agent interactions: core-stability and coalition structures
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem
- Alternative formulations for the set packing problem and their application to the winner determination problem
- Preferences single-peaked on a tree: multiwinner elections and structural results
- Fast parallel hypertree decompositions in logarithmic recursion depth
- FPT approximation of generalised hypertree width for bounded intersection hypergraphs
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- FPT approximation of generalised hypertree width for bounded intersection hypergraphs
- Semi-streaming algorithms for hypergraph matching
- Hierarchical package bidding: a paper \& pencil combinatorial auction
This page was built for publication: Decomposing combinatorial auctions and set packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395721)
