Research map / Learning theory and algorithms / Submodular and game algorithms
Budget-Feasible Mechanisms for Submodular Welfare Maximization in Procurement Auctions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Procurement Auctions via Approximately Optimal Submodular Optimization (ICML 2025 · similarity 0.92)
- Procurement Auctions with Predictions: Improved Frugality for Facility Location (NeurIPS 2025 · similarity 0.87)
- Multidimensional Bayesian Utility Maximization: Tight Approximations to Welfare (NeurIPS 2025 · similarity 0.87)
- Mechanism Design via the Interim Relaxation (NeurIPS 2025 · similarity 0.86)
- On the Power of Randomization for Obviously Strategy-Proof Mechanisms (AAAI 2025 · similarity 0.86)
- Fair Allocation in Dynamic Mechanism Design (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.