{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002326462,0.0004282631,0.0004856001,0.0009668698,0.0005889091,0.0007581724,0.001654469,0.0004465729,0.00008236601],"category_scores_gemma":[0.0004980176,0.0003103052,0.0001136486,0.001157166,0.00103832,0.0006459224,0.0002201343,0.00063639,0.00005632909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001258296,"about_ca_system_score_gemma":0.0003497703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003405941,"about_ca_topic_score_gemma":0.00006968194,"domain_scores_codex":[0.995643,0.00003547628,0.0008095159,0.001562399,0.001507205,0.0004423613],"domain_scores_gemma":[0.9954594,0.00118714,0.0008051629,0.00118242,0.001217154,0.0001486874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006672462,0.00008712064,0.0001260485,0.00003817134,0.00001455174,0.00000252461,0.001447931,0.05121491,0.003507884,0.01780838,0.0000451802,0.9256406],"study_design_scores_gemma":[0.0005653771,0.0003431297,0.0001469485,0.0001845467,0.00002100964,0.00004370683,0.000002104551,0.4344701,0.01535701,0.5442762,0.004005071,0.0005847409],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004827192,0.0000192969,0.9943092,0.001115578,0.000732392,0.002072118,0.00003324365,0.00009025958,0.0011452],"genre_scores_gemma":[0.1987664,0.000005011195,0.7969564,0.0005668923,0.0007719696,0.0002978542,0.000115474,0.00007067745,0.002449356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9250559,"threshold_uncertainty_score":0.9999349,"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."}}