{"id":"W2949270856","doi":"10.1137/1.9781611973105.88","title":"Online submodular welfare maximization: Greedy is optimal","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Greedy algorithm; Competitive analysis; Maximization; Monotone polygon; Online algorithm; Mathematical optimization; Greedy randomized adaptive search procedure; Competitive equilibrium; Mathematics; Computer science; Mathematical economics; Upper and lower bounds","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","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002091128,0.0003570039,0.0003478205,0.0002518202,0.0001822484,0.0008524475,0.002266478,0.0003530916,0.003858463],"category_scores_gemma":[0.00003065281,0.0003227529,0.0001618065,0.0003741262,0.00005875064,0.0005179957,0.003331599,0.0006054649,0.0004172019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006972881,"about_ca_system_score_gemma":0.0001765635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002053439,"about_ca_topic_score_gemma":0.00001036198,"domain_scores_codex":[0.9973887,0.0001015754,0.0004699885,0.0009672674,0.0006338344,0.0004386142],"domain_scores_gemma":[0.9974068,0.00001805985,0.0001214528,0.001591446,0.0006007592,0.0002614834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006792149,0.0009619807,0.0004329884,0.0004014273,0.0002295015,0.00005160991,0.00220997,0.5262091,0.00002222128,0.3474145,0.07922439,0.04283562],"study_design_scores_gemma":[0.0002569391,0.00003976601,0.0004245155,0.00003470671,0.000006422796,0.000008221595,0.00002701844,0.9746569,0.00008295669,0.002725962,0.0213033,0.0004332381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007649151,0.0001305513,0.960669,0.02948253,0.0006766621,0.0006807087,0.00003624482,0.0006163359,0.006943068],"genre_scores_gemma":[0.03603182,0.0003226904,0.9450613,0.003220972,0.0002336044,0.0001062992,0.0004276418,0.00005048802,0.01454522],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4484479,"threshold_uncertainty_score":0.9999225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03280591326405214,"score_gpt":0.2694172725693951,"score_spread":0.2366113593053429,"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."}}