The submodular welfare problem with demand queries
From MaRDI portal
Recommendations
- Inapproximability results for combinatorial auctions with submodular utility functions
- Optimal approximation for the submodular welfare problem in the value oracle model
- On maximizing welfare when utility functions are subadditive
- On maximizing welfare when utility functions are subadditive
- Communication complexity of combinatorial auctions with submodular valuations
Cited in
(30)- Near-optimal asymmetric binary matrix partitions
- Contention resolution, matrix scaling and fair allocation
- Combinatorial auctions with endowment effect
- Approximation algorithms for the partial assignment problem
- Approximation algorithms for vertex happiness
- A polynomial-time approximation scheme for the airplane refueling problem
- Optimization with demand oracles
- Approximation algorithms for the generalized incremental knapsack problem
- A simple optimal contention resolution scheme for uniform matroids
- On maximizing welfare when utility functions are subadditive
- Near-optimal asymmetric binary matrix partitions
- Combinatorial auctions with conflict-based externalities
- Optimal approximation for the submodular welfare problem in the value oracle model
- Scheduling to Maximize Participation
- Valuated matroid-based algorithm for submodular welfare problem
- When are welfare guarantees robust?
- Separating the communication complexity of truthful and nontruthful algorithms for combinatorial auctions
- Technical note -- The multinomial logit model with sequential offerings: algorithmic frameworks for product recommendation displays
- On maximizing welfare when utility functions are subadditive
- From query complexity to computational complexity
- Communication complexity of combinatorial auctions with submodular valuations
- Mechanism design for perturbation stable combinatorial auctions
- Approximation for maximizing monotone non-decreasing set functions with a greedy method
- Ascending-price mechanism for general multi-sided markets
- Pandora's box problem with time constraints
- Improved truthful mechanisms for combinatorial auctions with submodular bidders
- Towards an optimal contention resolution scheme for matchings
- Pairwise-independent contention resolution
- Simultaneous selection
- Inapproximability results for combinatorial auctions with submodular utility functions
This page was built for publication: The submodular welfare problem with demand queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002824)
