{"paper":{"title":"Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chaitanya Swamy, Khaled Elbassioni, Mahmoud Fouz","submitted_at":"2013-11-30T18:41:54Z","abstract_excerpt":"We consider {\\em profit-maximization} problems for {\\em combinatorial auctions} with {\\em non-single minded valuation functions} and {\\em limited supply}.\n  We obtain fairly general results that relate the approximability of the profit-maximization problem to that of the corresponding {\\em social-welfare-maximization} (SWM) problem, which is the problem of finding an allocation $(S_1,\\ldots,S_n)$ satisfying the capacity constraints that has maximum total value $\\sum_j v_j(S_j)$. For {\\em subadditive valuations} (and hence {\\em submodular, XOS valuations}), we obtain a solution with profit $\\OP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0137","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}