Valuated matroid-based algorithm for submodular welfare problem
From MaRDI portal
Recommendations
- Optimal approximation for the submodular welfare problem in the value oracle model
- Maximizing a monotone submodular function subject to a matroid constraint
- The submodular welfare problem with demand queries
- Welfare maximization and the supermodular degree
- Online submodular welfare maximization: greedy is optimal
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 1833405 (Why is no real title available?)
- A Note on Kelso and Crawford's Gross Substitutes Condition
- A genetic algorithm for the generalised assignment problem
- A survey of very large-scale neighborhood search techniques
- Algorithm Theory - SWAT 2004
- Budgeted Allocations in the Full-Information Setting
- Buying several indivisible goods
- Combinatorial auctions with decreasing marginal utilities
- Discrete Convex Analysis
- Discrete convex analysis
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Energy Efficient Monitoring in Sensor Networks
- Improved Approximation Algorithms for Budgeted Allocations
- Job Matching, Coalition Formation, and Gross Substitutes
- Matrices and matroids for systems analysis
- Matroid rank functions and discrete concavity
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
- Recent developments in discrete convex analysis
- Submodular function minimization and maximization in discrete convex analysis
- Submodular functions and optimization.
- Tight approximation algorithms for maximum general assignment problems
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
- Walrasian equilibrium with gross substitutes
This page was built for publication: Valuated matroid-based algorithm for submodular welfare problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492835)
