{"id":"W1593308833","doi":"10.1007/978-3-642-13036-6_13","title":"Secretary Problems via Linear Programming","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Secretary problem; Linear programming; Context (archaeology); Set (abstract data type); Polytope; Order (exchange); Mathematical optimization; Common value auction; Operations research; Algorithm; Programming language; Mathematics; Optimal stopping","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.001259602,0.0005632737,0.0004991547,0.0008827765,0.000396823,0.0008124047,0.004007978,0.0005261382,0.00008160944],"category_scores_gemma":[0.00006770076,0.0005055268,0.0001505736,0.0008251945,0.0008466108,0.0009178495,0.001690924,0.001910893,0.0001194743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001439366,"about_ca_system_score_gemma":0.0006419509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002390978,"about_ca_topic_score_gemma":0.0001186975,"domain_scores_codex":[0.9954612,0.00004058378,0.0005991942,0.001686134,0.001285403,0.0009274986],"domain_scores_gemma":[0.9971334,0.0001984092,0.0002792977,0.001586786,0.0004628554,0.0003392875],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002227085,0.00004213308,0.00002383579,0.00007067839,0.00001062049,0.00006231264,0.001019568,0.06364529,0.0004062217,0.007031662,0.000007374784,0.927678],"study_design_scores_gemma":[0.0002201285,0.000177401,0.00000813142,0.0002284678,0.000004224746,0.00008370444,5.583965e-8,0.9030387,0.0007020946,0.08079757,0.01408626,0.0006532214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000008561069,0.0001918335,0.99246,0.001492122,0.001530857,0.000838225,0.000002223105,0.0003707125,0.003105506],"genre_scores_gemma":[0.006367807,0.00005045147,0.9909204,0.001172675,0.0004861901,0.00002418662,0.00001431368,0.00005003666,0.0009139071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9270248,"threshold_uncertainty_score":0.9997396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01895855999664827,"score_gpt":0.2507265768595182,"score_spread":0.2317680168628699,"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."}}