{"id":"W1497024685","doi":"10.1007/978-3-642-17572-5_39","title":"Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subadditivity; Submodular set function; Profit maximization; Approximation algorithm; Valuation (finance); Combinatorial auction; Mathematical optimization; Maximization; Mathematical economics; Mathematics; Combinatorics; Matroid; Profit (economics); Common value auction; Discrete mathematics; Computer science; Economics; Microeconomics; Statistics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006057019,0.002641659,0.004469269,0.001625028,0.001324838,0.004571407,0.006892496,0.00524685,0.009374049],"category_scores_gemma":[0.02450701,0.002363291,0.002302247,0.004142243,0.002186052,0.007780838,0.003971689,0.005754919,0.001923516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003184146,"about_ca_system_score_gemma":0.002787185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004097173,"about_ca_topic_score_gemma":0.004477666,"domain_scores_codex":[0.9974388,0.00117832,0.0001341842,0.0004293935,0.0004563563,0.000362862],"domain_scores_gemma":[0.9849082,0.01283374,0.000562545,0.0006899304,0.0005953707,0.0004102568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004835517,0.0004491079,0.0007729123,0.0005056065,0.0001685989,0.0001059815,0.0002091116,0.8185712,0.0003797095,0.07472388,0.01015828,0.09347207],"study_design_scores_gemma":[0.00007472185,0.00002616725,0.00004721721,0.00002808337,0.00001854618,0.00002518316,0.00002243995,0.946879,0.00008176092,0.05230551,0.0004845091,0.000006798783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01225197,0.001861333,0.9773059,0.0008887067,0.0001670498,0.0001788901,0.0001629537,0.0004689806,0.006714055],"genre_scores_gemma":[0.284907,0.002018567,0.6985052,0.0006068049,0.0005123878,0.001053191,0.000837504,0.0005215598,0.01103776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009374049,"threshold_uncertainty_score":0.03203297,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0586492496879416,"score_gpt":0.3056682517141979,"score_spread":0.2470190020262563,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}