Capturing complementarity in set functions by going beyond submodularity/subadditivity
From MaRDI portal
Publication:5090397
Recommendations
- Welfare maximization and the supermodular degree
- Constrained monotone function maximization and the supermodular degree
- Communication complexity of combinatorial auctions with submodular valuations
- Inapproximability results for combinatorial auctions with submodular utility functions
- Supermodular mechanism design
Cites Work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- Algorithmic mechanism design (extended abstract)
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Building a good team: secretary problems and the supermodular degree
- Combinatorial auctions with decreasing marginal utilities
- Composable and efficient mechanisms
- Inapproximability results for combinatorial auctions with submodular utility functions
- Network essence: PageRank completion and centrality-conforming Markov chains
- Optimal approximation for the submodular welfare problem in the value oracle model
- The Core of an N Person Game
Cited In (2)
This page was built for publication: Capturing complementarity in set functions by going beyond submodularity/subadditivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090397)
